結果
問題 | No.1398 調和の魔法陣 (構築) |
ユーザー | AEn |
提出日時 | 2022-05-31 17:59:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 108 ms / 3,153 ms |
コード長 | 2,488 bytes |
コンパイル時間 | 305 ms |
コンパイル使用メモリ | 82,356 KB |
実行使用メモリ | 82,432 KB |
最終ジャッジ日時 | 2024-09-21 01:23:43 |
合計ジャッジ時間 | 27,205 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
52,992 KB |
testcase_01 | AC | 37 ms
52,352 KB |
testcase_02 | AC | 39 ms
52,948 KB |
testcase_03 | AC | 37 ms
52,736 KB |
testcase_04 | AC | 38 ms
52,736 KB |
testcase_05 | AC | 39 ms
52,864 KB |
testcase_06 | AC | 103 ms
82,060 KB |
testcase_07 | AC | 40 ms
55,680 KB |
testcase_08 | AC | 104 ms
82,432 KB |
testcase_09 | AC | 107 ms
81,760 KB |
testcase_10 | AC | 40 ms
55,936 KB |
testcase_11 | AC | 100 ms
81,760 KB |
testcase_12 | AC | 40 ms
55,808 KB |
testcase_13 | AC | 104 ms
81,548 KB |
testcase_14 | AC | 103 ms
81,976 KB |
testcase_15 | AC | 39 ms
55,424 KB |
testcase_16 | AC | 101 ms
82,252 KB |
testcase_17 | AC | 108 ms
82,164 KB |
testcase_18 | AC | 103 ms
82,148 KB |
testcase_19 | AC | 103 ms
82,016 KB |
testcase_20 | AC | 40 ms
55,808 KB |
testcase_21 | AC | 107 ms
82,024 KB |
testcase_22 | AC | 106 ms
82,152 KB |
testcase_23 | AC | 40 ms
55,808 KB |
testcase_24 | AC | 99 ms
81,716 KB |
testcase_25 | AC | 41 ms
55,424 KB |
testcase_26 | AC | 104 ms
82,064 KB |
testcase_27 | AC | 106 ms
82,356 KB |
testcase_28 | AC | 42 ms
55,680 KB |
testcase_29 | AC | 98 ms
81,784 KB |
testcase_30 | AC | 40 ms
55,424 KB |
ソースコード
W, H, X = map(int, input().split()) ans = [[0]*(W) for _ in range(H)] x1 = [1, 1, 0, -1, -1, -1, 0, 1, 0] y1 = [0, 1, 1, 1, 0, -1, -1, -1, 0] def debag(X): for x in range(H): for y in range(W): sm = 0 for px, py in zip(x1, y1): cx = x+px; cy = y+py if 0<=cx<H and 0<=cy<W: sm += ans[cx][cy] if sm != X: print(x, y) return False return True XX = X if X > 36: print(-1) elif H==W==1: if X > 9: print(-1) else: print(X) elif W == 1: if X > 9*W*2: print(-1) else: res = [min(X, 9), X-min(X, 9), 0] for i in range(H): print(res[i%3]) elif H == 1: if X > 9*H*2: print(-1) else: res = [min(X, 9), X-min(X,9), 0] for i in range(W): if i < W-1: print(res[i%3], end = '') else: print(res[i%3]) else: x = [] sm, cnt = 0, 0 for i in range(4): x.append(min(9, X-sm)) cnt += (x[-1]>0) sm += x[-1] h, w = H%3, W%3 if h == 0 and w == 0 and cnt == 1: for i in range(H): for j in range(W): if i%3 == 1 and j%3 == 1: ans[i][j] = x[0] print(*ans[i], sep='') elif ((h==1 and w==0) or (h==1 and w==1) or (h==0 and w==1)) and cnt <= 1: for i in range(H): for j in range(W): if (i+h)%3 == 1 and (j+w)%3 == 1: ans[i][j] = x[0] print(*ans[i], sep='') elif ((h==2 and w==0) or (h==2 and w==1) or (h==1 and w==2) or (h==0 and w==2)) and cnt <= 2: for i in range(H): for j in range(W): if w == 2: if (i+h)%3 == 1 and j%3 == 0: ans[i][j] = x[0] if (i+h)%3 == 1 and j%3 == 1: ans[i][j] = x[1] if h == 2: if i%3 == 0 and (j+w)%3 == 1: ans[i][j] = x[0] if i%3 == 1 and (j+w)%3 == 1: ans[i][j] = x[1] print(*ans[i], sep='') elif h*w == 4: x += [0, 0, 0] for i in range(H): for j in range(W): if i%3 <= 1 and j%3 <= 1: ans[i][j] = x[2*(i%3) + j%3] print(*ans[i], sep='') else: print(-1) # print(debag(XX))