結果

問題 No.1225 I hate I hate Matrix Construction
コンテスト
ユーザー dot_haraai
提出日時 2021-03-21 15:15:01
言語 Nim
(2.2.0)
結果
AC  
実行時間 8 ms / 2,000 ms
コード長 1,610 bytes
コンパイル時間 4,641 ms
コンパイル使用メモリ 89,084 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-22 08:33:36
合計ジャッジ時間 6,056 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 35
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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()
    s = newseqwith(n,scan())
    t = newseqwith(n,scan())
    mat = newseqwith(n,newseqwith(n,0))
    any1_row = newseqwith(n,false)
    any1_col = newseqwith(n,false)
    fix = newseqwith(n,newseqwith(n,false))
  for i in 0..<n:
    # see each row
    if s[i]==0:
      for j in 0..<n:
        mat[i][j]=0
        fix[i][j]=true
    elif s[i]==2:
      for j in 0..<n:
        mat[i][j]=1
        fix[i][j]=true
        any1_col[j]=true

    # see each col
    if t[i]==0:
      for j in 0..<n:
        mat[j][i]=0
        fix[j][i]=true
    elif t[i]==2:
      for j in 0..<n:
        mat[j][i]=1
        fix[j][i]=true
        any1_row[j]=true
  var
    need_row = 0
    need_col = 0
  #echo any1_row
  #echo any1_col
  for i in 0..<n:
    if s[i]==1 and any1_row[i]==false:
      need_row+=1
    if t[i]==1 and any1_col[i]==false:
      need_col+=1
  #echo need_row, ", ", need_col
  #echo s.count(2), ", ", t.count(2)
  return max(need_row,need_col) + (s.count(2) + t.count(2))*n - s.count(2)*t.count(2)
    

    

  

  
echo solve()
0