結果
問題 | No.854 公平なりんご分配 |
ユーザー | dn6049949 |
提出日時 | 2019-07-26 23:04:07 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,778 bytes |
コンパイル時間 | 122 ms |
コンパイル使用メモリ | 11,140 KB |
実行使用メモリ | 391,716 KB |
最終ジャッジ日時 | 2023-09-15 03:59:16 |
合計ジャッジ時間 | 50,401 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
13,708 KB |
testcase_01 | AC | 65 ms
9,448 KB |
testcase_02 | AC | 65 ms
9,404 KB |
testcase_03 | AC | 66 ms
9,468 KB |
testcase_04 | AC | 65 ms
9,448 KB |
testcase_05 | AC | 64 ms
9,444 KB |
testcase_06 | AC | 66 ms
9,444 KB |
testcase_07 | AC | 65 ms
9,524 KB |
testcase_08 | AC | 65 ms
9,440 KB |
testcase_09 | AC | 65 ms
9,472 KB |
testcase_10 | AC | 66 ms
9,476 KB |
testcase_11 | AC | 65 ms
9,476 KB |
testcase_12 | AC | 68 ms
9,624 KB |
testcase_13 | AC | 68 ms
9,656 KB |
testcase_14 | AC | 66 ms
9,568 KB |
testcase_15 | AC | 66 ms
9,492 KB |
testcase_16 | AC | 68 ms
9,636 KB |
testcase_17 | AC | 69 ms
9,652 KB |
testcase_18 | AC | 67 ms
9,484 KB |
testcase_19 | AC | 67 ms
9,480 KB |
testcase_20 | AC | 66 ms
9,588 KB |
testcase_21 | AC | 68 ms
9,580 KB |
testcase_22 | AC | 78 ms
9,848 KB |
testcase_23 | AC | 85 ms
10,892 KB |
testcase_24 | AC | 101 ms
11,596 KB |
testcase_25 | AC | 82 ms
10,608 KB |
testcase_26 | AC | 101 ms
12,020 KB |
testcase_27 | AC | 98 ms
11,948 KB |
testcase_28 | AC | 77 ms
9,952 KB |
testcase_29 | AC | 73 ms
9,788 KB |
testcase_30 | AC | 81 ms
10,600 KB |
testcase_31 | AC | 97 ms
11,324 KB |
testcase_32 | AC | 808 ms
70,536 KB |
testcase_33 | AC | 539 ms
40,476 KB |
testcase_34 | AC | 1,200 ms
96,572 KB |
testcase_35 | AC | 920 ms
76,204 KB |
testcase_36 | AC | 230 ms
12,892 KB |
testcase_37 | AC | 769 ms
66,376 KB |
testcase_38 | AC | 616 ms
54,708 KB |
testcase_39 | AC | 1,391 ms
103,060 KB |
testcase_40 | AC | 520 ms
35,792 KB |
testcase_41 | AC | 782 ms
61,800 KB |
testcase_42 | AC | 1,150 ms
95,004 KB |
testcase_43 | AC | 924 ms
64,304 KB |
testcase_44 | AC | 1,158 ms
87,956 KB |
testcase_45 | AC | 506 ms
23,008 KB |
testcase_46 | AC | 1,229 ms
86,528 KB |
testcase_47 | AC | 625 ms
49,840 KB |
testcase_48 | AC | 1,110 ms
93,296 KB |
testcase_49 | AC | 1,111 ms
95,540 KB |
testcase_50 | AC | 753 ms
65,848 KB |
testcase_51 | AC | 1,277 ms
91,176 KB |
testcase_52 | AC | 643 ms
42,352 KB |
testcase_53 | AC | 525 ms
41,720 KB |
testcase_54 | AC | 709 ms
49,136 KB |
testcase_55 | AC | 486 ms
42,116 KB |
testcase_56 | AC | 497 ms
43,820 KB |
testcase_57 | AC | 481 ms
36,472 KB |
testcase_58 | AC | 440 ms
19,840 KB |
testcase_59 | AC | 364 ms
32,956 KB |
testcase_60 | AC | 516 ms
36,524 KB |
testcase_61 | AC | 191 ms
14,204 KB |
testcase_62 | AC | 487 ms
31,828 KB |
testcase_63 | AC | 436 ms
33,684 KB |
testcase_64 | AC | 210 ms
18,344 KB |
testcase_65 | AC | 948 ms
83,280 KB |
testcase_66 | AC | 351 ms
26,396 KB |
testcase_67 | AC | 704 ms
54,760 KB |
testcase_68 | AC | 426 ms
27,720 KB |
testcase_69 | AC | 1,127 ms
103,036 KB |
testcase_70 | AC | 420 ms
36,248 KB |
testcase_71 | AC | 454 ms
38,732 KB |
testcase_72 | AC | 274 ms
13,120 KB |
testcase_73 | AC | 773 ms
67,352 KB |
testcase_74 | AC | 1,017 ms
81,672 KB |
testcase_75 | AC | 502 ms
38,952 KB |
testcase_76 | AC | 795 ms
64,156 KB |
testcase_77 | AC | 1,097 ms
92,868 KB |
testcase_78 | AC | 530 ms
29,860 KB |
testcase_79 | AC | 760 ms
56,236 KB |
testcase_80 | AC | 770 ms
59,284 KB |
testcase_81 | AC | 752 ms
61,596 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 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 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) 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()