結果

問題 No.1245 ANDORゲーム(calc)
コンテスト
ユーザー dot_haraai
提出日時 2021-06-13 16:55:48
言語 Nim
(2.2.0)
結果
AC  
実行時間 277 ms / 2,000 ms
コード長 1,279 bytes
コンパイル時間 5,554 ms
コンパイル使用メモリ 86,984 KB
実行使用メモリ 16,768 KB
最終ジャッジ日時 2024-12-23 05:16:46
合計ジャッジ時間 13,198 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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')




# bitごとにスコアを数える

proc solve()=
  var
    n = scan()
    q = scan()
    a = newseqwith(n,scan())
    s = read()
    t = newseqwith(q,scan())
    d = 30
    memo = newseqwith(d+1,newseqwith(2,0))

  proc f(idx,v:int,first:int):int=
    if idx==n:
      return 0
    else:
      var
        nxt:int
      if s[idx]=='0':
        nxt = first and (v and a[idx])
      else:
        nxt = first and (v or a[idx])
      return abs(nxt-v) + f(idx+1,nxt,first)
  
  for i in 0..<d:
    var first = 1.shl(i)
    memo[i][0]=f(0,0,first)
    memo[i][1]=f(0,first,first)
  for v in t:
    var res = 0
    for i in 0..<d:
      if (v and 1.shl(i))>0:
        res+=memo[i][1]
      else:
        res+=memo[i][0]
    echo res

    




solve()
0