結果

問題 No.943 取り調べ
コンテスト
ユーザー dot_haraai
提出日時 2021-05-29 17:59:27
言語 Nim
(2.2.0)
結果
AC  
実行時間 980 ms / 1,206 ms
コード長 2,123 bytes
コンパイル時間 4,250 ms
コンパイル使用メモリ 87,168 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-08 01:00:12
合計ジャッジ時間 7,824 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 24
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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 solveOld():int=
  var
    n = scan()
    x = newseqwith(n,newseqwith(n,1==scan()))
    a = newseqwith(n,scan())

  result = int.high
  for i in 0..<2^n:
    #echo i.toBin(n)
    var
      sorry = 0
      tx = x
    for j in 0..<n:
      if (i and (1 shl j)) > 0:
        sorry += a[j]
        for k in 0..<n:
          tx[k][j] = false
    var
      update = true
    while update:
      update = false
      for j in 0..<n:
        if tx[j].allit(it==false):
          for k in 0..<n:
            if tx[k][j]==true:
              update=true
              tx[k][j]=false
    #echo tx.join("\n")
    if tx.allIt(it.allIt(it==false)):
      result.min=sorry

proc solve():int=
  var
    n = scan()
    x = newseqwith(n,newseqwith(n,scan()).join("").parseBinInt)
    a = newseqwith(n,scan())
  #echo x.mapIt(it.toBin(n)).join("\n")
  result = int.high
  for i in 0..<2^n:
    
    var
      sorry = 0
      tx = x
    for j in 0..<n:
      if (i and (1 shl j)) > 0:
        sorry += a[j]
        for k in 0..<n:
          if (tx[k] and (1 shl (n-j-1))) > 0:
            tx[k] -= (1 shl (n-j-1))
    #echo i.toBin(n)," sorry:",sorry
    #echo "==="
    #echo tx.mapIt(it.toBin(n)).join("\n")
    #echo "=>"
    var
      update = true
    while update:
      update = false
      for j in 0..<n:
        if tx[j] == 0:
          for k in 0..<n:
            if (tx[k] and (1 shl (n-j-1))) > 0:
              update=true
              tx[k] -= (1 shl (n-j-1))
    #echo tx.mapIt(it.toBin(n)).join("\n")
    #echo ""
    if tx.allIt(it==0):
      result.min=sorry

    
    


  

echo solve()
0