結果

問題 No.1398 調和の魔法陣 (構築)
ユーザー 👑 SPD_9X2SPD_9X2
提出日時 2021-02-19 22:41:10
言語 PyPy3
(7.3.13)
結果
AC  
実行時間 911 ms / 3,153 ms
コード長 3,233 bytes
コンパイル時間 445 ms
コンパイル使用メモリ 87,108 KB
実行使用メモリ 81,956 KB
最終ジャッジ日時 2023-10-15 03:35:40
合計ジャッジ時間 38,598 ms
ジャッジサーバーID
(参考情報)
judge15 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 72 ms
71,472 KB
testcase_01 AC 72 ms
71,432 KB
testcase_02 AC 91 ms
75,696 KB
testcase_03 AC 69 ms
71,528 KB
testcase_04 AC 72 ms
71,196 KB
testcase_05 AC 69 ms
71,292 KB
testcase_06 AC 638 ms
81,200 KB
testcase_07 AC 527 ms
80,712 KB
testcase_08 AC 631 ms
80,972 KB
testcase_09 AC 595 ms
80,956 KB
testcase_10 AC 511 ms
80,588 KB
testcase_11 AC 629 ms
81,000 KB
testcase_12 AC 523 ms
80,752 KB
testcase_13 AC 878 ms
81,564 KB
testcase_14 AC 543 ms
80,872 KB
testcase_15 AC 900 ms
81,256 KB
testcase_16 AC 243 ms
80,356 KB
testcase_17 AC 539 ms
80,956 KB
testcase_18 AC 376 ms
80,768 KB
testcase_19 AC 547 ms
81,076 KB
testcase_20 AC 457 ms
80,228 KB
testcase_21 AC 241 ms
80,084 KB
testcase_22 AC 573 ms
81,956 KB
testcase_23 AC 911 ms
80,920 KB
testcase_24 AC 628 ms
81,524 KB
testcase_25 AC 518 ms
81,004 KB
testcase_26 AC 238 ms
80,360 KB
testcase_27 AC 619 ms
81,516 KB
testcase_28 AC 507 ms
80,728 KB
testcase_29 AC 237 ms
80,372 KB
testcase_30 AC 519 ms
80,660 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import sys
def sol(ans):
    for i in range(H):
        for j in range(W):

            now = 0
            for x in range(i-1,i+2):
                for y in range(j-1,j+2):
                    if 0 <= x < H and 0 <= y < W:
                        now += ans[x][y]
            if now != X:
                return False
    for i in ans:
        print ("".join(map(str,i)))
    sys.exit()

def sol2(ans):

    #print (ans,X,A,B,C,D)
    for i in (0,H-1):
        for j in (0,W-1):

            now = 0
            for x in range(i-1,i+2):
                for y in range(j-1,j+2):
                    if 0 <= x < H and 0 <= y < W:
                        now += ans[x][y]
            if now != X:
                return False

    return True

W,H,X = map(int,input().split())
ans = [[0] * W for i in range(H)]

# type1
for A in range(10):
    for i in range(H):
        for j in range(W):
            if i % 3 == 1:
                ans[i][j] = A
            else:
                ans[i][j] = 0
    sol(ans)

for A in range(10):
    for i in range(H):
        for j in range(W):
            if j % 3 == 1:
                ans[i][j] = A
            else:
                ans[i][j] = 0
    sol(ans)

#type3
for A in range(10):
    for i in range(H):
        for j in range(W):
            if i % 3 == j % 3 == 1:
                ans[i][j] = A
            else:
                ans[i][j] = 0
    sol(ans)

#type2
for A in range(10):
    for B in range(10):
        for i in range(H):
            for j in range(W):
                if i % 3 == 2 or j % 3 == 2:
                    ans[i][j] = 0
                elif i % 3 == j % 3:
                    ans[i][j] = A
                else:
                    ans[i][j] = B
        sol(ans)

print ("4",file=sys.stderr)
#type4
cnt = 0
for D in range(10):
    for C in range(10):
        for B in range(10):
            for A in range(10):

                if A+B+C+D == X:

                    for i in (0,1,H-2,H-1):
                        for j in (0,1,W-2,W-1):
                            if i % 3 == 2 or j % 3 == 2:
                                ans[i][j] = 0
                            elif i % 3 == j % 3 == 0:
                                ans[i][j] = A
                            elif i % 3 == 0 and j % 3 == 1:
                                ans[i][j] = B
                            elif i % 3 == 1 and j % 3 == 0:
                                ans[i][j] = C
                            else:
                                ans[i][j] = D

                    if not sol2(ans):
                        continue
                    
                    for i in range(H):
                        for j in range(W):
                            if i % 3 == 2 or j % 3 == 2:
                                ans[i][j] = 0
                            elif i % 3 == j % 3 == 0:
                                ans[i][j] = A
                            elif i % 3 == 0 and j % 3 == 1:
                                ans[i][j] = B
                            elif i % 3 == 1 and j % 3 == 0:
                                ans[i][j] = C
                            else:
                                ans[i][j] = D
                    sol(ans)
                    
print (-1)
0