|
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
119
120
121
122
123
124
125
126
127
128
129
130
|
#include <iostream>
#include <vector>
using namespace std;
typedef pair<int, int> pp;
typedef pair<pp, pp> pppp;
pppp points[9];
int map[9][9];
bool isThere[10];
vector<pp> pos;
void print()
{
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
{
cout << map[i][j] << ' ';
}
cout << '\n';
}
}
bool checkTreeThree(int x, int y)
{
int a, b;
for (int k = 0; k < 9; k++)
{
if (points[k].first.first <= x && points[k].first.second <= y && x <= points[k].second.first && y <= points[k].second.second)
{
a = points[k].first.first;
b = points[k].first.second;
break;
}
}
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < 3; j++)
{
if (a+i == x && b+j == y) continue;
if (map[a + i][b + j])
if (map[a + i][b + j] == map[x][y])
return false;
}
}
return true;
}
bool checkVert(int x, int y)
{
for (int i = 0; i < 9; i++)
{
if (i == x) continue;
if (map[i][y])
{
if (map[i][y] == map[x][y])
return false;
}
}
return true;
}
bool checkHori(int x, int y)
{
for (int i = 0; i < 9; i++)
{
if (i == y) continue;
if (map[x][i])
if (map[x][i] == map[x][y])
return false;
}
return true;
}
bool check(int idx)
{
if (checkHori(pos[idx].first, pos[idx].second) && checkVert(pos[idx].first, pos[idx].second) && checkTreeThree(pos[idx].first, pos[idx].second))
{
return true;
}
return false;
}
bool dfs(int cnt)
{
if (cnt > pos.size())
{
return true;
}
for (int k = 1; k <= 9; k++)
{
map[pos[cnt].first][pos[cnt].second] = k;
if (check(cnt))
{
if (dfs(cnt + 1))
return true;
}
map[pos[cnt].first][pos[cnt].second] = 0;
}
return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
points[0] = pppp(pp(0, 0), pp(2, 2));
points[1] = pppp(pp(0, 3), pp(2, 5));
points[2] = pppp(pp(0, 6), pp(2, 8));
points[3] = pppp(pp(3, 0), pp(5, 2));
points[4] = pppp(pp(3, 3), pp(5, 5));
points[5] = pppp(pp(3, 6), pp(5, 8));
points[6] = pppp(pp(6, 0), pp(8, 2));
points[7] = pppp(pp(6, 3), pp(8, 5));
points[8] = pppp(pp(6, 6), pp(8, 8));
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
{
cin >> map[i][j];
if (!map[i][j])
pos.push_back(pp(i, j));
}
}
dfs(0);
print();
return 0;
}
http://colorscripter.com/info#e" target="_blank" style="color:#4f4f4ftext-decoration:none">Colored by Color Scripter
|
http://colorscripter.com/info#e" target="_blank" style="text-decoration:none;color:white">cs |
BOJ/C++