結果
問題 | No.854 公平なりんご分配 |
ユーザー | dn6049949 |
提出日時 | 2019-07-26 22:45:38 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,621 bytes |
コンパイル時間 | 420 ms |
コンパイル使用メモリ | 87,128 KB |
実行使用メモリ | 157,224 KB |
最終ジャッジ日時 | 2023-09-15 03:23:32 |
合計ジャッジ時間 | 32,313 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 143 ms
77,856 KB |
testcase_01 | AC | 144 ms
77,996 KB |
testcase_02 | AC | 146 ms
77,920 KB |
testcase_03 | AC | 145 ms
77,696 KB |
testcase_04 | AC | 145 ms
78,064 KB |
testcase_05 | AC | 148 ms
78,112 KB |
testcase_06 | AC | 147 ms
77,924 KB |
testcase_07 | AC | 144 ms
78,036 KB |
testcase_08 | AC | 145 ms
78,128 KB |
testcase_09 | AC | 149 ms
78,024 KB |
testcase_10 | AC | 148 ms
77,936 KB |
testcase_11 | AC | 148 ms
78,060 KB |
testcase_12 | AC | 148 ms
78,040 KB |
testcase_13 | AC | 148 ms
78,080 KB |
testcase_14 | AC | 146 ms
77,856 KB |
testcase_15 | AC | 145 ms
78,040 KB |
testcase_16 | AC | 146 ms
77,980 KB |
testcase_17 | AC | 148 ms
78,084 KB |
testcase_18 | AC | 148 ms
78,388 KB |
testcase_19 | AC | 145 ms
78,084 KB |
testcase_20 | AC | 147 ms
77,980 KB |
testcase_21 | AC | 147 ms
77,924 KB |
testcase_22 | AC | 180 ms
78,972 KB |
testcase_23 | AC | 169 ms
78,752 KB |
testcase_24 | AC | 202 ms
82,548 KB |
testcase_25 | AC | 162 ms
78,664 KB |
testcase_26 | AC | 204 ms
82,360 KB |
testcase_27 | AC | 173 ms
79,124 KB |
testcase_28 | AC | 179 ms
78,716 KB |
testcase_29 | AC | 155 ms
78,212 KB |
testcase_30 | AC | 163 ms
78,600 KB |
testcase_31 | AC | 198 ms
82,220 KB |
testcase_32 | AC | 346 ms
132,744 KB |
testcase_33 | AC | 326 ms
108,700 KB |
testcase_34 | AC | 422 ms
152,324 KB |
testcase_35 | AC | 380 ms
136,904 KB |
testcase_36 | AC | 292 ms
83,672 KB |
testcase_37 | AC | 333 ms
129,656 KB |
testcase_38 | AC | 303 ms
120,620 KB |
testcase_39 | AC | 468 ms
157,224 KB |
testcase_40 | AC | 326 ms
105,064 KB |
testcase_41 | AC | 373 ms
125,992 KB |
testcase_42 | AC | 414 ms
151,368 KB |
testcase_43 | AC | 396 ms
128,476 KB |
testcase_44 | AC | 419 ms
146,496 KB |
testcase_45 | AC | 349 ms
93,264 KB |
testcase_46 | AC | 439 ms
145,276 KB |
testcase_47 | AC | 331 ms
116,768 KB |
testcase_48 | AC | 396 ms
149,920 KB |
testcase_49 | AC | 381 ms
152,028 KB |
testcase_50 | AC | 321 ms
128,272 KB |
testcase_51 | AC | 440 ms
148,268 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 | TLE | - |
testcase_83 | -- | - |
testcase_84 | -- | - |
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 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)] 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] < 2: 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: res = factor(p) 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()