結果
問題 | No.854 公平なりんご分配 |
ユーザー | vwxyz |
提出日時 | 2024-04-08 07:06:36 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,991 bytes |
コンパイル時間 | 2,190 ms |
コンパイル使用メモリ | 81,444 KB |
実行使用メモリ | 322,384 KB |
最終ジャッジ日時 | 2024-04-08 07:07:49 |
合計ジャッジ時間 | 68,209 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,588 KB |
testcase_01 | AC | 38 ms
53,332 KB |
testcase_02 | AC | 38 ms
53,588 KB |
testcase_03 | AC | 39 ms
53,588 KB |
testcase_04 | AC | 38 ms
53,588 KB |
testcase_05 | AC | 40 ms
53,588 KB |
testcase_06 | AC | 38 ms
53,588 KB |
testcase_07 | AC | 41 ms
53,588 KB |
testcase_08 | AC | 43 ms
53,588 KB |
testcase_09 | AC | 39 ms
53,588 KB |
testcase_10 | AC | 38 ms
53,588 KB |
testcase_11 | AC | 50 ms
53,588 KB |
testcase_12 | AC | 46 ms
59,724 KB |
testcase_13 | AC | 62 ms
59,724 KB |
testcase_14 | AC | 40 ms
53,588 KB |
testcase_15 | AC | 42 ms
53,588 KB |
testcase_16 | AC | 44 ms
59,724 KB |
testcase_17 | AC | 51 ms
59,724 KB |
testcase_18 | AC | 42 ms
59,724 KB |
testcase_19 | AC | 44 ms
59,724 KB |
testcase_20 | AC | 44 ms
59,724 KB |
testcase_21 | AC | 44 ms
59,724 KB |
testcase_22 | AC | 95 ms
73,688 KB |
testcase_23 | AC | 102 ms
73,172 KB |
testcase_24 | AC | 118 ms
78,756 KB |
testcase_25 | AC | 88 ms
73,676 KB |
testcase_26 | AC | 124 ms
78,756 KB |
testcase_27 | AC | 96 ms
75,064 KB |
testcase_28 | AC | 104 ms
77,392 KB |
testcase_29 | AC | 68 ms
66,672 KB |
testcase_30 | AC | 98 ms
71,068 KB |
testcase_31 | AC | 110 ms
78,508 KB |
testcase_32 | AC | 434 ms
127,508 KB |
testcase_33 | AC | 591 ms
103,652 KB |
testcase_34 | AC | 968 ms
147,928 KB |
testcase_35 | AC | 671 ms
132,520 KB |
testcase_36 | AC | 417 ms
80,188 KB |
testcase_37 | AC | 402 ms
124,748 KB |
testcase_38 | AC | 347 ms
115,144 KB |
testcase_39 | AC | 1,462 ms
151,168 KB |
testcase_40 | AC | 692 ms
100,164 KB |
testcase_41 | AC | 677 ms
120,624 KB |
testcase_42 | AC | 848 ms
146,624 KB |
testcase_43 | AC | 1,058 ms
122,936 KB |
testcase_44 | AC | 1,077 ms
141,112 KB |
testcase_45 | AC | 1,322 ms
89,272 KB |
testcase_46 | AC | 1,390 ms
140,392 KB |
testcase_47 | AC | 559 ms
111,292 KB |
testcase_48 | AC | 764 ms
145,924 KB |
testcase_49 | AC | 631 ms
147,008 KB |
testcase_50 | AC | 422 ms
123,992 KB |
testcase_51 | AC | 1,630 ms
143,432 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 | MLE | - |
testcase_83 | MLE | - |
testcase_84 | MLE | - |
testcase_85 | AC | 1,548 ms
226,172 KB |
testcase_86 | AC | 321 ms
88,468 KB |
testcase_87 | MLE | - |
testcase_88 | -- | - |
testcase_89 | -- | - |
testcase_90 | -- | - |
testcase_91 | -- | - |
testcase_92 | -- | - |
testcase_93 | -- | - |
ソースコード
class Prime: def __init__(self,N): assert N<=10**8 self.smallest_prime_factor=[None]*(N+1) for i in range(2,N+1,2): self.smallest_prime_factor[i]=2 n=int(N**.5)+1 for p in range(3,n,2): if self.smallest_prime_factor[p]==None: self.smallest_prime_factor[p]=p for i in range(p**2,N+1,2*p): if self.smallest_prime_factor[i]==None: self.smallest_prime_factor[i]=p for p in range(n,N+1): if self.smallest_prime_factor[p]==None: self.smallest_prime_factor[p]=p self.primes=[p for p in range(N+1) if p==self.smallest_prime_factor[p]] def Factorize(self,N): assert N>=1 factors=defaultdict(int) if N<=len(self.smallest_prime_factor)-1: while N!=1: factors[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] else: for p in self.primes: while N%p==0: N//=p factors[p]+=1 if N<p*p: if N!=1: factors[N]+=1 break if N<=len(self.smallest_prime_factor)-1: while N!=1: factors[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] break else: if N!=1: factors[N]+=1 return factors def Divisors(self,N): assert N>0 divisors=[1] for p,e in self.Factorize(N).items(): pow_p=[1] for _ in range(e): pow_p.append(pow_p[-1]*p) divisors=[i*j for i in divisors for j in pow_p] return divisors def Is_Prime(self,N): return N==self.smallest_prime_factor[N] def Totient(self,N): for p in self.Factorize(N).keys(): N*=p-1 N//=p return N def Mebius(self,N): fact=self.Factorize(N) for e in fact.values(): if e>=2: return 0 else: if len(fact)%2==0: return 1 else: return -1 N=int(input()) A=list(map(int,input().split())) max_A=max(A) Pr=Prime(max_A) cumsum=[None]*(max_A+1) for p in Pr.primes: cumsum[p]=[0]*(N+1) for i in range(N): if A[i]: while A[i]%p==0: cumsum[p][i+1]+=1 A[i]//=p else: cumsum[p][i+1]=1000 for i in range(1,N+1): cumsum[p][i]+=cumsum[p][i-1] Q=int(input()) for q in range(Q): P,L,R=map(int,input().split()) L-=1 ans="Yes" for p in Pr.primes: cnt=0 while P%p==0: P//=p cnt+=1 if cumsum[p][R]-cumsum[p][L]<cnt: ans="NO" if P>=2: ans="NO" print(ans)