結果

問題 No.854 公平なりんご分配
ユーザー htensaihtensai
提出日時 2020-01-28 10:07:41
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,547 bytes
コンパイル時間 2,938 ms
コンパイル使用メモリ 73,924 KB
実行使用メモリ 261,288 KB
最終ジャッジ日時 2023-10-13 09:44:24
合計ジャッジ時間 63,252 ms
ジャッジサーバーID
(参考情報)
judge12 / judge15
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 122 ms
55,972 KB
testcase_01 AC 122 ms
55,752 KB
testcase_02 AC 123 ms
55,684 KB
testcase_03 AC 124 ms
55,520 KB
testcase_04 AC 121 ms
55,888 KB
testcase_05 AC 120 ms
56,404 KB
testcase_06 AC 120 ms
55,752 KB
testcase_07 AC 122 ms
55,960 KB
testcase_08 AC 122 ms
55,648 KB
testcase_09 AC 123 ms
55,560 KB
testcase_10 AC 122 ms
56,008 KB
testcase_11 AC 125 ms
55,852 KB
testcase_12 AC 132 ms
55,860 KB
testcase_13 AC 131 ms
57,692 KB
testcase_14 AC 122 ms
56,168 KB
testcase_15 AC 126 ms
56,016 KB
testcase_16 AC 135 ms
55,908 KB
testcase_17 AC 133 ms
55,760 KB
testcase_18 AC 130 ms
56,172 KB
testcase_19 AC 130 ms
55,800 KB
testcase_20 AC 130 ms
55,996 KB
testcase_21 AC 130 ms
55,948 KB
testcase_22 AC 206 ms
62,084 KB
testcase_23 AC 204 ms
59,496 KB
testcase_24 AC 225 ms
60,268 KB
testcase_25 AC 200 ms
59,236 KB
testcase_26 AC 217 ms
59,684 KB
testcase_27 AC 210 ms
62,180 KB
testcase_28 AC 218 ms
60,080 KB
testcase_29 AC 187 ms
58,336 KB
testcase_30 AC 198 ms
59,408 KB
testcase_31 AC 223 ms
60,320 KB
testcase_32 AC 446 ms
97,520 KB
testcase_33 AC 561 ms
86,388 KB
testcase_34 AC 1,032 ms
133,836 KB
testcase_35 AC 640 ms
102,760 KB
testcase_36 AC 540 ms
69,132 KB
testcase_37 AC 462 ms
99,076 KB
testcase_38 AC 380 ms
86,048 KB
testcase_39 AC 936 ms
131,768 KB
testcase_40 AC 618 ms
85,884 KB
testcase_41 AC 621 ms
104,448 KB
testcase_42 AC 696 ms
121,668 KB
testcase_43 AC 812 ms
106,720 KB
testcase_44 AC 837 ms
114,908 KB
testcase_45 AC 927 ms
81,912 KB
testcase_46 AC 944 ms
114,892 KB
testcase_47 AC 511 ms
87,340 KB
testcase_48 AC 645 ms
113,216 KB
testcase_49 AC 602 ms
111,896 KB
testcase_50 AC 428 ms
97,828 KB
testcase_51 AC 930 ms
122,264 KB
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 WA -
testcase_62 WA -
testcase_63 WA -
testcase_64 WA -
testcase_65 WA -
testcase_66 WA -
testcase_67 WA -
testcase_68 WA -
testcase_69 WA -
testcase_70 WA -
testcase_71 WA -
testcase_72 WA -
testcase_73 WA -
testcase_74 WA -
testcase_75 WA -
testcase_76 WA -
testcase_77 WA -
testcase_78 WA -
testcase_79 WA -
testcase_80 WA -
testcase_81 WA -
testcase_82 WA -
testcase_83 AC 1,667 ms
256,204 KB
testcase_84 AC 1,877 ms
260,156 KB
testcase_85 AC 1,694 ms
261,288 KB
testcase_86 WA -
testcase_87 WA -
testcase_88 WA -
testcase_89 WA -
testcase_90 WA -
testcase_91 WA -
testcase_92 AC 1,752 ms
261,212 KB
testcase_93 AC 1,792 ms
261,052 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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");
                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);
   }
}
0