結果

問題 No.854 公平なりんご分配
ユーザー dn6049949dn6049949
提出日時 2019-07-26 23:13:13
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
TLE  
実行時間 -
コード長 2,803 bytes
コンパイル時間 105 ms
コンパイル使用メモリ 11,240 KB
実行使用メモリ 526,800 KB
最終ジャッジ日時 2023-09-15 04:21:07
合計ジャッジ時間 61,082 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 181 ms
34,496 KB
testcase_01 AC 180 ms
29,996 KB
testcase_02 AC 180 ms
29,872 KB
testcase_03 AC 180 ms
29,916 KB
testcase_04 AC 180 ms
29,924 KB
testcase_05 AC 179 ms
29,924 KB
testcase_06 AC 179 ms
29,928 KB
testcase_07 AC 178 ms
29,892 KB
testcase_08 AC 181 ms
29,916 KB
testcase_09 AC 183 ms
29,964 KB
testcase_10 AC 184 ms
29,924 KB
testcase_11 AC 180 ms
30,056 KB
testcase_12 AC 180 ms
30,516 KB
testcase_13 AC 185 ms
30,328 KB
testcase_14 AC 175 ms
29,912 KB
testcase_15 AC 178 ms
29,968 KB
testcase_16 AC 188 ms
30,456 KB
testcase_17 AC 186 ms
30,440 KB
testcase_18 AC 187 ms
30,328 KB
testcase_19 AC 184 ms
30,212 KB
testcase_20 AC 179 ms
30,328 KB
testcase_21 AC 183 ms
30,232 KB
testcase_22 AC 199 ms
30,884 KB
testcase_23 AC 204 ms
32,708 KB
testcase_24 AC 218 ms
34,208 KB
testcase_25 AC 200 ms
31,892 KB
testcase_26 AC 220 ms
34,436 KB
testcase_27 AC 212 ms
34,456 KB
testcase_28 AC 195 ms
30,884 KB
testcase_29 AC 186 ms
30,956 KB
testcase_30 AC 200 ms
31,808 KB
testcase_31 AC 219 ms
33,872 KB
testcase_32 AC 901 ms
133,988 KB
testcase_33 AC 648 ms
85,436 KB
testcase_34 AC 1,282 ms
173,792 KB
testcase_35 AC 1,039 ms
142,892 KB
testcase_36 AC 374 ms
36,344 KB
testcase_37 AC 859 ms
127,732 KB
testcase_38 AC 727 ms
109,264 KB
testcase_39 AC 1,476 ms
182,548 KB
testcase_40 AC 636 ms
77,400 KB
testcase_41 AC 887 ms
120,204 KB
testcase_42 AC 1,222 ms
171,136 KB
testcase_43 AC 1,031 ms
124,676 KB
testcase_44 AC 1,242 ms
160,704 KB
testcase_45 AC 660 ms
54,924 KB
testcase_46 AC 1,329 ms
158,600 KB
testcase_47 AC 739 ms
101,372 KB
testcase_48 AC 1,180 ms
169,120 KB
testcase_49 AC 1,194 ms
171,976 KB
testcase_50 AC 846 ms
127,052 KB
testcase_51 AC 1,384 ms
165,488 KB
testcase_52 AC 776 ms
88,704 KB
testcase_53 AC 627 ms
87,452 KB
testcase_54 AC 813 ms
99,744 KB
testcase_55 AC 582 ms
88,092 KB
testcase_56 AC 593 ms
90,888 KB
testcase_57 AC 587 ms
78,856 KB
testcase_58 AC 579 ms
49,476 KB
testcase_59 AC 488 ms
72,608 KB
testcase_60 AC 635 ms
79,104 KB
testcase_61 AC 319 ms
38,624 KB
testcase_62 AC 632 ms
71,196 KB
testcase_63 AC 567 ms
73,636 KB
testcase_64 AC 329 ms
46,160 KB
testcase_65 AC 1,046 ms
153,696 KB
testcase_66 AC 475 ms
60,676 KB
testcase_67 AC 821 ms
109,064 KB
testcase_68 AC 569 ms
63,016 KB
testcase_69 AC 1,218 ms
182,860 KB
testcase_70 AC 526 ms
78,252 KB
testcase_71 AC 560 ms
82,596 KB
testcase_72 AC 423 ms
36,796 KB
testcase_73 AC 869 ms
128,976 KB
testcase_74 AC 1,109 ms
151,336 KB
testcase_75 AC 616 ms
83,040 KB
testcase_76 AC 893 ms
124,168 KB
testcase_77 AC 1,167 ms
168,376 KB
testcase_78 AC 682 ms
67,140 KB
testcase_79 AC 881 ms
111,368 KB
testcase_80 AC 891 ms
116,120 KB
testcase_81 AC 843 ms
120,024 KB
testcase_82 TLE -
testcase_83 MLE -
testcase_84 -- -
testcase_85 -- -
testcase_86 -- -
testcase_87 -- -
testcase_88 -- -
testcase_89 -- -
testcase_90 -- -
testcase_91 -- -
testcase_92 -- -
testcase_93 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#!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
    import numpy as np
    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 = np.array([[0 for j in range(m)] for i in range(n+1)])
    for i in range(n):
        f[i+1] += f[i]
        if a[i] == 1:
            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()
0