結果
問題 | No.1265 Balloon Survival |
ユーザー | tenten |
提出日時 | 2023-08-03 08:44:05 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 649 ms / 2,000 ms |
コード長 | 3,245 bytes |
コンパイル時間 | 2,688 ms |
コンパイル使用メモリ | 92,508 KB |
実行使用メモリ | 70,920 KB |
最終ジャッジ日時 | 2024-04-21 07:30:28 |
合計ジャッジ時間 | 11,047 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
36,668 KB |
testcase_01 | AC | 50 ms
36,756 KB |
testcase_02 | AC | 49 ms
36,792 KB |
testcase_03 | AC | 48 ms
36,752 KB |
testcase_04 | AC | 49 ms
36,988 KB |
testcase_05 | AC | 49 ms
36,760 KB |
testcase_06 | AC | 49 ms
37,008 KB |
testcase_07 | AC | 51 ms
36,916 KB |
testcase_08 | AC | 47 ms
36,808 KB |
testcase_09 | AC | 49 ms
36,976 KB |
testcase_10 | AC | 50 ms
37,080 KB |
testcase_11 | AC | 51 ms
36,964 KB |
testcase_12 | AC | 50 ms
36,852 KB |
testcase_13 | AC | 49 ms
36,796 KB |
testcase_14 | AC | 152 ms
41,616 KB |
testcase_15 | AC | 140 ms
40,744 KB |
testcase_16 | AC | 95 ms
39,060 KB |
testcase_17 | AC | 271 ms
52,160 KB |
testcase_18 | AC | 113 ms
39,340 KB |
testcase_19 | AC | 98 ms
39,184 KB |
testcase_20 | AC | 149 ms
41,888 KB |
testcase_21 | AC | 181 ms
45,760 KB |
testcase_22 | AC | 159 ms
45,420 KB |
testcase_23 | AC | 157 ms
45,492 KB |
testcase_24 | AC | 442 ms
59,528 KB |
testcase_25 | AC | 439 ms
60,212 KB |
testcase_26 | AC | 649 ms
70,920 KB |
testcase_27 | AC | 449 ms
59,544 KB |
testcase_28 | AC | 447 ms
59,752 KB |
testcase_29 | AC | 441 ms
59,460 KB |
testcase_30 | AC | 443 ms
59,464 KB |
testcase_31 | AC | 435 ms
59,444 KB |
testcase_32 | AC | 460 ms
59,384 KB |
testcase_33 | AC | 444 ms
59,276 KB |
testcase_34 | AC | 51 ms
36,952 KB |
testcase_35 | AC | 49 ms
36,844 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); Baloon[] baloons = new Baloon[n]; PriorityQueue<Distance> distatnces = new PriorityQueue<>(); for (int i = 0; i < n; i++) { baloons[i] = new Baloon(sc.nextInt(), sc.nextInt()); for (int j = 0; j < i; j++) { distatnces.add(new Distance(i, j, baloons[i].getDestance(baloons[j]))); } } boolean[] removed = new boolean[n]; int ans = 0; while (distatnces.size() > 0) { Distance d = distatnces.poll(); if (d.right == 0) { if (!removed[d.left]) { ans++; removed[d.left] = true; } } else { if (!removed[d.left] && !removed[d.right]) { removed[d.left] = true; removed[d.right] = true; } } } System.out.println(ans); } static class Distance implements Comparable<Distance> { int left; int right; long value; public Distance(int left, int right, long value) { this.left = left; this.right = right; this.value = value; } public int compareTo(Distance another) { if (value == another.value) { return 0; } else if (value < another.value) { return -1; } else { return 1; } } } static class Baloon { long x; long y; public Baloon(long x, long y) { this.x = x; this.y = y; } public long getDestance(Baloon b) { return (x - b.x) * (x - b.x) + (y - b.y) * (y - b.y); } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }