結果

問題 No.1208 anti primenumber game
ユーザー dot_haraaidot_haraai
提出日時 2021-05-31 19:40:40
言語 Nim
(2.0.2)
結果
AC  
実行時間 237 ms / 2,000 ms
コード長 1,297 bytes
コンパイル時間 3,960 ms
コンパイル使用メモリ 87,684 KB
実行使用メモリ 121,676 KB
最終ジャッジ日時 2024-04-26 08:09:35
合計ジャッジ時間 9,032 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 1 ms
6,812 KB
testcase_03 AC 1 ms
6,812 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 1 ms
6,940 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 66 ms
53,720 KB
testcase_16 AC 67 ms
53,760 KB
testcase_17 AC 66 ms
53,852 KB
testcase_18 AC 65 ms
53,732 KB
testcase_19 AC 66 ms
53,748 KB
testcase_20 AC 66 ms
53,712 KB
testcase_21 AC 157 ms
110,080 KB
testcase_22 AC 157 ms
110,208 KB
testcase_23 AC 91 ms
61,568 KB
testcase_24 AC 237 ms
121,600 KB
testcase_25 AC 208 ms
121,600 KB
testcase_26 AC 206 ms
121,596 KB
testcase_27 AC 223 ms
121,564 KB
testcase_28 AC 220 ms
121,676 KB
testcase_29 AC 211 ms
121,564 KB
testcase_30 AC 67 ms
53,680 KB
testcase_31 AC 65 ms
53,760 KB
testcase_32 AC 67 ms
54,240 KB
testcase_33 AC 96 ms
64,512 KB
testcase_34 AC 128 ms
102,144 KB
testcase_35 AC 127 ms
102,144 KB
testcase_36 AC 87 ms
62,148 KB
testcase_37 AC 127 ms
102,144 KB
testcase_38 AC 178 ms
111,104 KB
testcase_39 AC 176 ms
111,104 KB
testcase_40 AC 201 ms
120,704 KB
testcase_41 AC 78 ms
56,576 KB
testcase_42 AC 145 ms
103,680 KB
testcase_43 AC 149 ms
103,680 KB
testcase_44 AC 101 ms
63,724 KB
testcase_45 AC 102 ms
63,744 KB
testcase_46 AC 88 ms
59,236 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, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 44) Warning: imported and not used: 'heapqueue' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [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]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques,heapqueue
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 solve()=
  var
    n = scan()
    m = scan()
    a = newseqwith(n,scan())
    memo = initTable[(int,int),int]()
  
  # dfs:idx目の山にlastNum個残っている場合に取れる最高点
  proc dfs(idx:int,lastNum:int):int=
    var lastNum = lastNum
    if idx==n:
      return 0
    if lastNum == -1:
      lastNum = a[idx]
    if memo.haskey((idx,lastNum)):
      return memo[(idx,lastNum)]
    result = -int.high.div(5)
    if lastNum>=5:
      result.max=(lastNum-4)-dfs(idx,4)
    if lastNum>=2:
      result.max=(lastNum-1)-dfs(idx,1)
    if lastNum>=1:
      result.max=(lastNum-m)-dfs(idx+1,-1)
    memo[(idx,lastNum)]=result
    return result
  var score = dfs(0,-1)
  if score>0:
    echo "First"
  else:
    echo "Second"

    
solve()
0