結果
問題 | No.854 公平なりんご分配 |
ユーザー | htensai |
提出日時 | 2020-01-28 10:11:31 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,718 ms / 3,153 ms |
コード長 | 3,560 bytes |
コンパイル時間 | 2,117 ms |
コンパイル使用メモリ | 74,732 KB |
実行使用メモリ | 263,656 KB |
最終ジャッジ日時 | 2023-10-13 09:50:01 |
合計ジャッジ時間 | 61,064 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 120 ms
53,496 KB |
testcase_01 | AC | 122 ms
56,304 KB |
testcase_02 | AC | 126 ms
56,156 KB |
testcase_03 | AC | 127 ms
56,276 KB |
testcase_04 | AC | 125 ms
55,956 KB |
testcase_05 | AC | 122 ms
55,940 KB |
testcase_06 | AC | 122 ms
55,796 KB |
testcase_07 | AC | 123 ms
55,920 KB |
testcase_08 | AC | 126 ms
55,848 KB |
testcase_09 | AC | 126 ms
55,868 KB |
testcase_10 | AC | 125 ms
56,040 KB |
testcase_11 | AC | 122 ms
56,376 KB |
testcase_12 | AC | 131 ms
56,044 KB |
testcase_13 | AC | 131 ms
55,880 KB |
testcase_14 | AC | 127 ms
55,856 KB |
testcase_15 | AC | 128 ms
55,852 KB |
testcase_16 | AC | 135 ms
55,572 KB |
testcase_17 | AC | 140 ms
55,688 KB |
testcase_18 | AC | 130 ms
56,216 KB |
testcase_19 | AC | 132 ms
55,608 KB |
testcase_20 | AC | 130 ms
55,928 KB |
testcase_21 | AC | 132 ms
55,780 KB |
testcase_22 | AC | 211 ms
59,928 KB |
testcase_23 | AC | 210 ms
59,572 KB |
testcase_24 | AC | 222 ms
59,876 KB |
testcase_25 | AC | 199 ms
59,136 KB |
testcase_26 | AC | 222 ms
59,992 KB |
testcase_27 | AC | 211 ms
59,340 KB |
testcase_28 | AC | 218 ms
60,100 KB |
testcase_29 | AC | 188 ms
58,460 KB |
testcase_30 | AC | 201 ms
59,536 KB |
testcase_31 | AC | 225 ms
60,128 KB |
testcase_32 | AC | 453 ms
98,352 KB |
testcase_33 | AC | 550 ms
86,460 KB |
testcase_34 | AC | 745 ms
129,728 KB |
testcase_35 | AC | 608 ms
105,304 KB |
testcase_36 | AC | 540 ms
69,020 KB |
testcase_37 | AC | 462 ms
99,100 KB |
testcase_38 | AC | 389 ms
85,164 KB |
testcase_39 | AC | 1,004 ms
131,728 KB |
testcase_40 | AC | 620 ms
86,624 KB |
testcase_41 | AC | 632 ms
104,840 KB |
testcase_42 | AC | 714 ms
122,020 KB |
testcase_43 | AC | 904 ms
109,104 KB |
testcase_44 | AC | 827 ms
115,080 KB |
testcase_45 | AC | 952 ms
81,988 KB |
testcase_46 | AC | 1,001 ms
115,004 KB |
testcase_47 | AC | 526 ms
87,808 KB |
testcase_48 | AC | 638 ms
113,652 KB |
testcase_49 | AC | 609 ms
111,944 KB |
testcase_50 | AC | 430 ms
99,224 KB |
testcase_51 | AC | 933 ms
125,664 KB |
testcase_52 | AC | 835 ms
92,440 KB |
testcase_53 | AC | 553 ms
85,812 KB |
testcase_54 | AC | 823 ms
95,972 KB |
testcase_55 | AC | 425 ms
81,816 KB |
testcase_56 | AC | 393 ms
80,352 KB |
testcase_57 | AC | 513 ms
83,856 KB |
testcase_58 | AC | 788 ms
75,020 KB |
testcase_59 | AC | 368 ms
75,996 KB |
testcase_60 | AC | 649 ms
86,300 KB |
testcase_61 | AC | 437 ms
65,004 KB |
testcase_62 | AC | 714 ms
85,272 KB |
testcase_63 | AC | 610 ms
86,612 KB |
testcase_64 | AC | 354 ms
66,356 KB |
testcase_65 | AC | 549 ms
104,232 KB |
testcase_66 | AC | 496 ms
73,000 KB |
testcase_67 | AC | 701 ms
101,976 KB |
testcase_68 | AC | 736 ms
82,000 KB |
testcase_69 | AC | 475 ms
108,488 KB |
testcase_70 | AC | 376 ms
80,352 KB |
testcase_71 | AC | 431 ms
80,828 KB |
testcase_72 | AC | 609 ms
64,376 KB |
testcase_73 | AC | 484 ms
98,032 KB |
testcase_74 | AC | 826 ms
112,812 KB |
testcase_75 | AC | 578 ms
85,188 KB |
testcase_76 | AC | 725 ms
106,032 KB |
testcase_77 | AC | 728 ms
123,388 KB |
testcase_78 | AC | 862 ms
84,564 KB |
testcase_79 | AC | 808 ms
106,180 KB |
testcase_80 | AC | 778 ms
106,200 KB |
testcase_81 | AC | 636 ms
105,000 KB |
testcase_82 | AC | 1,194 ms
254,092 KB |
testcase_83 | AC | 1,536 ms
262,368 KB |
testcase_84 | AC | 1,664 ms
261,988 KB |
testcase_85 | AC | 1,611 ms
263,656 KB |
testcase_86 | AC | 1,090 ms
254,656 KB |
testcase_87 | AC | 1,175 ms
253,436 KB |
testcase_88 | AC | 1,235 ms
253,428 KB |
testcase_89 | AC | 1,199 ms
254,556 KB |
testcase_90 | AC | 1,219 ms
251,444 KB |
testcase_91 | AC | 1,221 ms
254,900 KB |
testcase_92 | AC | 1,667 ms
262,808 KB |
testcase_93 | AC | 1,718 ms
262,764 KB |
ソースコード
import java.util.*; public class Main { public static void main(String[] args) { int[] primes = new int[]{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999}; int length = primes.length; Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[][] sums = new int[n + 1][]; int[] zeros = new int[n + 1]; sums[0] = new int[length]; for (int i = 1; i <= n; i++) { sums[i] = (int[])(sums[i - 1].clone()); zeros[i] += zeros[i - 1]; int x = sc.nextInt(); if (x == 0) { zeros[i]++; } for (int j = 0; j < length && x > 1; j++) { while (x % primes[j] == 0) { sums[i][j]++; x /= primes[j]; } } } int q = sc.nextInt(); StringBuilder sb = new StringBuilder(); for (int i = 0; i < q; i++) { int p = sc.nextInt(); int left = sc.nextInt(); int right = sc.nextInt(); if (zeros[left - 1] != zeros[right]) { sb.append("Yes").append("\n"); continue; } int[] target = (int[])(sums[right].clone()); for (int j = 0; j < length; j++) { target[j] -= sums[left - 1][j]; } boolean flag = true; for (int j = 0; j < length && p > 1 && flag; j++) { while (p % primes[j] == 0 && flag) { target[j]--; if (target[j] < 0) { flag = false; } p /= primes[j]; } } if (p > 1) { flag = false; } if (flag) { sb.append("Yes"); } else { sb.append("NO"); } sb.append("\n"); } System.out.print(sb); } }