結果
問題 | No.854 公平なりんご分配 |
ユーザー | qib |
提出日時 | 2022-12-29 20:23:12 |
言語 | PyPy3 (7.3.15) |
結果 |
MLE
|
実行時間 | - |
コード長 | 1,363 bytes |
コンパイル時間 | 958 ms |
コンパイル使用メモリ | 86,976 KB |
実行使用メモリ | 322,608 KB |
最終ジャッジ日時 | 2023-08-16 08:28:00 |
合計ジャッジ時間 | 48,294 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 83 ms
76,788 KB |
testcase_01 | AC | 87 ms
76,460 KB |
testcase_02 | AC | 84 ms
76,624 KB |
testcase_03 | AC | 88 ms
76,780 KB |
testcase_04 | AC | 85 ms
76,604 KB |
testcase_05 | AC | 90 ms
76,892 KB |
testcase_06 | AC | 94 ms
76,444 KB |
testcase_07 | AC | 89 ms
77,004 KB |
testcase_08 | AC | 87 ms
76,792 KB |
testcase_09 | AC | 86 ms
76,764 KB |
testcase_10 | AC | 87 ms
76,776 KB |
testcase_11 | AC | 87 ms
76,896 KB |
testcase_12 | AC | 85 ms
76,892 KB |
testcase_13 | AC | 86 ms
76,816 KB |
testcase_14 | AC | 85 ms
76,924 KB |
testcase_15 | AC | 88 ms
76,804 KB |
testcase_16 | AC | 87 ms
76,752 KB |
testcase_17 | AC | 88 ms
76,812 KB |
testcase_18 | AC | 85 ms
76,604 KB |
testcase_19 | AC | 87 ms
76,808 KB |
testcase_20 | AC | 88 ms
76,896 KB |
testcase_21 | AC | 86 ms
76,820 KB |
testcase_22 | AC | 156 ms
79,980 KB |
testcase_23 | AC | 118 ms
79,544 KB |
testcase_24 | AC | 154 ms
80,936 KB |
testcase_25 | AC | 119 ms
80,020 KB |
testcase_26 | AC | 160 ms
81,436 KB |
testcase_27 | AC | 121 ms
80,532 KB |
testcase_28 | AC | 152 ms
79,480 KB |
testcase_29 | AC | 104 ms
76,796 KB |
testcase_30 | AC | 131 ms
79,204 KB |
testcase_31 | AC | 150 ms
80,492 KB |
testcase_32 | AC | 316 ms
130,676 KB |
testcase_33 | AC | 429 ms
106,832 KB |
testcase_34 | AC | 619 ms
150,692 KB |
testcase_35 | AC | 523 ms
134,556 KB |
testcase_36 | AC | 490 ms
83,576 KB |
testcase_37 | AC | 320 ms
127,296 KB |
testcase_38 | AC | 280 ms
118,660 KB |
testcase_39 | AC | 966 ms
155,172 KB |
testcase_40 | AC | 495 ms
102,444 KB |
testcase_41 | AC | 494 ms
123,604 KB |
testcase_42 | AC | 541 ms
149,240 KB |
testcase_43 | AC | 872 ms
126,048 KB |
testcase_44 | AC | 718 ms
143,584 KB |
testcase_45 | AC | 833 ms
92,264 KB |
testcase_46 | AC | 934 ms
142,940 KB |
testcase_47 | AC | 516 ms
114,636 KB |
testcase_48 | AC | 459 ms
147,720 KB |
testcase_49 | AC | 438 ms
149,672 KB |
testcase_50 | AC | 298 ms
126,668 KB |
testcase_51 | AC | 1,085 ms
146,052 KB |
testcase_52 | AC | 729 ms
109,864 KB |
testcase_53 | AC | 316 ms
107,940 KB |
testcase_54 | AC | 527 ms
114,700 KB |
testcase_55 | AC | 268 ms
107,392 KB |
testcase_56 | AC | 257 ms
109,712 KB |
testcase_57 | AC | 437 ms
104,160 KB |
testcase_58 | AC | 785 ms
89,724 KB |
testcase_59 | AC | 255 ms
100,620 KB |
testcase_60 | AC | 422 ms
103,780 KB |
testcase_61 | AC | 322 ms
83,964 KB |
testcase_62 | AC | 549 ms
100,892 KB |
testcase_63 | AC | 345 ms
100,944 KB |
testcase_64 | AC | 265 ms
87,672 KB |
testcase_65 | AC | 372 ms
140,872 KB |
testcase_66 | AC | 457 ms
95,384 KB |
testcase_67 | AC | 446 ms
118,304 KB |
testcase_68 | AC | 501 ms
96,560 KB |
testcase_69 | AC | 285 ms
154,724 KB |
testcase_70 | AC | 256 ms
102,656 KB |
testcase_71 | AC | 262 ms
104,504 KB |
testcase_72 | AC | 789 ms
84,508 KB |
testcase_73 | AC | 282 ms
128,108 KB |
testcase_74 | AC | 485 ms
139,308 KB |
testcase_75 | AC | 382 ms
105,340 KB |
testcase_76 | AC | 399 ms
126,800 KB |
testcase_77 | AC | 441 ms
148,084 KB |
testcase_78 | AC | 708 ms
98,948 KB |
testcase_79 | AC | 525 ms
119,444 KB |
testcase_80 | AC | 574 ms
121,916 KB |
testcase_81 | AC | 356 ms
123,584 KB |
testcase_82 | MLE | - |
testcase_83 | MLE | - |
testcase_84 | MLE | - |
testcase_85 | MLE | - |
testcase_86 | MLE | - |
testcase_87 | MLE | - |
testcase_88 | MLE | - |
testcase_89 | MLE | - |
testcase_90 | MLE | - |
testcase_91 | MLE | - |
testcase_92 | TLE | - |
testcase_93 | MLE | - |
ソースコード
import math n = int(input()) a = list(map(int, input().split())) m = 2000 k = int(math.sqrt(10 ** 9)) dp = [None for _ in range(k + 1)] idx = {} for x in range(2, k + 1): if not dp[x] is None: continue dp[x] = x if x <= m: idx[x] = len(idx) for y in range(2 * x, k + 1, x): if not dp[y] is None: continue dp[y] = x s = [[0 for _ in range(n + 1)] for _ in range(len(idx))] for i in range(n): cur = a[i] while cur > 1: s[idx[dp[cur]]][i + 1] += 1 cur //= dp[cur] zero = [0 for _ in range(n + 1)] for i in range(n): zero[i + 1] = zero[i] if a[i] == 0: zero[i + 1] += 1 for i in range(len(idx)): for j in range(1, n + 1): s[i][j] += s[i][j - 1] q = int(input()) ans = [None for _ in range(q)] for i in range(q): p, l, r = map(int, input().split()) l -= 1 r -= 1 if p == 1 or zero[r + 1] - zero[l] > 0: ans[i] = "Yes" continue cnt = {} cur = p flg = True for x in range(2, k + 1): if cur == 1: break if dp[x] != x or cur % x != 0: continue if x > m: flg = False break y = idx[x] cnt[y] = 0 while cur % x == 0: cnt[y] += 1 cur //= x if not flg or cur > 1: ans[i] = "NO" continue if any(s[x][r + 1] - s[x][l] < v for x, v in cnt.items()): ans[i] = "NO" else: ans[i] = "Yes" print(*ans, sep="\n")