結果
問題 | No.1265 Balloon Survival |
ユーザー | tenten |
提出日時 | 2023-02-16 18:07:05 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 709 ms / 2,000 ms |
コード長 | 3,196 bytes |
コンパイル時間 | 2,892 ms |
コンパイル使用メモリ | 93,688 KB |
実行使用メモリ | 80,556 KB |
最終ジャッジ日時 | 2023-09-25 22:22:30 |
合計ジャッジ時間 | 14,345 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
47,800 KB |
testcase_01 | AC | 46 ms
49,724 KB |
testcase_02 | AC | 45 ms
49,716 KB |
testcase_03 | AC | 47 ms
49,712 KB |
testcase_04 | AC | 46 ms
49,768 KB |
testcase_05 | AC | 47 ms
49,732 KB |
testcase_06 | AC | 48 ms
49,652 KB |
testcase_07 | AC | 47 ms
49,740 KB |
testcase_08 | AC | 47 ms
49,708 KB |
testcase_09 | AC | 45 ms
49,680 KB |
testcase_10 | AC | 46 ms
49,604 KB |
testcase_11 | AC | 46 ms
49,624 KB |
testcase_12 | AC | 47 ms
47,940 KB |
testcase_13 | AC | 47 ms
49,648 KB |
testcase_14 | AC | 187 ms
56,572 KB |
testcase_15 | AC | 163 ms
56,948 KB |
testcase_16 | AC | 109 ms
53,492 KB |
testcase_17 | AC | 497 ms
66,540 KB |
testcase_18 | AC | 117 ms
53,600 KB |
testcase_19 | AC | 114 ms
53,732 KB |
testcase_20 | AC | 181 ms
57,216 KB |
testcase_21 | AC | 281 ms
60,396 KB |
testcase_22 | AC | 214 ms
59,912 KB |
testcase_23 | AC | 235 ms
59,932 KB |
testcase_24 | AC | 709 ms
78,988 KB |
testcase_25 | AC | 647 ms
80,320 KB |
testcase_26 | AC | 645 ms
80,276 KB |
testcase_27 | AC | 618 ms
80,192 KB |
testcase_28 | AC | 686 ms
80,556 KB |
testcase_29 | AC | 635 ms
79,964 KB |
testcase_30 | AC | 630 ms
79,992 KB |
testcase_31 | AC | 629 ms
80,188 KB |
testcase_32 | AC | 650 ms
80,260 KB |
testcase_33 | AC | 612 ms
78,392 KB |
testcase_34 | AC | 47 ms
49,784 KB |
testcase_35 | AC | 45 ms
49,756 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(); Point[] points = new Point[n]; ArrayList<Distance> distances = new ArrayList<>(); for (int i = 0; i < n; i++) { points[i] = new Point(sc.nextInt(), sc.nextInt()); for (int j = 0; j < i; j++) { distances.add(new Distance(j, i, points[i].getDistance(points[j]))); } } Collections.sort(distances); int ans = 0; boolean[] used = new boolean[n]; for (Distance x : distances) { if (x.left == 0) { if (!used[x.right]) { used[x.right] = true; ans++; } } else { if (!used[x.left] && !used[x.right]) { used[x.left] = true; used[x.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 Point { long x; long y; public Point(long x, long y) { this.x = x; this.y = y; } public long getDistance(Point p) { return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.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(); } }