結果
問題 | No.854 公平なりんご分配 |
ユーザー | tktk_snsn |
提出日時 | 2020-12-21 14:49:48 |
言語 | PyPy3 (7.3.15) |
結果 |
MLE
|
実行時間 | - |
コード長 | 3,204 bytes |
コンパイル時間 | 189 ms |
コンパイル使用メモリ | 81,584 KB |
実行使用メモリ | 900,032 KB |
最終ジャッジ日時 | 2023-10-21 11:42:14 |
合計ジャッジ時間 | 11,784 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | MLE | - |
testcase_01 | AC | 52 ms
64,096 KB |
testcase_02 | WA | - |
testcase_03 | AC | 65 ms
70,544 KB |
testcase_04 | AC | 47 ms
61,992 KB |
testcase_05 | AC | 55 ms
66,356 KB |
testcase_06 | AC | 50 ms
64,080 KB |
testcase_07 | AC | 54 ms
66,344 KB |
testcase_08 | AC | 56 ms
66,356 KB |
testcase_09 | AC | 55 ms
66,344 KB |
testcase_10 | AC | 59 ms
68,240 KB |
testcase_11 | AC | 56 ms
66,356 KB |
testcase_12 | AC | 78 ms
78,364 KB |
testcase_13 | AC | 79 ms
78,292 KB |
testcase_14 | AC | 51 ms
64,204 KB |
testcase_15 | AC | 64 ms
70,808 KB |
testcase_16 | AC | 79 ms
78,368 KB |
testcase_17 | AC | 80 ms
78,896 KB |
testcase_18 | AC | 67 ms
74,272 KB |
testcase_19 | AC | 76 ms
78,204 KB |
testcase_20 | AC | 63 ms
72,832 KB |
testcase_21 | AC | 75 ms
78,204 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 170 ms
99,956 KB |
testcase_26 | WA | - |
testcase_27 | AC | 296 ms
133,044 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 178 ms
95,288 KB |
testcase_31 | WA | - |
testcase_32 | MLE | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
testcase_49 | -- | - |
testcase_50 | -- | - |
testcase_51 | -- | - |
testcase_52 | -- | - |
testcase_53 | -- | - |
testcase_54 | -- | - |
testcase_55 | -- | - |
testcase_56 | -- | - |
testcase_57 | -- | - |
testcase_58 | -- | - |
testcase_59 | -- | - |
testcase_60 | -- | - |
testcase_61 | -- | - |
testcase_62 | -- | - |
testcase_63 | -- | - |
testcase_64 | -- | - |
testcase_65 | -- | - |
testcase_66 | -- | - |
testcase_67 | -- | - |
testcase_68 | -- | - |
testcase_69 | -- | - |
testcase_70 | -- | - |
testcase_71 | -- | - |
testcase_72 | -- | - |
testcase_73 | -- | - |
testcase_74 | -- | - |
testcase_75 | -- | - |
testcase_76 | -- | - |
testcase_77 | -- | - |
testcase_78 | -- | - |
testcase_79 | -- | - |
testcase_80 | -- | - |
testcase_81 | -- | - |
testcase_82 | -- | - |
testcase_83 | -- | - |
testcase_84 | -- | - |
testcase_85 | -- | - |
testcase_86 | -- | - |
testcase_87 | -- | - |
testcase_88 | -- | - |
testcase_89 | -- | - |
testcase_90 | -- | - |
testcase_91 | -- | - |
testcase_92 | -- | - |
testcase_93 | -- | - |
ソースコード
from operator import add import sys input = sys.stdin.buffer.readline class SparseTable: def __init__(self, N, arr, op): self.N = N self.depth = N.bit_length() self.op = op self.arr = tuple(arr) self._build() def __call__(self, s, t): """ op(A[s], A[s+1], ..., A[t-1])を返す 0-indexed """ i = (t - s).bit_length() - 1 L = self.table[i][s] R = self.table[i][t - (1 << i)] return self.op(L, R) def _build(self): self.table = [] self.table.append(self.arr) N = self.N for i in range(self.depth - 1): shift = 1 << i N -= shift t = tuple(self.op(self.table[-1][j], self.table[-1][j + shift]) for j in range(N)) self.table.append(t) pf = [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] N = int(input()) A = list(map(int, input().split())) # pre computing zero = SparseTable(N, [int(x == 0) for x in A], add) spt = dict() for p in pf: cnt = [0] * N for i, a in enumerate(A): while a % p == 0: a //= p cnt[i] += 1 spt[p] = SparseTable(N, cnt, add) #query Q = int(input()) for _ in range(Q): x, s, t = map(int, input().split()) s -= 1 if x == 1: #一人にぜんぶあげる print("Yes") continue elif zero(s, t): #全員ゼロ print("Yes") continue for p in pf: cnt = spt[p](s, t) while cnt and x % p == 0: x //= p cnt -= 1 if x == 1: print("Yes") else: print("NO")