Codeforces GYM 100503B: Kakuro 题解

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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <utility>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <queue>
#include <deque>
#include <sstream>
#include <bitset>
#include <ctime>
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define LL long long
#define ld long double
#define Pair pair<int,int>
#define LOWBIT(x) x & (-x)
using namespace std;
const int INF=0x7ffffff;
const int MOD=1e9+7;
const int magic=348;
struct node
{
int type;
int down,right;
}a[10][10];
bool f=false;
int n,m;
inline int getInd(int x,int y)
{
return (x-1)*m+y;
}
inline Pair getnum(int id)
{
int x=id%m==0?id/m:id/m+1;
int y=id-x*m;
return mp(x,y);
}
int cc=0;
Pair seq[4800];
int psum_l[2000],psum_s[2000];
Pair rc[1000];
int sum[1000],cnt[1000];
Pair bel[1000];
int ans[10][10];
bool can[10][1100][60];
int canMask[10][1100][60];
map<pair<int,bool>,int> ID;int top=0;
inline int getID(pair<int,bool> x)
{
if (ID[x]) return ID[x];
ID[x]=++top;
return top;
}
int used[2000];
void dfs(int nn)
{
if (nn==cc+1)
{
f=true;
return;
}
int x=seq[nn].x,y=seq[nn].y;
int i,j,dd;
vector<int> can_use;
int xx=bel[getInd(x,y)].x,yy=bel[getInd(x,y)].y;
int can=canMask[cnt[xx]][used[xx]][sum[xx]]&canMask[cnt[yy]][used[yy]][sum[yy]];
for (i=1;i<=9;i++)
{
if (!(can&(1<<(i-1)))) continue;
dd=i;
ans[x][y]=dd;
cnt[xx]--;cnt[yy]--;
used[xx]^=(1<<(dd-1));used[yy]^=(1<<(dd-1));
dfs(nn+1);
if (f) return;
cnt[xx]++;cnt[yy]++;
used[xx]^=(1<<(dd-1));used[yy]^=(1<<(dd-1));
}
}
void init()
{
int i,j,k,u;
int s;
for (j=0;j<=(1<<9)-1;j++)
for (k=0;k<=60;k++)
{
s=0;
for (u=1;u<=9;u++)
if (j&(1<<(u-1))) s+=u;
if (s==k) can[0][j][k]=true; else can[0][j][k]=false;
}
for (i=1;i<=6;i++)
for (j=0;j<=(1<<9)-1;j++)
for (k=0;k<=60;k++)
for (u=1;u<=9;u++)
if ((j&(1<<(u-1)))==0 && can[i-1][j|(1<<(u-1))][k])
{
can[i][j][k]=true;
canMask[i][j][k]=(canMask[i][j][k]|(1<<(u-1)));
}
}
int main ()
{
freopen ("input.txt","r",stdin);
freopen ("output.txt","w",stdout);
int i,j,k,num;string s;
cin>>n>>m;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
{
cin>>s;
if (s=="XXXXX") a[i][j].type=1;
if (s==".....") a[i][j].type=2;
if (s[2]=='\' )
{
a[i][j].type=3;
if (s[0]=='X')
a[i][j].down=-1;
else
{
stringstream ss(s.substr(0,2));
ss>>a[i][j].down;
}
if (s[3]=='X')
a[i][j].right=-1;
else
{
stringstream ss(s.substr(3,2));
ss>>a[i][j].right;
}
}
}
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
{
if (a[i][j].type!=3) continue;
if (a[i][j].down!=-1)
{
num=getID(mp(getInd(i,j),false));
rc[num]=mp(getInd(i,j),false);
sum[num]=a[i][j].down;cnt[num]=0;
for (k=i+1;k<=n && a[k][j].type==2;k++)
{
bel[getInd(k,j)].x=num;
cnt[num]++;
}
}
if (a[i][j].right!=-1)
{
num=getID(mp(getInd(i,j),true));
rc[num]=mp(getInd(i,j),true);
sum[num]=a[i][j].right;
for (k=j+1;k<=m && a[i][k].type==2;k++)
{
bel[getInd(i,k)].y=num;
cnt[num]++;
}
}
}
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
if (a[i][j].type==2)
seq[++cc]=mp(i,j);
init();
dfs(1);
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
{
if (a[i][j].type==2) cout<<ans[i][j]; else cout<<"_";
if (j==m) cout<<'n'; else cout<<' ';
}
return 0;
}