結果
問題 | No.854 公平なりんご分配 |
ユーザー | dn6049949 |
提出日時 | 2019-07-26 23:18:42 |
言語 | PyPy3 (7.3.15) |
結果 |
MLE
|
実行時間 | - |
コード長 | 2,967 bytes |
コンパイル時間 | 493 ms |
コンパイル使用メモリ | 87,032 KB |
実行使用メモリ | 332,668 KB |
最終ジャッジ日時 | 2023-09-15 04:33:34 |
合計ジャッジ時間 | 33,184 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 145 ms
77,772 KB |
testcase_01 | AC | 148 ms
77,768 KB |
testcase_02 | AC | 147 ms
77,648 KB |
testcase_03 | AC | 145 ms
77,840 KB |
testcase_04 | AC | 145 ms
77,656 KB |
testcase_05 | AC | 146 ms
78,060 KB |
testcase_06 | AC | 150 ms
77,764 KB |
testcase_07 | AC | 146 ms
77,852 KB |
testcase_08 | AC | 145 ms
78,200 KB |
testcase_09 | AC | 143 ms
77,896 KB |
testcase_10 | AC | 145 ms
77,620 KB |
testcase_11 | AC | 144 ms
77,820 KB |
testcase_12 | AC | 146 ms
77,900 KB |
testcase_13 | AC | 146 ms
78,004 KB |
testcase_14 | AC | 143 ms
77,664 KB |
testcase_15 | AC | 145 ms
77,676 KB |
testcase_16 | AC | 145 ms
77,732 KB |
testcase_17 | AC | 147 ms
77,896 KB |
testcase_18 | AC | 146 ms
77,764 KB |
testcase_19 | AC | 145 ms
78,044 KB |
testcase_20 | AC | 144 ms
77,548 KB |
testcase_21 | AC | 150 ms
77,840 KB |
testcase_22 | AC | 181 ms
78,792 KB |
testcase_23 | AC | 167 ms
78,232 KB |
testcase_24 | AC | 206 ms
81,660 KB |
testcase_25 | AC | 164 ms
78,120 KB |
testcase_26 | AC | 205 ms
82,088 KB |
testcase_27 | AC | 176 ms
78,572 KB |
testcase_28 | AC | 180 ms
79,100 KB |
testcase_29 | AC | 157 ms
78,332 KB |
testcase_30 | AC | 165 ms
78,756 KB |
testcase_31 | AC | 200 ms
81,884 KB |
testcase_32 | AC | 354 ms
132,788 KB |
testcase_33 | AC | 335 ms
108,816 KB |
testcase_34 | AC | 426 ms
152,592 KB |
testcase_35 | AC | 384 ms
137,320 KB |
testcase_36 | AC | 306 ms
83,916 KB |
testcase_37 | AC | 331 ms
129,884 KB |
testcase_38 | AC | 305 ms
120,012 KB |
testcase_39 | AC | 469 ms
157,180 KB |
testcase_40 | AC | 331 ms
104,816 KB |
testcase_41 | AC | 367 ms
126,096 KB |
testcase_42 | AC | 413 ms
151,788 KB |
testcase_43 | AC | 401 ms
127,924 KB |
testcase_44 | AC | 426 ms
146,548 KB |
testcase_45 | AC | 364 ms
93,456 KB |
testcase_46 | AC | 452 ms
145,676 KB |
testcase_47 | AC | 337 ms
116,884 KB |
testcase_48 | AC | 400 ms
150,248 KB |
testcase_49 | AC | 386 ms
152,228 KB |
testcase_50 | AC | 332 ms
128,248 KB |
testcase_51 | AC | 457 ms
148,560 KB |
testcase_52 | AC | 358 ms
109,948 KB |
testcase_53 | AC | 314 ms
108,792 KB |
testcase_54 | AC | 370 ms
116,248 KB |
testcase_55 | AC | 299 ms
109,472 KB |
testcase_56 | AC | 291 ms
110,972 KB |
testcase_57 | AC | 322 ms
105,044 KB |
testcase_58 | AC | 363 ms
90,948 KB |
testcase_59 | AC | 283 ms
101,708 KB |
testcase_60 | AC | 346 ms
105,788 KB |
testcase_61 | AC | 278 ms
85,600 KB |
testcase_62 | AC | 337 ms
101,224 KB |
testcase_63 | AC | 318 ms
102,276 KB |
testcase_64 | AC | 272 ms
88,628 KB |
testcase_65 | AC | 368 ms
143,628 KB |
testcase_66 | AC | 292 ms
96,400 KB |
testcase_67 | AC | 367 ms
119,768 KB |
testcase_68 | AC | 315 ms
97,752 KB |
testcase_69 | AC | 332 ms
155,928 KB |
testcase_70 | AC | 290 ms
104,328 KB |
testcase_71 | AC | 289 ms
106,064 KB |
testcase_72 | AC | 341 ms
84,460 KB |
testcase_73 | AC | 332 ms
130,724 KB |
testcase_74 | AC | 399 ms
141,372 KB |
testcase_75 | AC | 325 ms
107,452 KB |
testcase_76 | AC | 363 ms
127,452 KB |
testcase_77 | AC | 387 ms
150,824 KB |
testcase_78 | AC | 348 ms
100,216 KB |
testcase_79 | AC | 362 ms
121,132 KB |
testcase_80 | AC | 363 ms
123,628 KB |
testcase_81 | AC | 356 ms
125,832 KB |
testcase_82 | MLE | - |
testcase_83 | MLE | - |
testcase_84 | MLE | - |
testcase_85 | -- | - |
testcase_86 | -- | - |
testcase_87 | -- | - |
testcase_88 | -- | - |
testcase_89 | -- | - |
testcase_90 | -- | - |
testcase_91 | -- | - |
testcase_92 | -- | - |
testcase_93 | -- | - |
ソースコード
#!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(): def factor(n): if n < 4: return [n] res = [] i = 2 while i ** 2 <= n: if n%i == 0: while n%i == 0: n //= i res.append(i) i += 1 if i == 2000: return [] if n != 1: res.append(n) 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()