結果

問題 No.202 1円玉投げ
ユーザー hama_duhama_du
提出日時 2015-05-12 10:41:21
言語 Java21
(openjdk 21)
結果
AC  
実行時間 493 ms / 5,000 ms
コード長 4,776 bytes
コンパイル時間 3,525 ms
コンパイル使用メモリ 79,252 KB
実行使用メモリ 111,672 KB
最終ジャッジ日時 2024-12-22 09:04:41
合計ジャッジ時間 17,381 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 384 ms
107,808 KB
testcase_01 AC 439 ms
111,672 KB
testcase_02 AC 189 ms
83,960 KB
testcase_03 AC 197 ms
84,108 KB
testcase_04 AC 192 ms
83,660 KB
testcase_05 AC 234 ms
86,168 KB
testcase_06 AC 389 ms
105,800 KB
testcase_07 AC 479 ms
107,976 KB
testcase_08 AC 417 ms
107,440 KB
testcase_09 AC 393 ms
105,552 KB
testcase_10 AC 274 ms
86,024 KB
testcase_11 AC 289 ms
96,756 KB
testcase_12 AC 368 ms
103,152 KB
testcase_13 AC 270 ms
89,436 KB
testcase_14 AC 238 ms
86,432 KB
testcase_15 AC 369 ms
105,136 KB
testcase_16 AC 371 ms
108,084 KB
testcase_17 AC 376 ms
107,904 KB
testcase_18 AC 406 ms
108,008 KB
testcase_19 AC 368 ms
105,260 KB
testcase_20 AC 412 ms
105,776 KB
testcase_21 AC 325 ms
105,096 KB
testcase_22 AC 196 ms
84,068 KB
testcase_23 AC 196 ms
84,200 KB
testcase_24 AC 193 ms
84,076 KB
testcase_25 AC 212 ms
83,940 KB
testcase_26 AC 223 ms
83,656 KB
testcase_27 AC 216 ms
84,064 KB
testcase_28 AC 198 ms
83,796 KB
testcase_29 AC 205 ms
83,692 KB
testcase_30 AC 200 ms
84,240 KB
testcase_31 AC 194 ms
84,064 KB
testcase_32 AC 193 ms
83,688 KB
testcase_33 AC 197 ms
83,836 KB
testcase_34 AC 195 ms
84,080 KB
testcase_35 AC 370 ms
108,080 KB
testcase_36 AC 406 ms
109,320 KB
testcase_37 AC 493 ms
109,040 KB
testcase_38 AC 317 ms
107,896 KB
testcase_39 AC 189 ms
83,764 KB
testcase_40 AC 192 ms
83,984 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package yukicoder;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;

/**
 * Created by dhamada on 15/05/12.
 */
public class P202 {

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);

        List<Integer>[][] bucket = new List[1001][1001];
        for (int i = 0 ; i < 1001 ; i++) {
            for (int j = 0 ; j < 1001 ; j++) {
                bucket[i][j] = new ArrayList<>();
            }
        }

        int cnt = 0;
        int n = in.nextInt();
        int[][] pos = new int[n][2];
        for (int i = 0 ; i < n ; i++) {
            int x = in.nextInt();
            int y = in.nextInt();
            pos[i][0] = x;
            pos[i][1] = y;

            int bx = x / 20;
            int by = y / 20;
            boolean conflict = false;
            sch: for (int xi = bx-1 ; xi <= bx+1 ; xi++) {
                for (int yi = by-1 ; yi <= by+1 ; yi++) {
                    if (xi < 0 || yi < 0 || xi >= 1001 || yi >= 1001) {
                        continue;
                    }
                    for (int pi : bucket[xi][yi]) {

                        if (conflict(pos[pi][0], pos[pi][1], x, y)) {
                            conflict = true;
                            break sch;
                        }
                    }
                }
            }
            if (!conflict) {
                cnt++;
                bucket[bx][by].add(i);
            }
        }

        out.println(cnt);
        out.flush();
    }

    static void debug(Object... o) {
        System.err.println(Arrays.deepToString(o));
    }

    static boolean conflict(int x1, int y1, int x2, int y2) {
        int dx = x1 - x2;
        int dy = y1 - y2;
        return (dx * dx + dy * dy) < 400;
    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        private int next() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public char nextChar() {
            int c = next();
            while (isSpaceChar(c))
                c = next();
            if ('a' <= c && c <= 'z') {
                return (char)c;
            }
            if ('A' <= c && c <= 'Z') {
                return (char)c;
            }
            throw new InputMismatchException();
        }

        public String nextToken() {
            int c = next();
            while (isSpaceChar(c))
                c = next();
            StringBuilder res = new StringBuilder();
            do {
                res.append((char)c);
                c = next();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        public int nextInt() {
            int c = next();
            while (isSpaceChar(c))
                c = next();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = next();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = next();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public long nextLong() {
            int c = next();
            while (isSpaceChar(c))
                c = next();
            long sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = next();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = next();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }

}
0