結果
問題 | No.202 1円玉投げ |
ユーザー | fujisu |
提出日時 | 2015-05-09 06:25:12 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 3,495 ms / 5,000 ms |
コード長 | 3,380 bytes |
コンパイル時間 | 2,428 ms |
コンパイル使用メモリ | 75,612 KB |
実行使用メモリ | 73,444 KB |
最終ジャッジ日時 | 2023-08-23 22:40:07 |
合計ジャッジ時間 | 45,198 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,270 ms
63,664 KB |
testcase_01 | AC | 2,083 ms
63,096 KB |
testcase_02 | AC | 51 ms
49,372 KB |
testcase_03 | AC | 51 ms
49,336 KB |
testcase_04 | AC | 52 ms
49,904 KB |
testcase_05 | AC | 405 ms
65,300 KB |
testcase_06 | AC | 2,435 ms
63,168 KB |
testcase_07 | AC | 2,947 ms
72,092 KB |
testcase_08 | AC | 3,173 ms
61,040 KB |
testcase_09 | AC | 1,447 ms
60,824 KB |
testcase_10 | AC | 802 ms
67,892 KB |
testcase_11 | AC | 1,319 ms
69,668 KB |
testcase_12 | AC | 1,215 ms
61,496 KB |
testcase_13 | AC | 716 ms
59,300 KB |
testcase_14 | AC | 338 ms
59,072 KB |
testcase_15 | AC | 1,549 ms
69,568 KB |
testcase_16 | AC | 1,149 ms
63,236 KB |
testcase_17 | AC | 1,915 ms
72,588 KB |
testcase_18 | AC | 2,067 ms
73,444 KB |
testcase_19 | AC | 1,288 ms
60,956 KB |
testcase_20 | AC | 2,110 ms
65,276 KB |
testcase_21 | AC | 1,489 ms
69,752 KB |
testcase_22 | AC | 99 ms
52,316 KB |
testcase_23 | AC | 119 ms
55,044 KB |
testcase_24 | AC | 108 ms
54,568 KB |
testcase_25 | AC | 136 ms
55,520 KB |
testcase_26 | AC | 130 ms
55,432 KB |
testcase_27 | AC | 132 ms
55,688 KB |
testcase_28 | AC | 132 ms
55,716 KB |
testcase_29 | AC | 146 ms
55,396 KB |
testcase_30 | AC | 151 ms
55,768 KB |
testcase_31 | AC | 133 ms
55,344 KB |
testcase_32 | AC | 139 ms
57,692 KB |
testcase_33 | AC | 149 ms
55,604 KB |
testcase_34 | AC | 142 ms
55,528 KB |
testcase_35 | AC | 1,352 ms
63,256 KB |
testcase_36 | AC | 1,154 ms
63,664 KB |
testcase_37 | AC | 3,495 ms
71,108 KB |
testcase_38 | AC | 1,304 ms
63,440 KB |
testcase_39 | AC | 110 ms
52,528 KB |
testcase_40 | AC | 97 ms
52,196 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(); } } }