結果

問題 No.854 公平なりんご分配
ユーザー dn6049949dn6049949
提出日時 2019-07-26 23:34:15
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
MLE  
実行時間 -
コード長 3,136 bytes
コンパイル時間 676 ms
コンパイル使用メモリ 13,184 KB
実行使用メモリ 532,236 KB
最終ジャッジ日時 2024-07-02 10:03:53
合計ジャッジ時間 86,066 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 548 ms
50,820 KB
testcase_01 AC 555 ms
44,000 KB
testcase_02 AC 547 ms
44,120 KB
testcase_03 AC 541 ms
43,996 KB
testcase_04 AC 547 ms
43,744 KB
testcase_05 AC 541 ms
43,740 KB
testcase_06 AC 551 ms
43,868 KB
testcase_07 AC 549 ms
43,880 KB
testcase_08 AC 554 ms
43,880 KB
testcase_09 AC 552 ms
44,120 KB
testcase_10 AC 557 ms
44,128 KB
testcase_11 AC 543 ms
43,736 KB
testcase_12 AC 542 ms
43,996 KB
testcase_13 AC 543 ms
43,748 KB
testcase_14 AC 547 ms
44,124 KB
testcase_15 AC 549 ms
43,744 KB
testcase_16 AC 545 ms
43,996 KB
testcase_17 AC 544 ms
43,996 KB
testcase_18 AC 548 ms
43,996 KB
testcase_19 AC 552 ms
43,748 KB
testcase_20 AC 552 ms
43,752 KB
testcase_21 AC 549 ms
43,744 KB
testcase_22 AC 562 ms
44,124 KB
testcase_23 AC 568 ms
44,128 KB
testcase_24 AC 591 ms
44,388 KB
testcase_25 AC 568 ms
43,880 KB
testcase_26 AC 587 ms
44,384 KB
testcase_27 AC 589 ms
44,388 KB
testcase_28 AC 568 ms
43,992 KB
testcase_29 AC 555 ms
44,128 KB
testcase_30 AC 558 ms
43,744 KB
testcase_31 AC 588 ms
44,516 KB
testcase_32 AC 1,299 ms
139,780 KB
testcase_33 AC 1,050 ms
91,264 KB
testcase_34 AC 1,698 ms
178,772 KB
testcase_35 AC 1,424 ms
148,608 KB
testcase_36 AC 775 ms
45,728 KB
testcase_37 AC 1,251 ms
133,096 KB
testcase_38 AC 1,124 ms
115,164 KB
testcase_39 AC 1,918 ms
187,804 KB
testcase_40 AC 1,048 ms
83,244 KB
testcase_41 AC 1,292 ms
125,660 KB
testcase_42 AC 1,632 ms
176,788 KB
testcase_43 AC 1,428 ms
130,120 KB
testcase_44 AC 1,671 ms
165,728 KB
testcase_45 AC 1,099 ms
61,720 KB
testcase_46 AC 1,766 ms
164,376 KB
testcase_47 AC 1,119 ms
107,232 KB
testcase_48 AC 1,569 ms
174,100 KB
testcase_49 AC 1,571 ms
177,232 KB
testcase_50 AC 1,225 ms
132,768 KB
testcase_51 AC 1,807 ms
171,072 KB
testcase_52 AC 1,165 ms
94,184 KB
testcase_53 AC 1,010 ms
93,680 KB
testcase_54 AC 1,225 ms
105,212 KB
testcase_55 AC 957 ms
93,664 KB
testcase_56 AC 987 ms
96,908 KB
testcase_57 AC 977 ms
85,132 KB
testcase_58 AC 990 ms
56,640 KB
testcase_59 AC 862 ms
78,976 KB
testcase_60 AC 1,021 ms
84,792 KB
testcase_61 AC 707 ms
46,668 KB
testcase_62 AC 1,019 ms
77,076 KB
testcase_63 AC 950 ms
79,824 KB
testcase_64 AC 724 ms
53,528 KB
testcase_65 AC 1,495 ms
159,028 KB
testcase_66 AC 872 ms
67,136 KB
testcase_67 AC 1,229 ms
114,744 KB
testcase_68 AC 972 ms
69,852 KB
testcase_69 AC 1,618 ms
187,860 KB
testcase_70 AC 921 ms
83,888 KB
testcase_71 AC 948 ms
88,204 KB
testcase_72 AC 826 ms
46,816 KB
testcase_73 AC 1,254 ms
134,648 KB
testcase_74 AC 1,528 ms
156,668 KB
testcase_75 AC 999 ms
89,020 KB
testcase_76 AC 1,287 ms
129,500 KB
testcase_77 AC 1,572 ms
173,832 KB
testcase_78 AC 1,077 ms
73,740 KB
testcase_79 AC 1,292 ms
117,284 KB
testcase_80 AC 1,300 ms
121,804 KB
testcase_81 AC 1,240 ms
125,508 KB
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 -- -
権限があれば一括ダウンロードができます

ソースコード

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
import numpy as np
def D():
    mem = defaultdict(lambda : None)
    def factor(n):
        if mem[n] != None:
            return mem[n]
        if n < 4:
            mem[n] = [n]
            return [n]
        res = []
        i = 2
        m = n
        while i ** 2 <= n:
            if n%i == 0:
                while n%i == 0:
                    n //= i
                    res.append(i)
            i += 1
            if i == 2000:
                mem[m] = []
                return []
        if n != 1:
            res.append(n)
        mem[m] = res
        return res
    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]*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)
                if res == []:
                    print("NO")
                else:
                    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