結果
問題 | No.854 公平なりんご分配 |
ユーザー | dn6049949 |
提出日時 | 2019-07-26 23:34:15 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
MLE
|
実行時間 | - |
コード長 | 3,136 bytes |
コンパイル時間 | 745 ms |
コンパイル使用メモリ | 11,340 KB |
実行使用メモリ | 552,900 KB |
最終ジャッジ日時 | 2023-09-15 05:03:25 |
合計ジャッジ時間 | 51,996 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | MLE | - |
testcase_01 | AC | 180 ms
29,920 KB |
testcase_02 | AC | 177 ms
29,872 KB |
testcase_03 | AC | 176 ms
29,884 KB |
testcase_04 | AC | 177 ms
29,896 KB |
testcase_05 | AC | 176 ms
30,144 KB |
testcase_06 | AC | 177 ms
30,024 KB |
testcase_07 | AC | 180 ms
29,928 KB |
testcase_08 | AC | 176 ms
29,960 KB |
testcase_09 | AC | 180 ms
30,016 KB |
testcase_10 | AC | 175 ms
30,048 KB |
testcase_11 | AC | 184 ms
29,948 KB |
testcase_12 | AC | 181 ms
30,508 KB |
testcase_13 | AC | 185 ms
30,284 KB |
testcase_14 | AC | 181 ms
29,908 KB |
testcase_15 | AC | 183 ms
30,036 KB |
testcase_16 | AC | 186 ms
30,280 KB |
testcase_17 | AC | 187 ms
30,464 KB |
testcase_18 | AC | 181 ms
30,168 KB |
testcase_19 | AC | 181 ms
30,340 KB |
testcase_20 | AC | 180 ms
30,172 KB |
testcase_21 | AC | 180 ms
30,308 KB |
testcase_22 | AC | 194 ms
30,752 KB |
testcase_23 | AC | 194 ms
32,424 KB |
testcase_24 | AC | 209 ms
34,280 KB |
testcase_25 | AC | 196 ms
31,824 KB |
testcase_26 | AC | 212 ms
34,604 KB |
testcase_27 | AC | 209 ms
34,464 KB |
testcase_28 | AC | 193 ms
30,820 KB |
testcase_29 | AC | 183 ms
30,772 KB |
testcase_30 | AC | 195 ms
31,604 KB |
testcase_31 | AC | 204 ms
33,820 KB |
testcase_32 | AC | 713 ms
133,480 KB |
testcase_33 | AC | 556 ms
85,156 KB |
testcase_34 | AC | 1,022 ms
172,648 KB |
testcase_35 | AC | 823 ms
142,372 KB |
testcase_36 | AC | 366 ms
36,296 KB |
testcase_37 | AC | 685 ms
127,020 KB |
testcase_38 | AC | 591 ms
108,856 KB |
testcase_39 | AC | 1,218 ms
181,560 KB |
testcase_40 | AC | 555 ms
77,128 KB |
testcase_41 | AC | 735 ms
119,760 KB |
testcase_42 | AC | 977 ms
170,464 KB |
testcase_43 | AC | 852 ms
124,108 KB |
testcase_44 | AC | 1,010 ms
159,908 KB |
testcase_45 | AC | 593 ms
54,548 KB |
testcase_46 | AC | 1,085 ms
157,992 KB |
testcase_47 | AC | 619 ms
101,136 KB |
testcase_48 | AC | 940 ms
168,212 KB |
testcase_49 | AC | 940 ms
171,124 KB |
testcase_50 | AC | 672 ms
126,416 KB |
testcase_51 | AC | 1,115 ms
164,728 KB |
testcase_52 | AC | 665 ms
88,336 KB |
testcase_53 | AC | 530 ms
87,276 KB |
testcase_54 | AC | 693 ms
99,352 KB |
testcase_55 | AC | 489 ms
87,508 KB |
testcase_56 | AC | 493 ms
90,712 KB |
testcase_57 | AC | 507 ms
78,752 KB |
testcase_58 | AC | 545 ms
49,252 KB |
testcase_59 | AC | 417 ms
72,208 KB |
testcase_60 | AC | 553 ms
78,960 KB |
testcase_61 | AC | 316 ms
38,688 KB |
testcase_62 | AC | 560 ms
70,756 KB |
testcase_63 | AC | 492 ms
73,424 KB |
testcase_64 | AC | 308 ms
46,164 KB |
testcase_65 | AC | 834 ms
152,952 KB |
testcase_66 | AC | 431 ms
60,680 KB |
testcase_67 | AC | 691 ms
108,604 KB |
testcase_68 | AC | 517 ms
62,736 KB |
testcase_69 | AC | 920 ms
181,912 KB |
testcase_70 | AC | 438 ms
77,764 KB |
testcase_71 | AC | 470 ms
82,296 KB |
testcase_72 | AC | 407 ms
36,724 KB |
testcase_73 | AC | 686 ms
128,424 KB |
testcase_74 | AC | 906 ms
150,592 KB |
testcase_75 | AC | 529 ms
82,612 KB |
testcase_76 | AC | 724 ms
123,544 KB |
testcase_77 | AC | 929 ms
167,492 KB |
testcase_78 | AC | 608 ms
66,728 KB |
testcase_79 | AC | 742 ms
110,812 KB |
testcase_80 | AC | 743 ms
115,548 KB |
testcase_81 | AC | 686 ms
119,412 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 | -- | - |
ソースコード
#!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()