結果

問題 No.854 公平なりんご分配
ユーザー dn6049949dn6049949
提出日時 2019-07-26 23:17:29
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
MLE  
実行時間 -
コード長 2,979 bytes
コンパイル時間 193 ms
コンパイル使用メモリ 13,056 KB
実行使用メモリ 440,688 KB
最終ジャッジ日時 2024-07-02 09:37:51
合計ジャッジ時間 87,809 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 530 ms
51,400 KB
testcase_01 AC 517 ms
44,460 KB
testcase_02 AC 506 ms
44,584 KB
testcase_03 AC 522 ms
44,584 KB
testcase_04 AC 518 ms
44,452 KB
testcase_05 AC 514 ms
44,588 KB
testcase_06 AC 507 ms
44,456 KB
testcase_07 AC 505 ms
44,456 KB
testcase_08 AC 526 ms
44,456 KB
testcase_09 AC 528 ms
44,708 KB
testcase_10 AC 516 ms
44,588 KB
testcase_11 AC 526 ms
44,452 KB
testcase_12 AC 515 ms
44,584 KB
testcase_13 AC 529 ms
44,836 KB
testcase_14 AC 513 ms
44,456 KB
testcase_15 AC 520 ms
44,712 KB
testcase_16 AC 525 ms
44,464 KB
testcase_17 AC 530 ms
44,452 KB
testcase_18 AC 514 ms
44,584 KB
testcase_19 AC 518 ms
44,328 KB
testcase_20 AC 505 ms
44,456 KB
testcase_21 AC 503 ms
44,204 KB
testcase_22 AC 521 ms
44,708 KB
testcase_23 AC 523 ms
44,196 KB
testcase_24 AC 554 ms
46,640 KB
testcase_25 AC 532 ms
44,324 KB
testcase_26 AC 555 ms
46,716 KB
testcase_27 AC 554 ms
46,516 KB
testcase_28 AC 538 ms
44,460 KB
testcase_29 AC 533 ms
44,452 KB
testcase_30 AC 542 ms
44,584 KB
testcase_31 AC 562 ms
46,136 KB
testcase_32 AC 1,420 ms
140,004 KB
testcase_33 AC 1,091 ms
91,472 KB
testcase_34 AC 1,840 ms
179,608 KB
testcase_35 AC 1,525 ms
149,120 KB
testcase_36 AC 736 ms
47,676 KB
testcase_37 AC 1,341 ms
133,948 KB
testcase_38 AC 1,163 ms
115,684 KB
testcase_39 AC 2,120 ms
189,028 KB
testcase_40 AC 1,058 ms
83,540 KB
testcase_41 AC 1,369 ms
126,552 KB
testcase_42 AC 1,762 ms
177,664 KB
testcase_43 AC 1,544 ms
130,572 KB
testcase_44 AC 1,799 ms
166,744 KB
testcase_45 AC 1,081 ms
61,684 KB
testcase_46 AC 1,868 ms
164,760 KB
testcase_47 AC 1,190 ms
107,892 KB
testcase_48 AC 1,725 ms
175,324 KB
testcase_49 AC 1,773 ms
178,084 KB
testcase_50 AC 1,306 ms
133,472 KB
testcase_51 AC 1,929 ms
172,084 KB
testcase_52 AC 1,212 ms
95,004 KB
testcase_53 AC 1,035 ms
93,808 KB
testcase_54 AC 1,271 ms
105,656 KB
testcase_55 AC 1,011 ms
94,420 KB
testcase_56 AC 1,038 ms
96,876 KB
testcase_57 AC 978 ms
85,308 KB
testcase_58 AC 987 ms
56,704 KB
testcase_59 AC 881 ms
79,212 KB
testcase_60 AC 1,041 ms
85,292 KB
testcase_61 AC 684 ms
48,460 KB
testcase_62 AC 1,044 ms
77,692 KB
testcase_63 AC 1,015 ms
79,992 KB
testcase_64 AC 677 ms
53,196 KB
testcase_65 AC 1,549 ms
160,056 KB
testcase_66 AC 843 ms
67,528 KB
testcase_67 AC 1,317 ms
115,068 KB
testcase_68 AC 958 ms
69,668 KB
testcase_69 AC 1,739 ms
188,932 KB
testcase_70 AC 952 ms
84,068 KB
testcase_71 AC 945 ms
88,912 KB
testcase_72 AC 798 ms
47,688 KB
testcase_73 AC 1,331 ms
135,332 KB
testcase_74 AC 1,623 ms
157,836 KB
testcase_75 AC 1,024 ms
89,084 KB
testcase_76 AC 1,349 ms
130,660 KB
testcase_77 AC 1,705 ms
174,436 KB
testcase_78 AC 1,078 ms
73,572 KB
testcase_79 AC 1,366 ms
117,272 KB
testcase_80 AC 1,342 ms
122,648 KB
testcase_81 AC 1,307 ms
126,208 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
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