#620123 (PyPy3) No.1398 調和の魔法陣 (構築)

• 問題: No.1398 調和の魔法陣 (構築)
• ユーザー: 👑 SPD_9X2
• 提出日時: 2021-02-19 22:41:10
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 966 ms / 3,153 ms
• コード長: 3,233 bytes
• コンパイル時間: 575 ms
• コンパイル使用メモリ: 82,176 KB
• 実行使用メモリ: 80,884 KB
• 最終ジャッジ日時: 2024-09-16 21:07:26
• 合計ジャッジ時間: 41,477 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 28

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
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)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX