結果
問題 | No.202 1円玉投げ |
ユーザー | fujisu |
提出日時 | 2015-05-09 06:42:53 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,875 ms / 5,000 ms |
コード長 | 3,346 bytes |
コンパイル時間 | 2,392 ms |
コンパイル使用メモリ | 76,040 KB |
実行使用メモリ | 87,028 KB |
最終ジャッジ日時 | 2023-08-23 22:41:49 |
合計ジャッジ時間 | 33,948 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,032 ms
80,912 KB |
testcase_01 | AC | 1,808 ms
84,304 KB |
testcase_02 | AC | 55 ms
52,484 KB |
testcase_03 | AC | 54 ms
52,564 KB |
testcase_04 | AC | 56 ms
52,328 KB |
testcase_05 | AC | 194 ms
62,244 KB |
testcase_06 | AC | 1,316 ms
77,904 KB |
testcase_07 | AC | 1,431 ms
84,064 KB |
testcase_08 | AC | 1,593 ms
84,080 KB |
testcase_09 | AC | 1,041 ms
75,228 KB |
testcase_10 | AC | 508 ms
71,952 KB |
testcase_11 | AC | 934 ms
75,016 KB |
testcase_12 | AC | 898 ms
75,860 KB |
testcase_13 | AC | 595 ms
73,004 KB |
testcase_14 | AC | 216 ms
62,796 KB |
testcase_15 | AC | 658 ms
67,508 KB |
testcase_16 | AC | 1,825 ms
86,740 KB |
testcase_17 | AC | 1,870 ms
86,080 KB |
testcase_18 | AC | 1,875 ms
87,028 KB |
testcase_19 | AC | 1,015 ms
75,716 KB |
testcase_20 | AC | 1,262 ms
76,060 KB |
testcase_21 | AC | 994 ms
75,088 KB |
testcase_22 | AC | 158 ms
58,248 KB |
testcase_23 | AC | 110 ms
56,600 KB |
testcase_24 | AC | 114 ms
57,036 KB |
testcase_25 | AC | 101 ms
56,536 KB |
testcase_26 | AC | 156 ms
56,948 KB |
testcase_27 | AC | 123 ms
57,008 KB |
testcase_28 | AC | 100 ms
54,560 KB |
testcase_29 | AC | 108 ms
56,968 KB |
testcase_30 | AC | 107 ms
56,080 KB |
testcase_31 | AC | 94 ms
56,496 KB |
testcase_32 | AC | 113 ms
56,792 KB |
testcase_33 | AC | 104 ms
56,832 KB |
testcase_34 | AC | 122 ms
56,880 KB |
testcase_35 | AC | 1,717 ms
83,120 KB |
testcase_36 | AC | 760 ms
82,400 KB |
testcase_37 | AC | 1,631 ms
83,748 KB |
testcase_38 | AC | 1,806 ms
84,868 KB |
testcase_39 | AC | 97 ms
54,416 KB |
testcase_40 | AC | 90 ms
53,656 KB |
ソースコード
import java.io.IOException; import java.util.InputMismatchException; import java.util.TreeSet; public class Main { class Point implements Comparable<Point> { int x, y; Point(int x, int y) { this.x = x; this.y = y; } @Override public int compareTo(Point o) { return this.x != o.x ? this.x - o.x : this.y - o.y; } } boolean isIntersect(Point a, Point b) { return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y) < 400; } void run() { MyScanner sc = new MyScanner(); TreeSet<Point>[] X = new TreeSet[20001]; TreeSet<Point>[] Y = new TreeSet[20001]; for (int i = 0; i < 20001; i++) { X[i] = new TreeSet<Point>(); Y[i] = new TreeSet<Point>(); } int n = sc.nextInt(); int ans = 0; L: for (int i = 0; i < n; i++) { int x = sc.nextInt(); int y = sc.nextInt(); Point p = new Point(x, y); for (int j = Math.max(0, y - 19); j <= Math.min(20000, y + 19); j++) { for (Point q : Y[j]) { if (isIntersect(p, q)) { continue L; } if (p.x < q.x && !isIntersect(p, q)) { break; } } } for (int j = Math.max(0, x - 19); j <= Math.min(20000, x + 19); j++) { for (Point q : X[j]) { if (isIntersect(p, q)) { continue L; } if (p.y < q.y && !isIntersect(p, q)) { break; } } } X[x].add(p); Y[y].add(p); ans++; } System.out.println(ans); } public static void main(String[] args) { new Main().run(); } public void mapDebug(int[][] a) { System.out.println("--------map display---------"); for (int i = 0; i < a.length; i++) { for (int j = 0; j < a[i].length; j++) { System.out.printf("%3d ", a[i][j]); } System.out.println(); } System.out.println("----------------------------" + '\n'); } class MyScanner { int read() { try { return System.in.read(); } catch (IOException e) { throw new InputMismatchException(); } } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }