結果
問題 | No.854 公平なりんご分配 |
ユーザー | dn6049949 |
提出日時 | 2019-07-26 23:31:30 |
言語 | PyPy3 (7.3.15) |
結果 |
MLE
|
実行時間 | - |
コード長 | 3,145 bytes |
コンパイル時間 | 445 ms |
コンパイル使用メモリ | 87,068 KB |
実行使用メモリ | 335,696 KB |
最終ジャッジ日時 | 2023-09-15 05:02:25 |
合計ジャッジ時間 | 36,046 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 142 ms
77,980 KB |
testcase_01 | AC | 143 ms
77,784 KB |
testcase_02 | AC | 145 ms
78,152 KB |
testcase_03 | AC | 145 ms
77,996 KB |
testcase_04 | AC | 141 ms
77,920 KB |
testcase_05 | AC | 145 ms
77,824 KB |
testcase_06 | AC | 141 ms
78,092 KB |
testcase_07 | AC | 143 ms
77,968 KB |
testcase_08 | AC | 143 ms
77,792 KB |
testcase_09 | AC | 146 ms
77,776 KB |
testcase_10 | AC | 147 ms
77,988 KB |
testcase_11 | AC | 143 ms
77,972 KB |
testcase_12 | AC | 148 ms
77,968 KB |
testcase_13 | AC | 144 ms
77,800 KB |
testcase_14 | AC | 145 ms
77,804 KB |
testcase_15 | AC | 142 ms
77,716 KB |
testcase_16 | AC | 144 ms
77,872 KB |
testcase_17 | AC | 145 ms
78,040 KB |
testcase_18 | AC | 146 ms
77,916 KB |
testcase_19 | AC | 142 ms
77,584 KB |
testcase_20 | AC | 144 ms
77,796 KB |
testcase_21 | AC | 143 ms
77,792 KB |
testcase_22 | AC | 178 ms
78,784 KB |
testcase_23 | AC | 169 ms
78,956 KB |
testcase_24 | AC | 205 ms
82,040 KB |
testcase_25 | AC | 165 ms
79,036 KB |
testcase_26 | AC | 207 ms
82,224 KB |
testcase_27 | AC | 176 ms
78,836 KB |
testcase_28 | AC | 174 ms
78,844 KB |
testcase_29 | AC | 159 ms
78,292 KB |
testcase_30 | AC | 165 ms
78,972 KB |
testcase_31 | AC | 206 ms
82,328 KB |
testcase_32 | AC | 341 ms
132,916 KB |
testcase_33 | AC | 357 ms
110,596 KB |
testcase_34 | AC | 443 ms
154,752 KB |
testcase_35 | AC | 386 ms
138,440 KB |
testcase_36 | AC | 324 ms
86,148 KB |
testcase_37 | AC | 334 ms
129,588 KB |
testcase_38 | AC | 300 ms
121,000 KB |
testcase_39 | AC | 468 ms
161,560 KB |
testcase_40 | AC | 358 ms
107,236 KB |
testcase_41 | AC | 382 ms
127,812 KB |
testcase_42 | AC | 430 ms
152,968 KB |
testcase_43 | AC | 423 ms
131,592 KB |
testcase_44 | AC | 453 ms
150,040 KB |
testcase_45 | AC | 386 ms
97,348 KB |
testcase_46 | AC | 473 ms
149,572 KB |
testcase_47 | AC | 359 ms
118,540 KB |
testcase_48 | AC | 407 ms
152,160 KB |
testcase_49 | AC | 394 ms
153,048 KB |
testcase_50 | AC | 326 ms
129,376 KB |
testcase_51 | AC | 469 ms
153,048 KB |
testcase_52 | AC | 370 ms
113,196 KB |
testcase_53 | AC | 331 ms
109,720 KB |
testcase_54 | AC | 394 ms
119,316 KB |
testcase_55 | AC | 300 ms
110,044 KB |
testcase_56 | AC | 287 ms
111,348 KB |
testcase_57 | AC | 343 ms
107,092 KB |
testcase_58 | AC | 406 ms
95,248 KB |
testcase_59 | AC | 294 ms
102,316 KB |
testcase_60 | AC | 363 ms
107,056 KB |
testcase_61 | AC | 292 ms
85,620 KB |
testcase_62 | AC | 356 ms
103,916 KB |
testcase_63 | AC | 326 ms
103,528 KB |
testcase_64 | AC | 283 ms
89,504 KB |
testcase_65 | AC | 375 ms
143,492 KB |
testcase_66 | AC | 309 ms
97,568 KB |
testcase_67 | AC | 353 ms
121,724 KB |
testcase_68 | AC | 339 ms
99,344 KB |
testcase_69 | AC | 320 ms
156,564 KB |
testcase_70 | AC | 288 ms
104,632 KB |
testcase_71 | AC | 292 ms
106,668 KB |
testcase_72 | AC | 374 ms
87,572 KB |
testcase_73 | AC | 324 ms
130,712 KB |
testcase_74 | AC | 402 ms
143,664 KB |
testcase_75 | AC | 338 ms
107,996 KB |
testcase_76 | AC | 360 ms
128,172 KB |
testcase_77 | AC | 393 ms
150,064 KB |
testcase_78 | AC | 356 ms
102,352 KB |
testcase_79 | AC | 382 ms
123,320 KB |
testcase_80 | AC | 373 ms
124,952 KB |
testcase_81 | AC | 351 ms
126,576 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 | MLE | - |
testcase_93 | MLE | - |
ソースコード
#!usr/bin/env python3 from collections import defaultdict,deque from heapq import heappush, heappop import sys import math import bisect import random def LI(): return [int(x) for x in sys.stdin.readline().split()] def I(): return int(sys.stdin.readline()) def LS():return [list(x) for x in sys.stdin.readline().split()] def S(): return list(sys.stdin.readline())[:-1] def IR(n): return [I() for i in range(n)] def LIR(n): return [LI() for i in range(n)] def SR(n): return [S() for i in range(n)] def LSR(n): return [LS() for i in range(n)] sys.setrecursionlimit(1000000) mod = 1000000007 #A def A(): try: n = I() a = IR(n) l = [] for i in range(n): for j in range(i): l.append(a[i]+a[j]) l = list(set(l)) l.sort() l = l[::-1] print(l[1]) except: print('"assert"') return #B def B(): n = I() return #C def C(): def su(n): return n*(n+1)//2 h,w = LI() w = abs(w) if w == 0: print(0) if h < w: ans = su(w)-su(w-h) else: ans = h-w+su(w) print(ans) return #D def D(): mem = defaultdict(lambda : None) def factor(n): if mem[n] != None: return mem[n] if n < 4: mem[n] = [n] return [n] res = [] i = 2 m = n while i ** 2 <= n: if n%i == 0: while n%i == 0: n //= i res.append(i) i += 1 if i == 2000: mem[m] = [] return [] if n != 1: res.append(n) mem[m] = res return res n = I() a = LI() li = [i for i in range(2,2000)] for d in li: li = [x for x in li if(x == d or x%d != 0)] li.insert(0,0) m = len(li) ind = [0]*2000 for i in range(m): ind[li[i]] = i f = [[0]*m for i in range(n+1)] for i in range(n): for j in range(m): f[i+1][j] += f[i][j] if a[i] == 1: continue res = factor(a[i]) for j in res: f[i+1][ind[j]] += 1 q = I() for i in range(q): p,l,r = LI() if p == 1: print("Yes") else: if f[r][0]-f[l-1][0]: print("Yes") else: res = factor(p) if res == []: print("NO") else: d = defaultdict(lambda : 0) for j in res: if j > 1999: print("NO") break d[ind[j]] += 1 else: for k,x in d.items(): if f[r][k]-f[l-1][k] < x: print("NO") break else: print("Yes") return #E def E(): n = I() return #F def F(): n = I() return #Solve if __name__ == "__main__": D()