結果

問題 No.183 たのしい排他的論理和(EASY)
ユーザー dot_haraaidot_haraai
提出日時 2021-03-10 20:35:41
言語 Nim
(2.0.2)
結果
WA  
実行時間 -
コード長 839 bytes
コンパイル時間 3,886 ms
コンパイル使用メモリ 87,168 KB
実行使用メモリ 183,556 KB
最終ジャッジ日時 2024-04-20 14:56:42
合計ジャッジ時間 9,861 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 AC 5 ms
5,376 KB
testcase_03 AC 5 ms
5,376 KB
testcase_04 AC 3 ms
5,376 KB
testcase_05 AC 5 ms
5,376 KB
testcase_06 AC 4 ms
5,376 KB
testcase_07 WA -
testcase_08 AC 557 ms
163,672 KB
testcase_09 AC 370 ms
113,152 KB
testcase_10 AC 451 ms
135,680 KB
testcase_11 AC 608 ms
177,280 KB
testcase_12 WA -
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 974 ms
183,544 KB
testcase_15 AC 626 ms
183,556 KB
testcase_16 AC 4 ms
5,376 KB
testcase_17 AC 147 ms
43,136 KB
testcase_18 WA -
testcase_19 AC 73 ms
22,912 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():int=
  var
    n = scan()
    a = newseqwith(n,scan())
    dp = newseqwith(n+1,newseqwith(2^15,false))
  
  dp[0][0]=true
  for i in 0..<n:
    for v in 0..2^14:
      dp[i+1][v xor a[i]] = dp[i][v] or dp[i+1][v xor a[i]] or dp[i][v xor a[i]]
  return dp[n].mapIt(it.int).sum()


  
echo solve()
0