結果

問題 No.1267 Stop and Coin Game
コンテスト
ユーザー dot_haraai
提出日時 2021-06-09 23:01:19
言語 Nim
(2.2.0)
結果
AC  
実行時間 40 ms / 2,000 ms
コード長 1,238 bytes
コンパイル時間 4,774 ms
コンパイル使用メモリ 88,104 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-29 00:31:43
合計ジャッジ時間 5,713 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 43
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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]

ソースコード

diff # 

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 solve():string=
  var
    n = scan()
    v = scan()
    a = newseqwith(n,scan())
    touch = newseqwith(1.shl(n),false)
    res = newseqwith(1.shl(n),false)
  if a.sum()<=v:
    return "Draw"

  proc dfs(last:int,volume:int):bool=
    if volume<0:
      return true
    if touch[last]:
      return res[last]
    else:
      touch[last] = true

    
    result = false
    # 遷移先がすべて必勝のときのみ必敗
    for i in 0..<n:
      if (last and 1.shl(i))>0:
        result = result or (not dfs(last-1.shl(i),volume-a[i]))
    res[last] = result
    return result
  
  #echo (1.shl(n)-1).toBin(n)
  if dfs(1.shl(n)-1,v):
    return "First"
  else:
    return "Second"


  
echo solve()
0