#970668 (PyPy3) No.854 公平なりんご分配

• 問題: No.854 公平なりんご分配
• ユーザー: vwxyz
• 提出日時: 2024-04-08 07:11:40
• 言語: PyPy3 (7.3.15)
• 結果: MLE
• 実行時間: -
• コード長: 3,154 bytes
• コンパイル時間: 2,880 ms
• コンパイル使用メモリ: 81,444 KB
• 実行使用メモリ: 322,872 KB
• 最終ジャッジ日時: 2024-04-08 07:13:09
• 合計ジャッジ時間: 63,880 ms
• ジャッジサーバーID （参考情報）: judge15 / judge12

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	38 ms; 60,392 KB
testcase_01	AC	36 ms; 53,332 KB
testcase_02	AC	36 ms; 53,588 KB
testcase_03	AC	36 ms; 53,588 KB
testcase_04	AC	39 ms; 53,588 KB
testcase_05	AC	35 ms; 53,588 KB
testcase_06	AC	39 ms; 53,588 KB
testcase_07	AC	36 ms; 53,588 KB
testcase_08	AC	61 ms; 53,588 KB
testcase_09	AC	38 ms; 53,588 KB
testcase_10	AC	36 ms; 53,588 KB
testcase_11	AC	56 ms; 53,588 KB
testcase_12	AC	50 ms; 59,724 KB
testcase_13	AC	43 ms; 59,724 KB
testcase_14	AC	36 ms; 53,588 KB
testcase_15	AC	37 ms; 53,588 KB
testcase_16	AC	42 ms; 59,724 KB
testcase_17	AC	45 ms; 59,724 KB
testcase_18	AC	41 ms; 59,724 KB
testcase_19	AC	42 ms; 59,724 KB
testcase_20	AC	42 ms; 59,724 KB
testcase_21	AC	42 ms; 59,724 KB
testcase_22	AC	100 ms; 73,696 KB
testcase_23	AC	83 ms; 73,156 KB
testcase_24	AC	109 ms; 78,752 KB
testcase_25	AC	78 ms; 73,664 KB
testcase_26	AC	118 ms; 78,876 KB
testcase_27	AC	98 ms; 78,900 KB
testcase_28	AC	101 ms; 77,384 KB
testcase_29	AC	72 ms; 66,668 KB
testcase_30	AC	78 ms; 71,064 KB
testcase_31	AC	105 ms; 78,508 KB
testcase_32	AC	411 ms; 127,712 KB
testcase_33	AC	585 ms; 104,176 KB
testcase_34	AC	855 ms; 148,180 KB
testcase_35	AC	624 ms; 132,320 KB
testcase_36	AC	313 ms; 80,072 KB
testcase_37	AC	385 ms; 124,616 KB
testcase_38	AC	322 ms; 115,272 KB
testcase_39	AC	1,309 ms; 151,548 KB
testcase_40	AC	619 ms; 100,676 KB
testcase_41	AC	611 ms; 120,796 KB
testcase_42	AC	778 ms; 146,848 KB
testcase_43	AC	956 ms; 122,896 KB
testcase_44	AC	1,017 ms; 141,368 KB
testcase_45	AC	1,020 ms; 89,400 KB
testcase_46	AC	1,282 ms; 140,520 KB
testcase_47	AC	486 ms; 111,676 KB
testcase_48	AC	695 ms; 145,764 KB
testcase_49	AC	605 ms; 147,388 KB
testcase_50	AC	396 ms; 124,064 KB
testcase_51	AC	1,404 ms; 144,144 KB
testcase_52	AC	766 ms; 105,644 KB
testcase_53	AC	413 ms; 105,144 KB
testcase_54	AC	729 ms; 111,352 KB
testcase_55	AC	311 ms; 105,284 KB
testcase_56	AC	285 ms; 106,924 KB
testcase_57	AC	470 ms; 101,392 KB
testcase_58	AC	835 ms; 87,656 KB
testcase_59	AC	300 ms; 98,888 KB
testcase_60	AC	618 ms; 101,944 KB
testcase_61	AC	260 ms; 81,672 KB
testcase_62	AC	658 ms; 97,348 KB
testcase_63	AC	411 ms; 98,620 KB
testcase_64	AC	311 ms; 85,836 KB
testcase_65	AC	497 ms; 138,592 KB
testcase_66	AC	437 ms; 92,720 KB
testcase_67	AC	531 ms; 116,000 KB
testcase_68	AC	637 ms; 93,912 KB
testcase_69	AC	412 ms; 152,964 KB
testcase_70	AC	291 ms; 100,816 KB
testcase_71	AC	301 ms; 102,984 KB
testcase_72	AC	481 ms; 81,164 KB
testcase_73	AC	392 ms; 125,984 KB
testcase_74	AC	696 ms; 136,884 KB
testcase_75	AC	510 ms; 104,084 KB
testcase_76	AC	486 ms; 123,304 KB
testcase_77	AC	527 ms; 145,476 KB
testcase_78	AC	925 ms; 95,780 KB
testcase_79	AC	733 ms; 117,652 KB
testcase_80	AC	663 ms; 119,400 KB
testcase_81	AC	447 ms; 121,472 KB
testcase_82	MLE	-
testcase_83	MLE	-
testcase_84	MLE	-
testcase_85	AC	1,462 ms; 226,704 KB
testcase_86	AC	317 ms; 89,420 KB
testcase_87	MLE	-
testcase_88	MLE	-
testcase_89	MLE	-
testcase_90	MLE	-
testcase_91	MLE	-
testcase_92	MLE	-
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
    for i in range(1,N+1):
        cumsum[p][i]+=cumsum[p][i-1]
cumsum[0]=[0]*(N+1)
for i in range(N):
    if A[i]==0:
        cumsum[0][i+1]=1
for i in range(1,N+1):
    cumsum[0][i]+=cumsum[0][i-1]
Q=int(input())
for q in range(Q):
    P,L,R=map(int,input().split())
    L-=1
    ans="Yes"
    if cumsum[0][R]-cumsum[0][L]==0:
        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)