結果

問題 No.854 公平なりんご分配
ユーザー dn6049949dn6049949
提出日時 2019-07-26 23:18:42
言語 PyPy3
(7.3.15)
結果
MLE  
実行時間 -
コード長 2,967 bytes
コンパイル時間 271 ms
コンパイル使用メモリ 82,264 KB
実行使用メモリ 328,156 KB
最終ジャッジ日時 2024-07-02 09:40:08
合計ジャッジ時間 31,215 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 78 ms
76,528 KB
testcase_01 AC 81 ms
76,628 KB
testcase_02 AC 78 ms
76,416 KB
testcase_03 AC 78 ms
76,612 KB
testcase_04 AC 77 ms
76,540 KB
testcase_05 AC 79 ms
76,732 KB
testcase_06 AC 79 ms
76,628 KB
testcase_07 AC 79 ms
76,536 KB
testcase_08 AC 82 ms
76,836 KB
testcase_09 AC 77 ms
76,788 KB
testcase_10 AC 78 ms
76,688 KB
testcase_11 AC 78 ms
76,376 KB
testcase_12 AC 80 ms
76,852 KB
testcase_13 AC 78 ms
77,020 KB
testcase_14 AC 75 ms
76,472 KB
testcase_15 AC 79 ms
76,828 KB
testcase_16 AC 77 ms
76,828 KB
testcase_17 AC 79 ms
76,912 KB
testcase_18 AC 77 ms
76,768 KB
testcase_19 AC 81 ms
76,668 KB
testcase_20 AC 80 ms
76,684 KB
testcase_21 AC 80 ms
76,680 KB
testcase_22 AC 114 ms
77,844 KB
testcase_23 AC 98 ms
77,628 KB
testcase_24 AC 135 ms
81,256 KB
testcase_25 AC 97 ms
77,484 KB
testcase_26 AC 136 ms
81,056 KB
testcase_27 AC 105 ms
77,328 KB
testcase_28 AC 111 ms
77,840 KB
testcase_29 AC 87 ms
77,452 KB
testcase_30 AC 98 ms
77,280 KB
testcase_31 AC 122 ms
78,288 KB
testcase_32 AC 265 ms
131,424 KB
testcase_33 AC 245 ms
107,328 KB
testcase_34 AC 343 ms
151,748 KB
testcase_35 AC 311 ms
135,928 KB
testcase_36 AC 225 ms
82,788 KB
testcase_37 AC 249 ms
127,336 KB
testcase_38 AC 232 ms
118,636 KB
testcase_39 AC 381 ms
155,852 KB
testcase_40 AC 248 ms
102,908 KB
testcase_41 AC 285 ms
124,684 KB
testcase_42 AC 330 ms
149,928 KB
testcase_43 AC 317 ms
126,552 KB
testcase_44 AC 345 ms
144,436 KB
testcase_45 AC 268 ms
91,796 KB
testcase_46 AC 365 ms
144,532 KB
testcase_47 AC 259 ms
115,340 KB
testcase_48 AC 319 ms
149,264 KB
testcase_49 AC 306 ms
149,840 KB
testcase_50 AC 251 ms
127,320 KB
testcase_51 AC 363 ms
146,888 KB
testcase_52 AC 275 ms
108,776 KB
testcase_53 AC 234 ms
107,512 KB
testcase_54 AC 285 ms
114,344 KB
testcase_55 AC 219 ms
107,904 KB
testcase_56 AC 208 ms
108,844 KB
testcase_57 AC 244 ms
104,204 KB
testcase_58 AC 268 ms
89,644 KB
testcase_59 AC 203 ms
100,556 KB
testcase_60 AC 258 ms
104,132 KB
testcase_61 AC 198 ms
84,608 KB
testcase_62 AC 247 ms
100,488 KB
testcase_63 AC 229 ms
101,248 KB
testcase_64 AC 194 ms
87,392 KB
testcase_65 AC 293 ms
140,980 KB
testcase_66 AC 212 ms
94,144 KB
testcase_67 AC 289 ms
118,760 KB
testcase_68 AC 236 ms
95,892 KB
testcase_69 AC 258 ms
154,824 KB
testcase_70 AC 210 ms
103,108 KB
testcase_71 AC 216 ms
105,552 KB
testcase_72 AC 253 ms
83,104 KB
testcase_73 AC 256 ms
128,060 KB
testcase_74 AC 320 ms
140,260 KB
testcase_75 AC 242 ms
105,788 KB
testcase_76 AC 281 ms
126,212 KB
testcase_77 AC 301 ms
148,208 KB
testcase_78 AC 259 ms
98,140 KB
testcase_79 AC 280 ms
120,084 KB
testcase_80 AC 278 ms
122,552 KB
testcase_81 AC 270 ms
123,956 KB
testcase_82 MLE -
testcase_83 MLE -
testcase_84 TLE -
testcase_85 MLE -
testcase_86 MLE -
testcase_87 MLE -
testcase_88 MLE -
testcase_89 MLE -
testcase_90 MLE -
testcase_91 MLE -
testcase_92 MLE -
testcase_93 MLE -
権限があれば一括ダウンロードができます

ソースコード

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
    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 = [[0]*m for i in range(n+1)]
    for i in range(n):
        for j in range(m):
            f[i+1][j] += f[i][j]
        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