挑战程序竞赛系列(88):3.6平面扫描(2)

挑战程序竞赛系列(88):3.6平面扫描(2)

传送门:POJ 3168: Barn Expansion

题意:

求不重叠的矩形个数。

当然,题意是说求能够被扩大的矩形个数,很坑爹,一开始以为扩大的单位是1格,其实题目中明确指出: at least some amount without bumping into another barn,英文是硬伤,所以只要不重叠即可。

思路参考hankcs,把矩形抽象成一个个区间,对应于水平区间和垂直区间,定义每个区间的起点和终点。设置一个计数器,遇到起点计数+1,遇到终点计数-1。

那么矩形不重叠等价于对应于的起点计数不超过2。

接着分别沿x轴扫描,和y轴扫描即可。注意一个细节,排序时,横纵坐标相同时,起点优先,因为corner相碰算重叠。

代码如下:

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main{

    String INPUT = "./data/judge/201709/P3168.txt";

    public static void main(String[] args) throws IOException {
        new Main().run();
    }

    static final int MAX_N = 25000 + 16;

    class Point implements Comparable<Point>{
        int ord;         // 当前轴坐标
        int pos;         // 另一轴上的坐标
        int id;          // 对应的矩阵id
        int type;        // 起点: 0 终点: 1

        Point(int ord, int pos, int id, int type){
            this.ord  = ord;
            this.pos  = pos;
            this.id   = id;
            this.type = type;
        }

        @Override
        public int compareTo(Point that) {
            if (this.ord != that.ord) {
                return this.ord - that.ord;
            }
            if (this.pos != that.pos) {
                return this.pos - that.pos;
            }
            return this.type - that.type;
        }
    }

    int N;
    Point[] toX = new Point[4 * MAX_N];     // 以x轴方向扫描
    Point[] toY = new Point[4 * MAX_N];     // 以y轴方向扫描
    boolean[] ok = new boolean[MAX_N];

    void scan(Point[] ps) {

        for (int i = 0; i < 4 * N; ++i) {

            int j = i;
            while (j < 4 * N && ps[j].ord == ps[i].ord) j++;

            boolean invalid = false;
            int share = 0;

            for (int k = i; k < j; ++k) {
                Point p = ps[k];
                if (invalid) {
                    ok[p.id] = false;
                }
                if (p.type == 0) {
                    share ++;
                    if (share >= 2) {
                        invalid = true;
                    }
                }
                else {
                    share --;
                    if (share == 0) {
                        invalid = false;
                    }
                }
            }
            i = j - 1;
        }
    }

    void solve() {

        Arrays.sort(toX, 0, 4 * N);
        Arrays.sort(toY, 0, 4 * N);

        Arrays.fill(ok, true);

        scan(toX);
        scan(toY);

        int ans = 0;
        for (int i = 0; i < N; ++i) {
            if (ok[i]) ans ++;
        }

        out.println(ans);
    }

    void read() {
        N = ni();
        for (int i = 0; i < N; ++i) {
            int A = ni(), B = ni(), C = ni(), D = ni();
            toX[4 * i]     = new Point(A, B, i, 0);
            toX[4 * i + 1] = new Point(A, D, i, 1);
            toX[4 * i + 2] = new Point(C, B, i, 0);
            toX[4 * i + 3] = new Point(C, D, i, 1);

            toY[4 * i]     = new Point(B, A, i, 0);
            toY[4 * i + 1] = new Point(B, C, i, 1);
            toY[4 * i + 2] = new Point(D, A, i, 0);
            toY[4 * i + 3] = new Point(D, C, i, 1);
        }

        solve();
    }

    FastScanner in;
    PrintWriter out;

    void run() throws IOException {
        boolean oj;
        try {
            oj = ! System.getProperty("user.dir").equals("F:\\java_workspace\\leetcode");
        } catch (Exception e) {
            oj = System.getProperty("ONLINE_JUDGE") != null;
        }

        InputStream is = oj ? System.in : new FileInputStream(new File(INPUT));
        in = new FastScanner(is);
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        read();
        out.flush();
        if (!oj){
            System.out.println("[" + (System.currentTimeMillis() - s) + "ms]");
        }
    }

    public boolean more(){
        return in.hasNext();
    }

    public int ni(){
        return in.nextInt();
    }

    public long nl(){
        return in.nextLong();
    }

    public double nd(){
        return in.nextDouble();
    }

    public String ns(){
        return in.nextString();
    }

    public char nc(){
        return in.nextChar();
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;
        boolean hasNext;

        public FastScanner(InputStream is) throws IOException {
            br = new BufferedReader(new InputStreamReader(is));
            hasNext = true;
        }

        public String nextToken() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    hasNext = false;
                    return "##";
                }
            }
            return st.nextToken();
        }

        String next = null;
        public boolean hasNext(){
            next = nextToken();
            return hasNext;
        }

        public int nextInt() {
            if (next == null){
                hasNext();
            }
            String more = next;
            next = null;
            return Integer.parseInt(more);
        }

        public long nextLong() {
            if (next == null){
                hasNext();
            }
            String more = next;
            next = null;
            return Long.parseLong(more);
        }

        public double nextDouble() {
            if (next == null){
                hasNext();
            }
            String more = next;
            next = null;
            return Double.parseDouble(more);
        }

        public String nextString(){
            if (next == null){
                hasNext();
            }
            String more = next;
            next = null;
            return more;
        }

        public char nextChar(){
            if (next == null){
                hasNext();
            }
            String more = next;
            next = null;
            return more.charAt(0);
        }
    }
}

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏Jed的技术阶梯

HBase Java API 03:HBase与MapReduce整合

编写MapReduce程序,把"student"表中"info"列族下的"name"那一列抽取出来,存入新HBase表"student_extract"中,要求...

752
来自专栏机器学习入门

挑战程序竞赛系列(85):3.6极限情况(2)

挑战程序竞赛系列(85):3.6极限情况(2) 传送门:POJ 1418: Viva Confetti 题意: 礼花:Confetti 是一些大小不一的彩色圆...

1855
来自专栏Python专栏

【数据结构与算法】一起搞定面试中的二叉树题目(二)

1183
来自专栏码匠的流水账

聊聊spring cloud的HystrixCircuitBreakerConfiguration

本文主要研究一下spring cloud的HystrixCircuitBreakerConfiguration

792
来自专栏郭耀华‘s Blog

LeetCode第六天

第六天 30.(219) Contains Duplicate II ? JAVA class Solution { public boolean co...

2667
来自专栏Netkiller

Spring data 数据库建表(一对一,一对多,多对多)

本文节选择电子书《Netkiller Java 手札》 DBA 如果你在不学习编程,你将失业。如今我们对DBA的依赖越来越少,多数框架都支持实体关系映射,通过面...

3525
来自专栏JackieZheng

漫谈可视化Prefuse(五)---一款属于我自己的可视化工具

  伴随着前期的基础积累,翻过API,读过一些Demo,总觉得自己已经摸透了Prefuse,小打小闹似乎已经无法满足内心膨胀的自己。还记得儿时看的《武状元苏乞儿...

2388
来自专栏机器学习入门

挑战程序竞赛系列(86):3.6极限情况(3)

挑战程序竞赛系列(86):3.6极限情况(3) 传送门:AOJ 2201: Immortal Jewels 翻译参考至hankcs: http://www....

19510
来自专栏pangguoming

sharding-jdbc之——分库分表实例

转载请注明出处:http://blog.csdn.net/l1028386804/article/details/79368021

751
来自专栏菩提树下的杨过

ORACLE:写Function时,传入参数变量名的注意事项

oracle中开发人员写自己的sql function时,入口参数名不要与select中table的字段名重复,否则虽然编译能正常通过,但运行的结果往往是错误的...

1765

扫码关注云+社区