結果
問題 | No.2519 Coins in Array |
ユーザー | ks2m |
提出日時 | 2023-10-27 23:19:11 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,761 bytes |
コンパイル時間 | 3,121 ms |
コンパイル使用メモリ | 86,176 KB |
実行使用メモリ | 75,268 KB |
最終ジャッジ日時 | 2023-10-27 23:19:25 |
合計ジャッジ時間 | 11,861 ms |
ジャッジサーバーID (参考情報) |
judge10 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
53,416 KB |
testcase_01 | AC | 47 ms
53,404 KB |
testcase_02 | AC | 45 ms
53,488 KB |
testcase_03 | AC | 74 ms
54,460 KB |
testcase_04 | WA | - |
testcase_05 | AC | 83 ms
54,460 KB |
testcase_06 | AC | 46 ms
53,392 KB |
testcase_07 | AC | 88 ms
54,388 KB |
testcase_08 | AC | 46 ms
53,396 KB |
testcase_09 | AC | 73 ms
54,468 KB |
testcase_10 | AC | 72 ms
54,472 KB |
testcase_11 | AC | 46 ms
53,396 KB |
testcase_12 | AC | 46 ms
53,404 KB |
testcase_13 | AC | 46 ms
53,400 KB |
testcase_14 | AC | 47 ms
53,392 KB |
testcase_15 | AC | 47 ms
53,496 KB |
testcase_16 | AC | 45 ms
53,396 KB |
testcase_17 | AC | 45 ms
53,400 KB |
testcase_18 | AC | 44 ms
53,392 KB |
testcase_19 | AC | 45 ms
53,500 KB |
testcase_20 | AC | 44 ms
53,496 KB |
testcase_21 | AC | 45 ms
53,500 KB |
testcase_22 | AC | 45 ms
51,352 KB |
testcase_23 | AC | 404 ms
74,764 KB |
testcase_24 | AC | 378 ms
74,244 KB |
testcase_25 | AC | 46 ms
53,492 KB |
testcase_26 | AC | 46 ms
53,496 KB |
testcase_27 | AC | 419 ms
75,268 KB |
testcase_28 | AC | 374 ms
74,660 KB |
testcase_29 | AC | 415 ms
74,584 KB |
testcase_30 | AC | 374 ms
68,948 KB |
testcase_31 | AC | 160 ms
58,128 KB |
testcase_32 | AC | 260 ms
63,948 KB |
testcase_33 | AC | 349 ms
66,244 KB |
testcase_34 | AC | 218 ms
61,340 KB |
testcase_35 | AC | 274 ms
65,344 KB |
testcase_36 | AC | 198 ms
62,288 KB |
testcase_37 | AC | 170 ms
58,096 KB |
testcase_38 | AC | 268 ms
63,764 KB |
testcase_39 | AC | 209 ms
61,240 KB |
testcase_40 | AC | 319 ms
69,120 KB |
ソースコード
import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.HashMap; import java.util.Map; import java.util.PriorityQueue; public class Main { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int n = Integer.parseInt(br.readLine()); String[] sa = br.readLine().split(" "); long[] a = new long[n]; for (int i = 0; i < n; i++) { a[i] = Integer.parseInt(sa[i]); } br.close(); if (n >= 4) { PrintWriter pw = new PrintWriter(System.out); pw.println(0); for (int i = 0; i < n - 1; i++) { pw.println("1 2"); } pw.flush(); } else if (n == 2) { Map<Long, Integer> map0 = bunkai(a[0]); Map<Long, Integer> map1 = bunkai(a[1]); long m = (a[0] - 1) * (a[1] - 1); for (Long k : map0.keySet()) { if (map1.containsKey(k)) { m = 0; break; } } System.out.println(m); System.out.println("1 2"); } else { Map<Long, Integer> map0 = bunkai(a[0]); Map<Long, Integer> map1 = bunkai(a[1]); Map<Long, Integer> map2 = bunkai(a[2]); Map<Long, Integer> map01 = bunkai((a[0] - 1) * (a[1] - 1)); Map<Long, Integer> map12 = bunkai((a[1] - 1) * (a[2] - 1)); Map<Long, Integer> map20 = bunkai((a[2] - 1) * (a[0] - 1)); for (Long k : map0.keySet()) { if (map12.containsKey(k)) { System.out.println(0); System.out.println("2 3"); System.out.println("1 2"); return; } } for (Long k : map1.keySet()) { if (map20.containsKey(k)) { System.out.println(0); System.out.println("1 3"); System.out.println("1 2"); return; } } for (Long k : map2.keySet()) { if (map01.containsKey(k)) { System.out.println(0); System.out.println("1 2"); System.out.println("1 2"); return; } } PriorityQueue<Obj> que = new PriorityQueue<>((o1, o2) -> o1.a - o2.a); for (int i = 0; i < n; i++) { Obj o = new Obj(); o.i = i; o.a = (int) a[i]; que.add(o); } Obj f = que.poll(); long m = f.a; Obj o1 = que.poll(); Obj o2 = que.poll(); if (m != 0) { m = (m - 1) * (o1.a - 1); } if (m != 0) { m = (m - 1) * (o2.a - 1); } System.out.println(m); System.out.println((f.i + 1) + " " + (o1.i + 1)); System.out.println("1 2"); } } static class Obj { int i, a; } static Map<Long, Integer> bunkai(long n) { Map<Long, Integer> soinsu = new HashMap<>(); int end = (int) Math.sqrt(n); long d = 2; while (n > 1) { if (n % d == 0) { n /= d; soinsu.put(d, soinsu.getOrDefault(d, 0) + 1); end = (int) Math.sqrt(n); } else { if (d > end) { d = n - 1; } d++; } } return soinsu; } }