結果
| 問題 |
No.1398 調和の魔法陣 (構築)
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2021-02-24 02:29:01 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 69 ms / 3,153 ms |
| コード長 | 1,722 bytes |
| コンパイル時間 | 214 ms |
| コンパイル使用メモリ | 82,060 KB |
| 実行使用メモリ | 79,096 KB |
| 最終ジャッジ日時 | 2024-09-22 21:38:54 |
| 合計ジャッジ時間 | 28,088 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 28 |
ソースコード
W, H, X = map(int, input().split())
ans = [[0]*W for _ in range(H)]
if X>36: print(-1)
elif H%3==2 and W%3==2:
a = min(9,X)
b = min(9,X-a)
c = min(9,X-a-b)
d = max(0,X-27)
for i in range(0,H,3):
for j in range(0,W,3): ans[i][j] = a
for j in range(1,W,3): ans[i][j] = b
for i in range(1,H,3):
for j in range(0,W,3): ans[i][j] = c
for j in range(1,W,3): ans[i][j] = d
for a in ans: print(''.join(map(str,a)))
elif H%3==2:
if X>18: print(-1)
else:
a = min(9,X)
b = max(0,X-9)
if W%3==1:
for i in range(0,H,3):
for j in range(0,W,3): ans[i][j] = a
for i in range(1,H,3):
for j in range(0,W,3): ans[i][j] = b
else:
for i in range(0,H,3):
for j in range(1,W,3): ans[i][j] = a
for i in range(1,H,3):
for j in range(1,W,3): ans[i][j] = b
for a in ans: print(''.join(map(str,a)))
elif W%3==2:
if X>18: print(-1)
else:
a = min(9,X)
b = max(0,X-9)
if H%3==1:
for i in range(0,H,3):
for j in range(0,W,3): ans[i][j] = a
for j in range(1,W,3): ans[i][j] = b
else:
for i in range(1,H,3):
for j in range(0,W,3): ans[i][j] = a
for j in range(1,W,3): ans[i][j] = b
for a in ans: print(''.join(map(str,a)))
else:
if X>9: print(-1)
else:
a = X
if H%3==1 and W%3==1:
for i in range(0,H,3):
for j in range(0,W,3): ans[i][j] = a
elif H%3==1:
for i in range(0,H,3):
for j in range(1,W,3): ans[i][j] = a
elif W%3==1:
for i in range(1,H,3):
for j in range(0,W,3): ans[i][j] = a
else:
for i in range(1,H,3):
for j in range(1,W,3): ans[i][j] = a
for a in ans: print(''.join(map(str,a)))