結果

問題 No.202 1円玉投げ
ユーザー hama_duhama_du
提出日時 2015-05-12 10:41:21
言語 Java21
(openjdk 21)
結果
AC  
実行時間 540 ms / 5,000 ms
コード長 4,776 bytes
コンパイル時間 3,698 ms
コンパイル使用メモリ 76,756 KB
実行使用メモリ 111,680 KB
最終ジャッジ日時 2023-08-23 22:47:47
合計ジャッジ時間 17,911 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 386 ms
108,232 KB
testcase_01 AC 404 ms
108,852 KB
testcase_02 AC 181 ms
84,736 KB
testcase_03 AC 181 ms
84,992 KB
testcase_04 AC 179 ms
84,776 KB
testcase_05 AC 237 ms
87,392 KB
testcase_06 AC 444 ms
107,504 KB
testcase_07 AC 540 ms
109,304 KB
testcase_08 AC 502 ms
108,864 KB
testcase_09 AC 372 ms
105,252 KB
testcase_10 AC 263 ms
88,264 KB
testcase_11 AC 330 ms
97,320 KB
testcase_12 AC 339 ms
97,596 KB
testcase_13 AC 267 ms
91,512 KB
testcase_14 AC 243 ms
87,724 KB
testcase_15 AC 379 ms
106,988 KB
testcase_16 AC 367 ms
110,928 KB
testcase_17 AC 385 ms
110,868 KB
testcase_18 AC 386 ms
110,996 KB
testcase_19 AC 377 ms
106,820 KB
testcase_20 AC 400 ms
106,656 KB
testcase_21 AC 390 ms
106,692 KB
testcase_22 AC 188 ms
84,620 KB
testcase_23 AC 193 ms
84,764 KB
testcase_24 AC 186 ms
84,684 KB
testcase_25 AC 199 ms
85,668 KB
testcase_26 AC 191 ms
84,944 KB
testcase_27 AC 192 ms
84,772 KB
testcase_28 AC 199 ms
85,432 KB
testcase_29 AC 196 ms
85,728 KB
testcase_30 AC 189 ms
84,572 KB
testcase_31 AC 187 ms
84,640 KB
testcase_32 AC 190 ms
85,012 KB
testcase_33 AC 190 ms
84,608 KB
testcase_34 AC 194 ms
84,620 KB
testcase_35 AC 439 ms
111,680 KB
testcase_36 AC 399 ms
108,404 KB
testcase_37 AC 457 ms
108,884 KB
testcase_38 AC 385 ms
108,468 KB
testcase_39 AC 184 ms
84,816 KB
testcase_40 AC 185 ms
84,744 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