結果
問題 | No.1398 調和の魔法陣 (構築) |
ユーザー | wolgnik |
提出日時 | 2021-02-19 22:17:39 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,751 bytes |
コンパイル時間 | 1,692 ms |
コンパイル使用メモリ | 87,024 KB |
実行使用メモリ | 80,544 KB |
最終ジャッジ日時 | 2023-10-15 02:25:42 |
合計ジャッジ時間 | 27,322 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
71,264 KB |
testcase_01 | AC | 70 ms
71,296 KB |
testcase_02 | AC | 71 ms
71,296 KB |
testcase_03 | AC | 74 ms
71,244 KB |
testcase_04 | AC | 73 ms
71,388 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 73 ms
71,132 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 71 ms
71,188 KB |
testcase_11 | WA | - |
testcase_12 | AC | 73 ms
71,104 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 71 ms
71,244 KB |
testcase_16 | AC | 159 ms
80,516 KB |
testcase_17 | AC | 158 ms
80,428 KB |
testcase_18 | AC | 162 ms
80,396 KB |
testcase_19 | AC | 161 ms
80,544 KB |
testcase_20 | AC | 74 ms
71,412 KB |
testcase_21 | AC | 166 ms
80,056 KB |
testcase_22 | WA | - |
testcase_23 | AC | 70 ms
71,296 KB |
testcase_24 | WA | - |
testcase_25 | AC | 72 ms
71,168 KB |
testcase_26 | AC | 163 ms
80,076 KB |
testcase_27 | WA | - |
testcase_28 | AC | 72 ms
71,308 KB |
testcase_29 | AC | 161 ms
79,964 KB |
testcase_30 | AC | 69 ms
71,248 KB |
ソースコード
import sys input = sys.stdin.readline W, H, X = map(int, input().split()) res = [[0] * W for _ in range(H)] if (H % 3) <= 1 or (W % 3) <= 1: if H >= 3 and W >= 3: if X > 9: print(-1) exit(0) for i in range(H): for j in range(W): if i % 3 == 1 and j % 3 == 1: res[i][j] = X elif H <= 2: if H == 1 and X > 9: print(-1) exit(0) if X > 18: print(-1) exit(0) u = min(9, X) d = max(0, X - u) for j in range(W): if j % 3 == 0: res[0][j] = u if H > 1: res[1][j] = d elif W <= 2: if W == 1 and W > 9: print(-1) exit(0) if X > 18: print(-1) exit(0) u = min(9, X) d = max(0, X - u) for i in range(H): if i % 3 == 0: res[i][0] = u if W > 1: res[i][1] = d else: if H >= 2 and W >= 2: if X > 36: print(-1) exit(0) unit = [[0, 0, 0], [0, 0, 0], [0, 0, 0]] x = X for i in range(2): for j in range(2): unit[i][j] = min(9, x) x -= unit[i][j] for i in range(H): for j in range(W): res[i][j] = unit[i % 3][j % 3] elif H == 1: unit = [0] * 3 x = X for i in range(2): unit[i] = min(9, x) x -= unit[i] for i in range(W): res[0][i] = unit[i % 3] elif W == 1: unit = [0] * 3 x = X for i in range(2): unit[i] = min(9, x) x -= unit[i] for i in range(H): res[i][0] = unit[i % 3] #for i in range(H): print(*res[i]) for i in range(H): for j in range(W): t = 0 for u in range(max(0, i - 1), min(H, i + 2)): for v in range(max(0, j - 1), min(W, j + 2)): t += res[u][v] if t != X: print(-1) exit(0) for i in range(H): print("".join(list(map(str, res[i]))))