結果
問題 | No.854 公平なりんご分配 |
ユーザー | dn6049949 |
提出日時 | 2019-07-26 22:57:36 |
言語 | PyPy3 (7.3.15) |
結果 |
MLE
|
実行時間 | - |
コード長 | 2,826 bytes |
コンパイル時間 | 413 ms |
コンパイル使用メモリ | 87,104 KB |
実行使用メモリ | 329,932 KB |
最終ジャッジ日時 | 2023-09-15 03:45:12 |
合計ジャッジ時間 | 39,890 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 151 ms
77,656 KB |
testcase_01 | AC | 148 ms
77,428 KB |
testcase_02 | AC | 149 ms
77,708 KB |
testcase_03 | AC | 152 ms
77,888 KB |
testcase_04 | AC | 150 ms
77,372 KB |
testcase_05 | AC | 149 ms
77,964 KB |
testcase_06 | AC | 148 ms
77,732 KB |
testcase_07 | AC | 151 ms
77,824 KB |
testcase_08 | AC | 148 ms
77,932 KB |
testcase_09 | AC | 154 ms
77,724 KB |
testcase_10 | AC | 149 ms
77,972 KB |
testcase_11 | AC | 149 ms
77,868 KB |
testcase_12 | AC | 150 ms
77,676 KB |
testcase_13 | AC | 150 ms
77,920 KB |
testcase_14 | AC | 148 ms
77,624 KB |
testcase_15 | AC | 152 ms
77,828 KB |
testcase_16 | AC | 151 ms
77,840 KB |
testcase_17 | AC | 149 ms
77,920 KB |
testcase_18 | AC | 148 ms
77,656 KB |
testcase_19 | AC | 149 ms
77,628 KB |
testcase_20 | AC | 150 ms
77,688 KB |
testcase_21 | AC | 150 ms
77,868 KB |
testcase_22 | AC | 184 ms
78,764 KB |
testcase_23 | AC | 171 ms
78,468 KB |
testcase_24 | AC | 213 ms
82,212 KB |
testcase_25 | AC | 175 ms
78,300 KB |
testcase_26 | AC | 209 ms
82,008 KB |
testcase_27 | AC | 186 ms
78,604 KB |
testcase_28 | AC | 181 ms
78,928 KB |
testcase_29 | AC | 162 ms
78,308 KB |
testcase_30 | AC | 171 ms
78,580 KB |
testcase_31 | AC | 208 ms
81,620 KB |
testcase_32 | AC | 352 ms
132,956 KB |
testcase_33 | AC | 338 ms
108,664 KB |
testcase_34 | AC | 432 ms
152,672 KB |
testcase_35 | AC | 391 ms
137,340 KB |
testcase_36 | AC | 308 ms
84,048 KB |
testcase_37 | AC | 336 ms
129,848 KB |
testcase_38 | AC | 308 ms
119,768 KB |
testcase_39 | AC | 482 ms
156,960 KB |
testcase_40 | AC | 340 ms
104,452 KB |
testcase_41 | AC | 384 ms
126,036 KB |
testcase_42 | AC | 419 ms
151,932 KB |
testcase_43 | AC | 408 ms
128,080 KB |
testcase_44 | AC | 435 ms
146,864 KB |
testcase_45 | AC | 358 ms
93,608 KB |
testcase_46 | AC | 449 ms
145,984 KB |
testcase_47 | AC | 337 ms
116,428 KB |
testcase_48 | AC | 402 ms
150,184 KB |
testcase_49 | AC | 383 ms
152,088 KB |
testcase_50 | AC | 324 ms
128,556 KB |
testcase_51 | AC | 447 ms
148,600 KB |
testcase_52 | AC | 356 ms
110,456 KB |
testcase_53 | AC | 317 ms
109,100 KB |
testcase_54 | AC | 377 ms
116,012 KB |
testcase_55 | AC | 300 ms
109,484 KB |
testcase_56 | AC | 292 ms
111,208 KB |
testcase_57 | AC | 329 ms
105,016 KB |
testcase_58 | AC | 391 ms
90,852 KB |
testcase_59 | AC | 283 ms
101,684 KB |
testcase_60 | AC | 341 ms
105,808 KB |
testcase_61 | AC | 285 ms
85,324 KB |
testcase_62 | AC | 337 ms
101,468 KB |
testcase_63 | AC | 317 ms
102,268 KB |
testcase_64 | AC | 274 ms
88,496 KB |
testcase_65 | AC | 375 ms
143,500 KB |
testcase_66 | AC | 291 ms
97,040 KB |
testcase_67 | AC | 354 ms
119,904 KB |
testcase_68 | AC | 319 ms
97,456 KB |
testcase_69 | AC | 330 ms
156,352 KB |
testcase_70 | AC | 289 ms
103,856 KB |
testcase_71 | AC | 291 ms
106,212 KB |
testcase_72 | AC | 343 ms
84,128 KB |
testcase_73 | AC | 334 ms
130,640 KB |
testcase_74 | AC | 398 ms
140,904 KB |
testcase_75 | AC | 331 ms
107,744 KB |
testcase_76 | AC | 368 ms
126,952 KB |
testcase_77 | AC | 391 ms
150,596 KB |
testcase_78 | AC | 354 ms
99,492 KB |
testcase_79 | AC | 368 ms
120,964 KB |
testcase_80 | AC | 368 ms
123,372 KB |
testcase_81 | AC | 357 ms
125,636 KB |
testcase_82 | MLE | - |
testcase_83 | MLE | - |
testcase_84 | TLE | - |
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(): 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)] 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] == 0: f[i+1][0] += 1 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: if f[r][0]-f[l-1][0]: 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()