結果

問題 No.1208 anti primenumber game
コンテスト
ユーザー dot_haraai
提出日時 2021-05-31 19:40:40
言語 Nim
(2.2.0)
結果
AC  
実行時間 279 ms / 2,000 ms
コード長 1,297 bytes
コンパイル時間 4,053 ms
コンパイル使用メモリ 87,680 KB
実行使用メモリ 121,640 KB
最終ジャッジ日時 2024-11-08 21:20:49
合計ジャッジ時間 11,268 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 44
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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