結果
問題 | No.202 1円玉投げ |
ユーザー | fujisu |
提出日時 | 2015-05-09 06:25:12 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 2,535 ms / 5,000 ms |
コード長 | 3,380 bytes |
コンパイル時間 | 2,377 ms |
コンパイル使用メモリ | 78,772 KB |
実行使用メモリ | 73,104 KB |
最終ジャッジ日時 | 2024-06-01 20:05:58 |
合計ジャッジ時間 | 40,349 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,258 ms
63,432 KB |
testcase_01 | AC | 2,063 ms
63,912 KB |
testcase_02 | AC | 54 ms
50,140 KB |
testcase_03 | AC | 52 ms
50,028 KB |
testcase_04 | AC | 54 ms
50,144 KB |
testcase_05 | AC | 286 ms
59,568 KB |
testcase_06 | AC | 2,365 ms
72,132 KB |
testcase_07 | AC | 2,535 ms
63,708 KB |
testcase_08 | AC | 2,496 ms
63,576 KB |
testcase_09 | AC | 1,373 ms
61,720 KB |
testcase_10 | AC | 717 ms
67,984 KB |
testcase_11 | AC | 1,006 ms
61,664 KB |
testcase_12 | AC | 1,096 ms
61,696 KB |
testcase_13 | AC | 769 ms
67,944 KB |
testcase_14 | AC | 468 ms
67,832 KB |
testcase_15 | AC | 1,522 ms
71,176 KB |
testcase_16 | AC | 1,121 ms
63,504 KB |
testcase_17 | AC | 1,413 ms
71,132 KB |
testcase_18 | AC | 1,365 ms
73,104 KB |
testcase_19 | AC | 1,149 ms
61,472 KB |
testcase_20 | AC | 1,834 ms
63,492 KB |
testcase_21 | AC | 1,392 ms
69,912 KB |
testcase_22 | AC | 115 ms
52,552 KB |
testcase_23 | AC | 131 ms
55,644 KB |
testcase_24 | AC | 115 ms
54,408 KB |
testcase_25 | AC | 136 ms
55,504 KB |
testcase_26 | AC | 137 ms
55,748 KB |
testcase_27 | AC | 130 ms
55,468 KB |
testcase_28 | AC | 128 ms
55,516 KB |
testcase_29 | AC | 137 ms
55,360 KB |
testcase_30 | AC | 141 ms
55,568 KB |
testcase_31 | AC | 127 ms
55,480 KB |
testcase_32 | AC | 151 ms
55,620 KB |
testcase_33 | AC | 139 ms
55,628 KB |
testcase_34 | AC | 138 ms
55,428 KB |
testcase_35 | AC | 1,272 ms
71,108 KB |
testcase_36 | AC | 941 ms
62,696 KB |
testcase_37 | AC | 2,506 ms
63,716 KB |
testcase_38 | AC | 1,273 ms
63,880 KB |
testcase_39 | AC | 112 ms
52,432 KB |
testcase_40 | AC | 102 ms
51,648 KB |
ソースコード
import java.io.IOException; import java.util.HashSet; import java.util.InputMismatchException; 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(int x, int y, int a, int b) { return (x - a) * (x - a) + (y - b) * (y - b) < 400; } void run() { MyScanner sc = new MyScanner(); HashSet<Integer>[] set = new HashSet[20001]; for (int i = 0; i < 20001; i++) { set[i] = new HashSet<Integer>(); } int n = sc.nextInt(); int ans = 0; L: for (int i = 0; i < n; i++) { int x = sc.nextInt(); int y = sc.nextInt(); int minX = Math.max(x - 19, 0); int maxX = Math.min(x + 19, 20000); // int minY = Math.max(y - 19, 0); // int maxY = Math.min(y + 19, 20000); for (int j = minX; j <= maxX; j++) { int dy = (int) Math.sqrt(399 - (j - x) * (j - x) + 0.0001); // for (int k = minY; k <= maxY; k++) { int minY = Math.max(y - dy, 0); int maxY = Math.min(y + dy, 20000); for (int k = minY; k <= maxY; k++) { if (!isIntersect(x, y, j, k)) { continue; } if (!set[j].contains(k)) { continue; } if (isIntersect(x, y, j, k)) { continue L; } } } set[x].add(y); 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(); } } }