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

• 問題: No.854 公平なりんご分配
• ユーザー: vwxyz
• 提出日時: 2024-04-08 07:21:15
• 言語: PyPy3 (7.3.15)
• 結果: TLE
• 実行時間: -
• コード長: 3,310 bytes
• コンパイル時間: 2,810 ms
• コンパイル使用メモリ: 81,572 KB
• 実行使用メモリ: 261,032 KB
• 最終ジャッジ日時: 2024-04-08 07:23:51
• 合計ジャッジ時間: 63,270 ms
• ジャッジサーバーID （参考情報）: judge11 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	36 ms; 53,588 KB
testcase_01	AC	39 ms; 53,332 KB
testcase_02	AC	38 ms; 53,588 KB
testcase_03	AC	42 ms; 53,588 KB
testcase_04	AC	37 ms; 53,588 KB
testcase_05	AC	37 ms; 53,588 KB
testcase_06	AC	39 ms; 53,588 KB
testcase_07	AC	41 ms; 53,588 KB
testcase_08	AC	45 ms; 53,588 KB
testcase_09	AC	38 ms; 53,588 KB
testcase_10	AC	40 ms; 53,588 KB
testcase_11	AC	52 ms; 53,588 KB
testcase_12	AC	44 ms; 59,724 KB
testcase_13	AC	59 ms; 59,724 KB
testcase_14	AC	38 ms; 53,588 KB
testcase_15	AC	38 ms; 53,588 KB
testcase_16	AC	43 ms; 59,724 KB
testcase_17	AC	45 ms; 59,724 KB
testcase_18	AC	42 ms; 59,724 KB
testcase_19	AC	46 ms; 59,724 KB
testcase_20	AC	43 ms; 59,724 KB
testcase_21	AC	42 ms; 59,724 KB
testcase_22	AC	99 ms; 75,048 KB
testcase_23	AC	109 ms; 70,796 KB
testcase_24	AC	110 ms; 76,044 KB
testcase_25	AC	72 ms; 70,808 KB
testcase_26	AC	111 ms; 76,176 KB
testcase_27	AC	92 ms; 73,376 KB
testcase_28	AC	98 ms; 76,468 KB
testcase_29	AC	64 ms; 68,748 KB
testcase_30	AC	97 ms; 70,800 KB
testcase_31	AC	110 ms; 76,080 KB
testcase_32	AC	374 ms; 128,484 KB
testcase_33	AC	435 ms; 78,956 KB
testcase_34	AC	731 ms; 148,472 KB
testcase_35	AC	601 ms; 133,220 KB
testcase_36	AC	419 ms; 79,008 KB
testcase_37	AC	373 ms; 125,156 KB
testcase_38	AC	272 ms; 78,068 KB
testcase_39	AC	845 ms; 155,652 KB
testcase_40	AC	400 ms; 79,272 KB
testcase_41	AC	501 ms; 107,920 KB
testcase_42	AC	675 ms; 147,316 KB
testcase_43	AC	684 ms; 126,788 KB
testcase_44	AC	728 ms; 143,796 KB
testcase_45	AC	628 ms; 82,724 KB
testcase_46	AC	849 ms; 144,644 KB
testcase_47	AC	366 ms; 78,724 KB
testcase_48	AC	674 ms; 146,036 KB
testcase_49	AC	580 ms; 147,444 KB
testcase_50	AC	369 ms; 124,948 KB
testcase_51	AC	831 ms; 147,972 KB
testcase_52	AC	647 ms; 82,436 KB
testcase_53	AC	374 ms; 79,308 KB
testcase_54	AC	705 ms; 81,972 KB
testcase_55	AC	275 ms; 78,376 KB
testcase_56	AC	279 ms; 78,120 KB
testcase_57	AC	402 ms; 79,100 KB
testcase_58	AC	704 ms; 82,716 KB
testcase_59	AC	267 ms; 77,828 KB
testcase_60	AC	506 ms; 80,360 KB
testcase_61	AC	338 ms; 78,720 KB
testcase_62	AC	529 ms; 81,092 KB
testcase_63	AC	394 ms; 80,660 KB
testcase_64	AC	251 ms; 77,984 KB
testcase_65	AC	494 ms; 138,256 KB
testcase_66	AC	413 ms; 79,060 KB
testcase_67	AC	559 ms; 81,288 KB
testcase_68	AC	542 ms; 81,776 KB
testcase_69	AC	398 ms; 152,092 KB
testcase_70	AC	265 ms; 78,304 KB
testcase_71	AC	278 ms; 78,428 KB
testcase_72	AC	574 ms; 80,852 KB
testcase_73	AC	413 ms; 126,304 KB
testcase_74	AC	767 ms; 140,456 KB
testcase_75	AC	462 ms; 79,184 KB
testcase_76	AC	521 ms; 126,664 KB
testcase_77	AC	526 ms; 147,132 KB
testcase_78	AC	753 ms; 82,828 KB
testcase_79	AC	645 ms; 82,752 KB
testcase_80	AC	604 ms; 123,168 KB
testcase_81	AC	461 ms; 123,376 KB
testcase_82	AC	1,646 ms; 261,032 KB
testcase_83	AC	2,687 ms; 260,136 KB
testcase_84	AC	2,639 ms; 260,264 KB
testcase_85	AC	1,729 ms; 230,528 KB
testcase_86	AC	178 ms; 93,504 KB
testcase_87	AC	1,720 ms; 259,400 KB
testcase_88	AC	1,740 ms; 260,168 KB
testcase_89	AC	1,933 ms; 260,296 KB
testcase_90	AC	1,997 ms; 259,532 KB
testcase_91	AC	1,686 ms; 260,168 KB
testcase_92	TLE	-
testcase_93	TLE	-

ソースコード

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)
Q=int(input())
query=[]
ans_lst=["Yes"]*Q
for q in range(Q):
    P,L,R=map(int,input().split())
    L-=1
    query.append((P,L,R))
cumsum0=[0]*(N+1)
for i in range(N):
    if A[i]==0:
        cumsum0[i+1]=1
for i in range(1,N+1):
    cumsum0[i]+=cumsum0[i-1]
for p in Pr.primes:
    cumsum=[0]*(N+1)
    for i in range(N):
        if A[i]:
            while A[i]%p==0:
                cumsum[i+1]+=1
                A[i]//=p
    for i in range(1,N+1):
        cumsum[i]+=cumsum[i-1]
    for q,(P,L,R) in enumerate(query):
        if cumsum0[R]-cumsum0[L]:
            continue
        cnt=0
        while P%p==0:
            P//=p
            cnt+=1
        if cumsum[R]-cumsum[L]<cnt:
            ans_lst[q]="NO"
for q,(P,L,R) in enumerate(query):
    if cumsum0[R]-cumsum0[L]:
        continue
    for p in Pr.primes:
        while P%p==0:
            P//=p
    if P>=2:
        ans_lst[q]="NO"
print(*ans_lst,sep="\n")