結果
問題 | No.458 異なる素数の和 |
ユーザー | dot_haraai |
提出日時 | 2021-03-20 00:45:22 |
言語 | Nim (2.0.2) |
結果 |
AC
|
実行時間 | 261 ms / 2,000 ms |
コード長 | 1,439 bytes |
コンパイル時間 | 4,233 ms |
コンパイル使用メモリ | 89,728 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-19 03:49:43 |
合計ジャッジ時間 | 12,301 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
5,248 KB |
testcase_01 | AC | 249 ms
5,248 KB |
testcase_02 | AC | 246 ms
5,248 KB |
testcase_03 | AC | 241 ms
5,248 KB |
testcase_04 | AC | 247 ms
5,248 KB |
testcase_05 | AC | 251 ms
5,248 KB |
testcase_06 | AC | 248 ms
5,248 KB |
testcase_07 | AC | 243 ms
5,248 KB |
testcase_08 | AC | 245 ms
5,248 KB |
testcase_09 | AC | 248 ms
5,248 KB |
testcase_10 | AC | 248 ms
5,248 KB |
testcase_11 | AC | 244 ms
5,248 KB |
testcase_12 | AC | 249 ms
5,248 KB |
testcase_13 | AC | 249 ms
5,248 KB |
testcase_14 | AC | 248 ms
5,248 KB |
testcase_15 | AC | 250 ms
5,248 KB |
testcase_16 | AC | 251 ms
5,248 KB |
testcase_17 | AC | 247 ms
5,248 KB |
testcase_18 | AC | 261 ms
5,248 KB |
testcase_19 | AC | 251 ms
5,248 KB |
testcase_20 | AC | 251 ms
5,248 KB |
testcase_21 | AC | 252 ms
5,248 KB |
testcase_22 | AC | 249 ms
5,248 KB |
testcase_23 | AC | 250 ms
5,248 KB |
testcase_24 | AC | 247 ms
5,248 KB |
testcase_25 | AC | 248 ms
5,248 KB |
testcase_26 | AC | 244 ms
5,248 KB |
testcase_27 | AC | 252 ms
5,248 KB |
testcase_28 | AC | 246 ms
5,248 KB |
testcase_29 | AC | 244 ms
5,248 KB |
testcase_30 | AC | 239 ms
5,248 KB |
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated] /home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport] /home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport] /home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport] /home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport] /home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport] /home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport] /home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport] /home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport] /home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport] /home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]
ソースコード
import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets import critbits, future, strformat, deques template `max=`(x,y) = x = max(x,y) template `min=`(x,y) = x = min(x,y) template `mod=`(x,y) = x = x mod y template scan2 = (scan(), scan()) template scan3 = (scan(), scan()) let read* = iterator: string {.closure.} = while true: (for s in stdin.readLine.split: yield s) proc scan(): int = read().parseInt proc scanf(): float = read().parseFloat proc toInt(c:char): int = return int(c) - int('0') proc getIsPrimes(n:int):seq[bool]= result = newseqwith(n+1,true) var d = 2 result[0]=false result[1]=false while d^2<=n: if result[d]: var m = 2 while d*m<=n: result[d*m]=false m+=1 d+=1 const maxp = 20000 const isPrime:seq[bool] = getIsPrimes(maxp) proc getPrimes(n:seq[bool]):seq[int]= for i in 2..<n.len: if n[i]: result.add(i) const primes = getPrimes(isPrime) proc solve():int= var n = scan() mx = 20000 dp = newseqwith(2,newseqwith(mx+1,0)) dp[0][2]=1 for pi in 1..<len(primes): var p = primes[pi] dp[pi mod 2][p].max=1 for i in 0..mx: dp[pi mod 2][i].max=dp[(pi-1) mod 2][i] if i-p>=0 and dp[(pi-1) mod 2][i-p]>0: dp[pi mod 2][i].max=dp[(pi-1) mod 2][i-p]+1 if dp[(primes.len-1) mod 2][n]==0: return -1 else: return dp[(primes.len-1) mod 2][n] echo solve()