結果
問題 | No.854 公平なりんご分配 |
ユーザー | chaemon |
提出日時 | 2019-07-26 23:28:38 |
言語 | Nim (2.0.2) |
結果 |
AC
|
実行時間 | 2,962 ms / 3,153 ms |
コード長 | 2,591 bytes |
コンパイル時間 | 4,676 ms |
コンパイル使用メモリ | 67,436 KB |
実行使用メモリ | 143,688 KB |
最終ジャッジ日時 | 2023-09-15 04:55:54 |
合計ジャッジ時間 | 21,255 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,380 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 2 ms
4,380 KB |
testcase_17 | AC | 2 ms
4,376 KB |
testcase_18 | AC | 2 ms
4,376 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 2 ms
4,380 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 6 ms
4,668 KB |
testcase_23 | AC | 5 ms
5,152 KB |
testcase_24 | AC | 9 ms
5,724 KB |
testcase_25 | AC | 5 ms
5,052 KB |
testcase_26 | AC | 9 ms
5,772 KB |
testcase_27 | AC | 7 ms
5,772 KB |
testcase_28 | AC | 7 ms
4,796 KB |
testcase_29 | AC | 3 ms
4,376 KB |
testcase_30 | AC | 5 ms
4,992 KB |
testcase_31 | AC | 8 ms
5,616 KB |
testcase_32 | AC | 69 ms
33,536 KB |
testcase_33 | AC | 86 ms
20,192 KB |
testcase_34 | AC | 148 ms
45,536 KB |
testcase_35 | AC | 100 ms
36,028 KB |
testcase_36 | AC | 78 ms
6,200 KB |
testcase_37 | AC | 68 ms
31,852 KB |
testcase_38 | AC | 53 ms
26,672 KB |
testcase_39 | AC | 228 ms
47,376 KB |
testcase_40 | AC | 101 ms
18,768 KB |
testcase_41 | AC | 104 ms
29,804 KB |
testcase_42 | AC | 129 ms
44,720 KB |
testcase_43 | AC | 165 ms
31,428 KB |
testcase_44 | AC | 166 ms
40,912 KB |
testcase_45 | AC | 184 ms
11,416 KB |
testcase_46 | AC | 217 ms
40,416 KB |
testcase_47 | AC | 83 ms
25,668 KB |
testcase_48 | AC | 118 ms
43,676 KB |
testcase_49 | AC | 108 ms
45,216 KB |
testcase_50 | AC | 60 ms
32,132 KB |
testcase_51 | AC | 216 ms
43,412 KB |
testcase_52 | AC | 145 ms
21,804 KB |
testcase_53 | AC | 74 ms
20,472 KB |
testcase_54 | AC | 142 ms
24,148 KB |
testcase_55 | AC | 51 ms
21,468 KB |
testcase_56 | AC | 46 ms
21,420 KB |
testcase_57 | AC | 76 ms
18,212 KB |
testcase_58 | AC | 156 ms
10,048 KB |
testcase_59 | AC | 38 ms
16,352 KB |
testcase_60 | AC | 102 ms
18,216 KB |
testcase_61 | AC | 52 ms
6,900 KB |
testcase_62 | AC | 122 ms
16,044 KB |
testcase_63 | AC | 86 ms
16,760 KB |
testcase_64 | AC | 35 ms
9,100 KB |
testcase_65 | AC | 84 ms
39,016 KB |
testcase_66 | AC | 69 ms
12,224 KB |
testcase_67 | AC | 111 ms
26,716 KB |
testcase_68 | AC | 117 ms
13,852 KB |
testcase_69 | AC | 80 ms
47,484 KB |
testcase_70 | AC | 45 ms
18,384 KB |
testcase_71 | AC | 51 ms
19,216 KB |
testcase_72 | AC | 105 ms
6,448 KB |
testcase_73 | AC | 68 ms
32,092 KB |
testcase_74 | AC | 136 ms
39,208 KB |
testcase_75 | AC | 78 ms
19,304 KB |
testcase_76 | AC | 107 ms
31,392 KB |
testcase_77 | AC | 117 ms
44,808 KB |
testcase_78 | AC | 157 ms
14,932 KB |
testcase_79 | AC | 136 ms
27,360 KB |
testcase_80 | AC | 130 ms
28,744 KB |
testcase_81 | AC | 93 ms
30,212 KB |
testcase_82 | AC | 414 ms
143,372 KB |
testcase_83 | AC | 690 ms
142,372 KB |
testcase_84 | AC | 2,962 ms
143,688 KB |
testcase_85 | AC | 713 ms
142,148 KB |
testcase_86 | AC | 378 ms
141,920 KB |
testcase_87 | AC | 416 ms
142,656 KB |
testcase_88 | AC | 412 ms
142,240 KB |
testcase_89 | AC | 416 ms
143,408 KB |
testcase_90 | AC | 414 ms
143,300 KB |
testcase_91 | AC | 415 ms
142,224 KB |
testcase_92 | AC | 733 ms
143,492 KB |
testcase_93 | AC | 736 ms
142,032 KB |
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 57) Warning: imported and not used: 'strutils' [UnusedImport] /home/judge/data/code/Main.nim(2, 45) Warning: imported and not used: 'math' [UnusedImport] /home/judge/data/code/Main.nim(2, 29) Warning: imported and not used: 'tables' [UnusedImport] /home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'macros' [UnusedImport]
ソースコード
#{{{ header import algorithm, sequtils, tables, macros, math, sets, strutils when defined(MYDEBUG): import header proc scanf(formatstr: cstring){.header: "<stdio.h>", varargs.} proc getchar(): char {.header: "<stdio.h>", varargs.} proc nextInt(): int = scanf("%lld",addr result) proc nextFloat(): float = scanf("%lf",addr result) proc nextString(): string = var get = false result = "" while true: var c = getchar() if int(c) > int(' '): get = true result.add(c) else: if get: break get = false template `max=`*(x,y:typed):void = x = max(x,y) template `min=`*(x,y:typed):void = x = min(x,y) template infty(T): untyped = ((T(1) shl T(sizeof(T)*8-2)) - 1) #}}} var pdiv: seq[int] proc sieve_of_eratosthenes(n:int):void = pdiv = newSeq[int](n) for i in 2..<n: pdiv[i] = i for i in 2..<n: if i * i >= n: break if pdiv[i] == i: for j in countup(i*i,n-1,i): pdiv[j] = i proc is_prime(n:int):bool = return n!=1 and pdiv[n]==n proc main():void = sieve_of_eratosthenes(2000) var N = nextInt() A = newSeqWith(N,nextInt()) pid = newSeq[int](2000) zero_ct = newSeqWith(N+1,0) ct = 0 for p in 2..<2000: if pdiv[p]==p: pid[p] = ct ct += 1 var t = newSeqWith(N+1,newSeq[int32](ct)) zero_ct[0] = 0 for i in 0..<N: var a = A[i] for j in 0..<ct: t[i+1][j] = t[i][j] zero_ct[i+1] = zero_ct[i] if a == 0: zero_ct[i+1] += 1 else: for p in 2..a: if p*p > a: break while a mod p==0: a = a div p t[i+1][pid[p]] += 1 if a > 1: t[i+1][pid[a]] += 1 var Q = nextInt() for _ in 0..<Q: var P = nextInt() L = nextInt() R = nextInt() tt = newSeq[int32](ct) u = newSeq[int](ct) L -= 1 if zero_ct[R] - zero_ct[L] > 0: echo "Yes" else: var valid = true for j in 0..<ct: tt[j] += t[R][j] - t[L][j] var a = P for p in 2..a: if p*p > a: break if a mod p == 0: if p >= 2000: valid = false break while a mod p == 0: a = a div p u[pid[p]] += 1 if not valid: break if not valid: echo "NO" continue if a > 1: if a >= 2000: valid = false echo "NO" continue else: u[pid[a]] += 1 for i in 0..<ct: if tt[i] < u[i]: valid = false if valid: echo "Yes" else: echo "NO" discard main()