結果

問題 No.1267 Stop and Coin Game
ユーザー dot_haraaidot_haraai
提出日時 2021-06-09 22:56:09
言語 Nim
(2.0.2)
結果
WA  
実行時間 -
コード長 1,177 bytes
コンパイル時間 4,124 ms
コンパイル使用メモリ 86,684 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-11-29 00:23:17
合計ジャッジ時間 5,668 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 1 ms
5,248 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 1 ms
5,248 KB
testcase_10 WA -
testcase_11 AC 9 ms
5,248 KB
testcase_12 WA -
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2 ms
5,248 KB
testcase_15 AC 1 ms
5,248 KB
testcase_16 AC 34 ms
5,248 KB
testcase_17 AC 1 ms
5,248 KB
testcase_18 AC 2 ms
5,248 KB
testcase_19 AC 1 ms
5,248 KB
testcase_20 AC 1 ms
5,248 KB
testcase_21 AC 1 ms
5,248 KB
testcase_22 WA -
testcase_23 AC 1 ms
5,248 KB
testcase_24 AC 4 ms
5,248 KB
testcase_25 WA -
testcase_26 AC 1 ms
5,248 KB
testcase_27 AC 2 ms
5,248 KB
testcase_28 AC 1 ms
5,248 KB
testcase_29 AC 2 ms
5,248 KB
testcase_30 AC 5 ms
5,248 KB
testcase_31 WA -
testcase_32 AC 2 ms
5,248 KB
testcase_33 AC 3 ms
5,248 KB
testcase_34 AC 16 ms
5,248 KB
testcase_35 WA -
testcase_36 AC 1 ms
5,248 KB
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 3 ms
5,248 KB
testcase_40 AC 2 ms
5,248 KB
testcase_41 WA -
testcase_42 AC 2 ms
5,248 KB
testcase_43 WA -
testcase_44 AC 6 ms
5,248 KB
testcase_45 AC 2 ms
5,248 KB
testcase_46 AC 2 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]

ソースコード

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 touch[last]:
      return res[last]
    else:
      touch[last] = true
    if volume<0:
      return 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