結果

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

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 178 ms
29,960 KB
testcase_01 AC 178 ms
29,968 KB
testcase_02 AC 179 ms
30,000 KB
testcase_03 AC 179 ms
30,088 KB
testcase_04 AC 177 ms
29,932 KB
testcase_05 AC 180 ms
30,096 KB
testcase_06 AC 177 ms
29,936 KB
testcase_07 AC 177 ms
29,984 KB
testcase_08 AC 177 ms
30,048 KB
testcase_09 AC 178 ms
29,936 KB
testcase_10 AC 179 ms
30,080 KB
testcase_11 AC 179 ms
29,948 KB
testcase_12 AC 181 ms
30,412 KB
testcase_13 AC 179 ms
30,240 KB
testcase_14 AC 176 ms
29,920 KB
testcase_15 AC 178 ms
30,068 KB
testcase_16 AC 180 ms
30,284 KB
testcase_17 AC 181 ms
30,424 KB
testcase_18 AC 180 ms
30,308 KB
testcase_19 AC 179 ms
30,312 KB
testcase_20 AC 178 ms
30,320 KB
testcase_21 AC 179 ms
30,212 KB
testcase_22 AC 194 ms
30,824 KB
testcase_23 AC 203 ms
32,408 KB
testcase_24 AC 217 ms
34,228 KB
testcase_25 AC 193 ms
31,788 KB
testcase_26 AC 214 ms
34,424 KB
testcase_27 AC 211 ms
34,536 KB
testcase_28 AC 192 ms
30,836 KB
testcase_29 AC 189 ms
30,800 KB
testcase_30 AC 193 ms
31,600 KB
testcase_31 AC 216 ms
33,608 KB
testcase_32 AC 901 ms
134,120 KB
testcase_33 AC 653 ms
85,388 KB
testcase_34 AC 1,282 ms
173,956 KB
testcase_35 AC 1,031 ms
142,912 KB
testcase_36 AC 373 ms
36,376 KB
testcase_37 AC 863 ms
127,840 KB
testcase_38 AC 734 ms
109,268 KB
testcase_39 AC 1,499 ms
182,800 KB
testcase_40 AC 641 ms
77,504 KB
testcase_41 AC 888 ms
120,204 KB
testcase_42 AC 1,232 ms
171,232 KB
testcase_43 AC 1,025 ms
124,792 KB
testcase_44 AC 1,247 ms
160,756 KB
testcase_45 AC 673 ms
54,768 KB
testcase_46 AC 1,345 ms
158,712 KB
testcase_47 AC 744 ms
101,316 KB
testcase_48 AC 1,188 ms
169,108 KB
testcase_49 AC 1,191 ms
172,016 KB
testcase_50 AC 840 ms
127,232 KB
testcase_51 AC 1,372 ms
165,632 KB
testcase_52 AC 762 ms
88,528 KB
testcase_53 AC 628 ms
87,532 KB
testcase_54 AC 826 ms
99,620 KB
testcase_55 AC 588 ms
88,096 KB
testcase_56 AC 599 ms
90,820 KB
testcase_57 AC 590 ms
78,908 KB
testcase_58 AC 592 ms
49,520 KB
testcase_59 AC 481 ms
72,468 KB
testcase_60 AC 630 ms
79,068 KB
testcase_61 AC 319 ms
38,616 KB
testcase_62 AC 637 ms
71,184 KB
testcase_63 AC 570 ms
73,664 KB
testcase_64 AC 330 ms
46,224 KB
testcase_65 AC 1,040 ms
153,712 KB
testcase_66 AC 481 ms
60,656 KB
testcase_67 AC 827 ms
109,020 KB
testcase_68 AC 572 ms
62,968 KB
testcase_69 AC 1,216 ms
182,832 KB
testcase_70 AC 528 ms
78,220 KB
testcase_71 AC 561 ms
82,708 KB
testcase_72 AC 427 ms
36,708 KB
testcase_73 AC 862 ms
129,100 KB
testcase_74 AC 1,119 ms
151,448 KB
testcase_75 AC 620 ms
82,960 KB
testcase_76 AC 893 ms
124,172 KB
testcase_77 AC 1,167 ms
168,380 KB
testcase_78 AC 682 ms
67,340 KB
testcase_79 AC 887 ms
111,420 KB
testcase_80 AC 904 ms
116,112 KB
testcase_81 AC 851 ms
119,992 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 i == 2000:
                return []
        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)
                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