結果
問題 | No.1265 Balloon Survival |
ユーザー | shojin_pro |
提出日時 | 2020-10-23 22:50:14 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 738 ms / 2,000 ms |
コード長 | 4,076 bytes |
コンパイル時間 | 4,601 ms |
コンパイル使用メモリ | 76,936 KB |
実行使用メモリ | 80,508 KB |
最終ジャッジ日時 | 2023-09-28 17:15:41 |
合計ジャッジ時間 | 16,385 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
49,680 KB |
testcase_01 | AC | 47 ms
49,660 KB |
testcase_02 | AC | 46 ms
49,956 KB |
testcase_03 | AC | 47 ms
49,640 KB |
testcase_04 | AC | 47 ms
49,608 KB |
testcase_05 | AC | 49 ms
49,744 KB |
testcase_06 | AC | 49 ms
49,644 KB |
testcase_07 | AC | 47 ms
49,628 KB |
testcase_08 | AC | 47 ms
49,748 KB |
testcase_09 | AC | 47 ms
49,688 KB |
testcase_10 | AC | 48 ms
49,872 KB |
testcase_11 | AC | 47 ms
49,688 KB |
testcase_12 | AC | 49 ms
49,664 KB |
testcase_13 | AC | 47 ms
49,800 KB |
testcase_14 | AC | 184 ms
57,384 KB |
testcase_15 | AC | 146 ms
57,304 KB |
testcase_16 | AC | 105 ms
53,972 KB |
testcase_17 | AC | 507 ms
65,836 KB |
testcase_18 | AC | 120 ms
54,056 KB |
testcase_19 | AC | 109 ms
53,620 KB |
testcase_20 | AC | 184 ms
57,256 KB |
testcase_21 | AC | 321 ms
60,168 KB |
testcase_22 | AC | 233 ms
59,808 KB |
testcase_23 | AC | 227 ms
59,916 KB |
testcase_24 | AC | 704 ms
80,476 KB |
testcase_25 | AC | 738 ms
80,352 KB |
testcase_26 | AC | 665 ms
80,164 KB |
testcase_27 | AC | 628 ms
80,508 KB |
testcase_28 | AC | 648 ms
80,388 KB |
testcase_29 | AC | 719 ms
80,384 KB |
testcase_30 | AC | 658 ms
79,884 KB |
testcase_31 | AC | 664 ms
80,096 KB |
testcase_32 | AC | 611 ms
80,424 KB |
testcase_33 | AC | 686 ms
80,448 KB |
testcase_34 | AC | 50 ms
49,632 KB |
testcase_35 | AC | 48 ms
49,832 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(System.in); PrintWriter pw = new PrintWriter(System.out); StringBuilder sb = new StringBuilder(); int n = sc.nextInt(); boolean[] bomb = new boolean[n]; Balloon[] bl = new Balloon[n]; for(int i = 0; i < n; i++){ int x = sc.nextInt(); int y = sc.nextInt(); bl[i] = new Balloon(x,y); } ArrayList<Dist> dl = new ArrayList<>(); for(int i = 0; i < n; i++){ for(int j = i+1; j < n; j++){ dl.add(new Dist(i,j,(long)(bl[i].x-bl[j].x)*(bl[i].x-bl[j].x) + (long)(bl[i].y-bl[j].y)*(bl[i].y-bl[j].y))); } } Collections.sort(dl); int ans = 0; for(Dist d : dl){ //pw.println(d.i + " " + d.j + " " + d.dist); if(d.i != 0 && d.j != 0){ if(!bomb[d.i] && !bomb[d.j]){ bomb[d.i] = true; bomb[d.j] = true; } }else if(d.i == 0){ if(!bomb[d.j]) ans++; bomb[d.j] = true; }else{ if(!bomb[d.i]) ans++; bomb[d.i] = true; } } pw.println(ans); pw.flush(); } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class Balloon{ int x,y; public Balloon(int x, int y){ this.x = x; this.y = y; } } class Dist implements Comparable<Dist>{ int i,j; long dist; public Dist(int i, int j, long dist){ this.i = i; this.j = j; this.dist = dist; } public int compareTo(Dist d){ if(this.dist < d.dist){ return -1; }else if(this.dist > d.dist){ return 1; }else{ return 0; } } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }