提出 #71327830

---

ソースコード 拡げる

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;

class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        FastScanner sc = new FastScanner();

        int N = sc.nextInt();
        int[][] grid = new int[2002][2002];
        int[] U = new int[N];
        int[] L = new int[N];
        int[] D = new int[N];
        int[] R = new int[N];
        for (int i = 0; i < N; i++) {
            U[i] = sc.nextInt();
            D[i] = sc.nextInt();
            L[i] = sc.nextInt();
            R[i] = sc.nextInt();

            grid[U[i]][L[i]] += 1;
            grid[U[i]][R[i]+1] -= 1;
            grid[D[i]+1][L[i]] -= 1;
            grid[D[i]+1][R[i]+1] += 1;
        }

        for (int i = 1; i < 2001; i++) {
            for (int j = 1; j < 2001; j++) {
                grid[i][j] += grid[i][j-1];
            }
        }
        for (int i = 1; i < 2001; i++) {
            for (int j = 1; j < 2001; j++) {
                grid[j][i] += grid[j-1][i];
            }
        }

        // for (int i = 0; i < 10; i++) {
        //     for (int j = 0; j < 2002; j++) {
        //         System.out.print(grid[i][j]);
        //     }
        //     System.out.println();
        // }

        int all = 0;
        for (int i = 1; i < 2001; i++) {
            for (int j = 1; j < 2001; j++) {
                if (grid[i][j] == 0) all++;
            }
        }

        for (int i = 0; i < 2002; i++) {
            for (int j = 0; j < 2002; j++) {
                if (grid[i][j] != 1) grid[i][j] = 0;
                // if (grid[i][j] == 2){
                //     grid[i][j] = 1;
                //     // grid[i][j+1] -= 1;
                //     // grid[i+1][j] -= 1;
                //     // grid[i+1][j+1] += 1;
                // }
            }
        }

        for (int i = 1; i < 2001; i++) {
            for (int j = 1; j < 2001; j++) {
                grid[i][j] += grid[i][j-1];
            }
        }
        for (int i = 1; i < 2001; i++) {
            for (int j = 1; j < 2001; j++) {
                grid[j][i] += grid[j-1][i];
            }
        }

        // for (int i = 0; i < 10; i++) {
        //     for (int j = 0; j < 2002; j++) {
        //         System.out.print(grid[i][j]);
        //     }
        //     System.out.println();
        // }

        // System.out.println();
        for (int i = 0; i < N; i++) {
            System.out.println(all + grid[D[i]][R[i]] + grid[U[i]-1][L[i]-1] - grid[U[i]-1][R[i]] - grid[D[i]][L[i]-1]);
            // System.out.println(grid[D[i]][R[i]] + grid[U[i]-1][L[i]-1] - grid[U[i]-1][R[i]] - grid[D[i]][L[i]-1]);
        }

        out.flush();
    }

    private static class FastScanner {
        private final InputStream in = System.in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;

        private boolean hasNextByte() {
            if (ptr < buflen) {
                return true;
            } else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                return buflen > 0;
            }
        }

        private int readByte() {
            if (hasNextByte()) return buffer[ptr++];
            else return -1;
        }

        private static boolean isPrintableChar(int c) {
            return 33 <= c && c <= 126;
        }

        public boolean hasNext() {
            while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
            return !hasNextByte();
        }

        public String next() {
            if (hasNext()) throw new NoSuchElementException();
            StringBuilder sb = new StringBuilder();
            int b = readByte();
            while (isPrintableChar(b)) {
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }

        public long nextLong() {
            if (hasNext()) throw new NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) {
                throw new NumberFormatException();
            }
            while (true) {
                if ('0' <= b && b <= '9') {
                    n *= 10;
                    n += b - '0';
                } else if (b == -1 || !isPrintableChar(b)) {
                    return minus ? -n : n;
                } else {
                    throw new NumberFormatException();
                }
                b = readByte();
            }
        }

        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
}

提出情報

ジャッジ結果