結果

問題 No.1398 調和の魔法陣 (構築)
ユーザー dot_haraai
提出日時 2021-05-31 23:57:33
言語 Nim
(2.2.0)
結果
WA  
実行時間 -
コード長 1,899 bytes
コンパイル時間 4,304 ms
コンパイル使用メモリ 87,296 KB
実行使用メモリ 9,088 KB
最終ジャッジ日時 2024-11-09 00:02:34
合計ジャッジ時間 30,973 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 16 WA * 12
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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()=
  var
    w = scan()
    h = scan()
    x = scan()
  if w==1 and h==1 and 9>=x:
    echo x
  elif w==1 and 9*2>=x:
    var 
      a = min(9,x)
      b = min(9,x-a)
      t = @[a,b,0]
      board = newseqwith(h,0)
    for i in 0..<h:
      board[i] = t[i.mod(3)]
    echo board.join("\n")
  elif h==1 and 9*2>=x:
    var
      a = min(9,x)
      b = min(9,x-a)
      t = @[a,b,0]
      board = newseqwith(w,0)
    for i in 0..<w:
      board[i] = t[i.mod(3)]
    echo board.join("")
  elif ((w.mod(3)==2 and h.mod(3)==2) or (w.mod(3)==1 and h.mod(3)==1))  and 9*4>=x:
    var
      a = min(9,x)
      b = min(9,x-a)
      c = min(9,x-a-b)
      d = min(9,x-a-b-c)
      t = @[@[a,b,0],@[c,d,0],@[0,0,0]]
      board = newseqwith(h,newseqwith(w,0))
    for y in 0..<h:
      for x in 0..<w:
        board[y][x] = t[y.mod(3)][x.mod(3)]
    echo board.mapIt(it.join("")).join("\n")
  elif w==1 and h==1 and 9>=x:
    echo x
  elif w==1 and 9*2>=x:
    var 
      a = min(9,x)
      b = min(9,x-a)
      t = @[a,b,0]
      board = newseqwith(h,0)
    for i in 0..<h:
      board[i] = t[i.mod(3)]
    echo board.join("\n")
  elif h==1 and 9*2>=x:
    var
      a = min(9,x)
      b = min(9,x-a)
      t = @[a,b,0]
      board = newseqwith(w,0)
    for i in 0..<w:
      board[i] = t[i.mod(3)]
    echo board.join("")
  else:
    echo -1
    return
  
solve()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0