結果
問題 | No.854 公平なりんご分配 |
ユーザー |
![]() |
提出日時 | 2019-07-26 22:05:09 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,309 bytes |
コンパイル時間 | 149 ms |
コンパイル使用メモリ | 82,480 KB |
実行使用メモリ | 848,244 KB |
最終ジャッジ日時 | 2024-07-02 07:22:48 |
合計ジャッジ時間 | 29,467 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
62,664 KB |
testcase_01 | AC | 44 ms
62,680 KB |
testcase_02 | AC | 47 ms
63,304 KB |
testcase_03 | AC | 46 ms
62,124 KB |
testcase_04 | AC | 46 ms
62,644 KB |
testcase_05 | AC | 46 ms
62,104 KB |
testcase_06 | AC | 49 ms
62,184 KB |
testcase_07 | AC | 49 ms
62,964 KB |
testcase_08 | AC | 48 ms
62,840 KB |
testcase_09 | AC | 48 ms
62,712 KB |
testcase_10 | AC | 49 ms
61,884 KB |
testcase_11 | AC | 49 ms
63,320 KB |
testcase_12 | AC | 50 ms
65,244 KB |
testcase_13 | AC | 50 ms
64,496 KB |
testcase_14 | AC | 44 ms
63,116 KB |
testcase_15 | AC | 46 ms
62,760 KB |
testcase_16 | AC | 46 ms
63,744 KB |
testcase_17 | AC | 46 ms
63,832 KB |
testcase_18 | AC | 47 ms
62,948 KB |
testcase_19 | AC | 47 ms
63,092 KB |
testcase_20 | AC | 46 ms
63,648 KB |
testcase_21 | AC | 51 ms
63,652 KB |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | MLE | - |
testcase_33 | RE | - |
testcase_34 | MLE | - |
testcase_35 | MLE | - |
testcase_36 | RE | - |
testcase_37 | MLE | - |
testcase_38 | MLE | - |
testcase_39 | MLE | - |
testcase_40 | RE | - |
testcase_41 | MLE | - |
testcase_42 | MLE | - |
testcase_43 | MLE | - |
testcase_44 | MLE | - |
testcase_45 | RE | - |
testcase_46 | MLE | - |
testcase_47 | RE | - |
testcase_48 | MLE | - |
testcase_49 | MLE | - |
testcase_50 | MLE | - |
testcase_51 | MLE | - |
testcase_52 | RE | - |
testcase_53 | RE | - |
testcase_54 | RE | - |
testcase_55 | RE | - |
testcase_56 | RE | - |
testcase_57 | RE | - |
testcase_58 | RE | - |
testcase_59 | RE | - |
testcase_60 | RE | - |
testcase_61 | RE | - |
testcase_62 | RE | - |
testcase_63 | RE | - |
testcase_64 | RE | - |
testcase_65 | MLE | - |
testcase_66 | RE | - |
testcase_67 | MLE | - |
testcase_68 | RE | - |
testcase_69 | MLE | - |
testcase_70 | RE | - |
testcase_71 | RE | - |
testcase_72 | RE | - |
testcase_73 | MLE | - |
testcase_74 | MLE | - |
testcase_75 | RE | - |
testcase_76 | MLE | - |
testcase_77 | MLE | - |
testcase_78 | RE | - |
testcase_79 | MLE | - |
testcase_80 | MLE | - |
testcase_81 | MLE | - |
testcase_82 | MLE | - |
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() 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() f = [[0]*2000 for i in range(n+1)] for i in range(n): for j in range(2000): f[i+1][j] += f[i][j] if a[i] < 2: continue res = factor(a[i]) for j in res: f[i+1][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: d[j] += 1 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()