HDU3338 Kakuro Extension —— 最大流、方格填数类似数独

题目链接：https://vjudge.net/problem/HDU-3338

Kakuro Extension

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2419    Accepted Submission(s): 840
Special Judge

Problem Description

If you solved problem like this, forget it.Because you need to use a completely different algorithm to solve the following one.
Kakuro puzzle is played on a grid of "black" and "white" cells. Apart from the top row and leftmost column which are entirely black, the grid has some amount of white cells which form "runs" and some amount of black cells. "Run" is a vertical or horizontal maximal one-lined block of adjacent white cells. Each row and column of the puzzle can contain more than one "run". Every white cell belongs to exactly two runs — one horizontal and one vertical run. Each horizontal "run" always has a number in the black half-cell to its immediate left, and each vertical "run" always has a number in the black half-cell immediately above it. These numbers are located in "black" cells and are called "clues".The rules of the puzzle are simple:

1.place a single digit from 1 to 9 in each "white" cell
2.for all runs, the sum of all digits in a "run" must match the clue associated with the "run"

Given the grid, your task is to find a solution for the puzzle.
　　　　　　　　 　　　　　
　　　　　　　　Picture of the first sample input　　　　　　　　　　　　Picture of the first sample output

 

Input

The first line of input contains two integers n and m (2 ≤ n,m ≤ 100) — the number of rows and columns correspondingly. Each of the next n lines contains descriptions of m cells. Each cell description is one of the following 7-character strings:

.......— "white" cell;
XXXXXXX— "black" cell with no clues;
AAA\BBB— "black" cell with one or two clues. AAA is either a 3-digit clue for the corresponding vertical run, or XXX if there is no associated vertical run. BBB is either a 3-digit clue for the corresponding horizontal run, or XXX if there is no associated horizontal run.
The first row and the first column of the grid will never have any white cells. The given grid will have at least one "white" cell.It is guaranteed that the given puzzle has at least one solution.

 

Output

Print n lines to the output with m cells in each line. For every "black" cell print '_' (underscore), for every "white" cell print the corresponding digit from the solution. Delimit cells with a single space, so that each row consists of 2m-1 characters.If there are many solutions, you may output any of them.

 

Sample Input

6 6
XXXXXXX XXXXXXX 028\XXX 017\XXX 028\XXX XXXXXXX
XXXXXXX 022\022 ....... ....... ....... 010\XXX
XXX\034 ....... ....... ....... ....... .......
XXX\014 ....... ....... 016\013 ....... .......
XXX\022 ....... ....... ....... ....... XXXXXXX
XXXXXXX XXX\016 ....... ....... XXXXXXX XXXXXXX
5 8
XXXXXXX 001\XXX 020\XXX 027\XXX 021\XXX 028\XXX 014\XXX 024\XXX
XXX\035 ....... ....... ....... ....... ....... ....... .......
XXXXXXX 007\034 ....... ....... ....... ....... ....... .......
XXX\043 ....... ....... ....... ....... ....... ....... .......
XXX\030 ....... ....... ....... ....... ....... ....... XXXXXXX

 

Sample Output

_ _ _ _ _ _
_ _ 5 8 9 _
_ 7 6 9 8 4
_ 6 8 _ 7 6
_ 9 2 7 4 _
_ _ 7 9 _ _
_ _ _ _ _ _ _ _
_ 1 9 9 1 1 8 6
_ _ 1 7 7 9 1 9
_ 1 3 9 9 9 3 9
_ 6 7 2 4 9 2 _

 

Author

NotOnlySuccess@HDU

 

Source

HDOJ Monthly Contest – 2010.03.06

题意：

给定一个n*m的矩阵，为其中的白格填上范围为1~9的数，并且满足横之和、纵之和的限制，限制记录在黑格子上。类似于数独游戏，要求输出一组可行解。

题解：

可知横之和的和必定等于纵之和的和，因为横之和的和是所有白格子的和， so does 纵之和的和。因此，我们可以用网络流来解题，建图如下：

1.先对行进行分块，然后再对列进行分块，因为同一行或同一列不一定属于同一个run。

2.建立超级源点，超级源点连向每一个横之和结点，容量为横之和。

3.对于每个白格，将其横坐标所属的横之和结点连向其纵坐标所属的纵之和结点，容量下界为1，容量上界为9。

4.建立超级汇点，每个纵之和结点连向超级汇点，容量为纵之和。

5.回顾上述建图方法，发现白格建的边容量下界（一般情况都是没有下界的，即为0），不好处理。但是可以知道容量下界都为1，那么，我们可以先为每个白格子都分一个1，表明这个1是必须的，毋庸置疑。因此，就可以去掉白格子所建的边的容量下界了，而容量上界也因此改为8.

6.由于“横之和的和=纵之和的和”，“横之和的和”的流量由超级源点发出，“纵之和的和”的流量由超级汇点接收，且可知如果有解，那么白格子的存在（调节）必定能使每条：超级汇点-->“横之和”结点 的边满流，而满流时必定是最大流。因此我们可以跑最大流算法，然后再提取每条白格子所建边的流量信息，即可知道每个白格子应该填上什么数。

写法一：

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <vector>
 #include <cmath>
 #include <queue>
 #include <stack>
 #include <map>
 #include <string>
 #include <set>
 using namespace std;
 typedef long long LL;
 const int INF = 2e9;
 const LL LNF = 9e18;
 const int mod = 1e9+;
 const int MAXM = 1e5+;
 const int MAXN = 1e4+;

 struct Edge
 {
     int to, next, cap, flow;
 }edge[MAXM];
 int tot, head[MAXN];
 int gap[MAXN], dep[MAXN], pre[MAXN], cur[MAXN];

 void init()
 {
     tot = ;
     memset(head, -, sizeof(head));
 }

 void add(int u, int v, int w)
 {
     edge[tot].to = v; edge[tot].cap = w; edge[tot].flow = ;
     edge[tot].next = head[u]; head[u] = tot++;
     edge[tot].to = u; edge[tot].cap = ; edge[tot].flow = ;
     edge[tot].next = head[v]; head[v] = tot++;
 }

 int sap(int start, int end, int nodenum)
 {
     memset(dep, , sizeof(dep));
     memset(gap, , sizeof(gap));
     memcpy(cur, head, sizeof(head));
     int u = pre[start] = start, maxflow = ,aug = INF;
     gap[] = nodenum;
     while(dep[start]<nodenum)
     {
         loop:
         for(int i = cur[u]; i!=-; i = edge[i].next)
         {
             int v = edge[i].to;
             if(edge[i].cap-edge[i].flow && dep[u]==dep[v]+)
             {
                 aug = min(aug, edge[i].cap-edge[i].flow);
                 pre[v] = u;
                 cur[u] = i;
                 u = v;
                 if(v==end)
                 {
                     maxflow += aug;
                     for(u = pre[u]; v!=start; v = u,u = pre[u])
                     {
                         edge[cur[u]].flow += aug;
                         edge[cur[u]^].flow -= aug;
                     }
                     aug = INF;
                 }
                 goto loop;
             }
         }
         int mindis = nodenum;
         for(int i = head[u]; i!=-; i = edge[i].next)
         {
             int v=edge[i].to;
             if(edge[i].cap-edge[i].flow && mindis>dep[v])
             {
                 cur[u] = i;
                 mindis = dep[v];
             }
         }
         if((--gap[dep[u]])==)break;
         gap[dep[u]=mindis+]++;
         u = pre[u];
     }
     return maxflow;
 }

 char str[];
 int Map[][], run[][][];    //用于记录原始图案
 int xid[][], yid[][];
 int xrun[], yrun[], index[][];
 int main()
 {
     int n, m;
     while(scanf("%d%d", &n,&m)!=EOF)
     {
         for(int i = ; i<=n; i++)
         for(int j = ; j<=m; j++)
         {
             scanf("%s", str);
             if(str[]=='.') Map[i][j] = ;
             else
             {
                 Map[i][j] = ;
                 if(str[]!='X') run[i][j][] = (str[]-'')*+(str[]-'')*+(str[]-'');
                 if(str[]!='X') run[i][j][] = (str[]-'')*+(str[]-'')*+(str[]-'');
             }
         }

         int xcnt = , ycnt = ;
         for(int i = ; i<=n; i++)
         for(int j = ; j<=m; j++)
         {
             if(Map[i][j])
             {
                 if(!Map[i][j-])    //横流
                 {
                     xid[i][j] = xcnt;
                     xrun[xcnt++] = run[i][j-][];
                 }else xid[i][j] = xid[i][j-];
                 xrun[xid[i][j]]--;

                 if(!Map[i-][j])    //纵流
                 {
                     yid[i][j] = ycnt;
                     yrun[ycnt++] = run[i-][j][];
                 }else yid[i][j] = yid[i-][j];
                 yrun[yid[i][j]]--;
             }
         }

         int start = xcnt+ycnt, end = xcnt+ycnt+;
         init();
         for(int i = ; i<=n; i++)
         for(int j = ; j<=m; j++)
         {
             if(Map[i][j])
             {
                 add(xid[i][j], xcnt+yid[i][j], );
                 index[i][j] = tot-;    //记录这个空格所对应的边
             }
         }
         for(int i = ; i<xcnt; i++) add(start, i, xrun[i]);
         for(int i = ; i<ycnt; i++) add(xcnt+i, end, yrun[i]);

         sap(start, end, xcnt+ycnt+);
         for(int i = ; i<=n; i++)
         {
             for(int j = ; j<=m; j++)
             {
                 printf("%c", Map[i][j]?(edge[index[i][j]].flow+''):'_');
                 if(j<m) printf(" ");
             }
             printf("\n");
         }
     }
 }

写法二：

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <vector>
 #include <cmath>
 #include <queue>
 #include <stack>
 #include <map>
 #include <string>
 #include <set>
 using namespace std;
 typedef long long LL;
 const int INF = 2e9;
 const LL LNF = 9e18;
 const int mod = 1e9+;
 const int MAXM = 1e5+;
 const int MAXN = 1e4+;

 struct Edge
 {
     int to, next, cap, flow;
 }edge[MAXM];
 int tot, head[MAXN];
 int gap[MAXN], dep[MAXN], pre[MAXN], cur[MAXN];

 void init()
 {
     tot = ;
     memset(head, -, sizeof(head));
 }

 void add(int u, int v, int w)
 {
     edge[tot].to = v; edge[tot].cap = w; edge[tot].flow = ;
     edge[tot].next = head[u]; head[u] = tot++;
     edge[tot].to = u; edge[tot].cap = ; edge[tot].flow = ;
     edge[tot].next = head[v]; head[v] = tot++;
 }

 int sap(int start, int end, int nodenum)
 {
     memset(dep, , sizeof(dep));
     memset(gap, , sizeof(gap));
     memcpy(cur, head, sizeof(head));
     int u = pre[start] = start, maxflow = ,aug = INF;
     gap[] = nodenum;
     while(dep[start]<nodenum)
     {
         loop:
         for(int i = cur[u]; i!=-; i = edge[i].next)
         {
             int v = edge[i].to;
             if(edge[i].cap-edge[i].flow && dep[u]==dep[v]+)
             {
                 aug = min(aug, edge[i].cap-edge[i].flow);
                 pre[v] = u;
                 cur[u] = i;
                 u = v;
                 if(v==end)
                 {
                     maxflow += aug;
                     for(u = pre[u]; v!=start; v = u,u = pre[u])
                     {
                         edge[cur[u]].flow += aug;
                         edge[cur[u]^].flow -= aug;
                     }
                     aug = INF;
                 }
                 goto loop;
             }
         }
         int mindis = nodenum;
         for(int i = head[u]; i!=-; i = edge[i].next)
         {
             int v=edge[i].to;
             if(edge[i].cap-edge[i].flow && mindis>dep[v])
             {
                 cur[u] = i;
                 mindis = dep[v];
             }
         }
         if((--gap[dep[u]])==)break;
         gap[dep[u]=mindis+]++;
         u = pre[u];
     }
     return maxflow;
 }

 char str[];
 int Map[][], run[][][];
 int xid[][], yid[][];
 int xbelong[], ybelong[], xrun[], yrun[];
 int result[][];
 int main()
 {
     int n, m;
     while(scanf("%d%d", &n,&m)!=EOF)
     {
         for(int i = ; i<=n; i++)
         for(int j = ; j<=m; j++)
         {
             scanf("%s", str);
             if(str[]=='.') Map[i][j] = ;
             else
             {
                 Map[i][j] = ;
                 if(str[]!='X') run[i][j][] = (str[]-'')*+(str[]-'')*+(str[]-'');
                 if(str[]!='X') run[i][j][] = (str[]-'')*+(str[]-'')*+(str[]-'');
             }
         }

         int xcnt = , ycnt = ;
         for(int i = ; i<=n; i++)
         for(int j = ; j<=m; j++)
         {
             if(Map[i][j])
             {
                 if(!Map[i][j-])
                 {
                     xid[i][j] = xcnt;
                     xrun[xcnt] = run[i][j-][];
                     xbelong[xcnt++] = i;
                 }else xid[i][j] = xid[i][j-];
                 xrun[xid[i][j]]--;

                 if(!Map[i-][j])
                 {
                     yid[i][j] = ycnt;
                     yrun[ycnt] = run[i-][j][];
                     ybelong[ycnt++] = j;
                 }else yid[i][j] = yid[i-][j];
                 yrun[yid[i][j]]--;
             }
         }

         int start = xcnt+ycnt, end = xcnt+ycnt+;
         init();
         for(int i = ; i<=n; i++)
         for(int j = ; j<=m; j++)
         {
             if(Map[i][j])
                 add(xid[i][j], xcnt+yid[i][j], );
         }
         for(int i = ; i<xcnt; i++) add(start, i, xrun[i]);
         for(int i = ; i<ycnt; i++) add(xcnt+i, end, yrun[i]);

         sap(start, end, xcnt+ycnt+);
         memset(result, , sizeof(result));

         for(int u = ; u<xcnt; u++)
         for(int i = head[u]; i!=-; i=edge[i].next)
         {
             int v = edge[i].to-xcnt;
             if(v>=ycnt) continue;
             int x = xbelong[u], y = ybelong[v];
             if(Map[x][y]) result[x][y] = edge[i].flow+;
         }

         for(int i = ; i<=n; i++)
         {
             for(int j = ; j<=m; j++)
             {
                 if(Map[i][j]) printf("%d", result[i][j]);
                 else  printf("_");
                 if(j<m) printf(" ");
             }
             printf("\n");
         }
     }
 }