Kakuro Extension HDU

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

InputThe 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; 
AAABBB— "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.OutputPrint 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 028XXX 017XXX 028XXX XXXXXXX
XXXXXXX 02222 ....... ....... ....... 010XXX
XXX34 ....... ....... ....... ....... .......
XXX14 ....... ....... 01613 ....... .......
XXX22 ....... ....... ....... ....... XXXXXXX
XXXXXXX XXX16 ....... ....... XXXXXXX XXXXXXX
5 8
XXXXXXX 001XXX 020XXX 027XXX 021XXX 028XXX 014XXX 024XXX
XXX35 ....... ....... ....... ....... ....... ....... .......
XXXXXXX 00734 ....... ....... ....... ....... ....... .......
XXX43 ....... ....... ....... ....... ....... ....... .......
XXX30 ....... ....... ....... ....... ....... ....... 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 _


题意：
给定横着的和和竖着的和，输出可行解．
思路:
将横着的限制看成一个点，竖着的限制看成一个点，白色方块在中间即可．
白块限制流量１～9,本来应该是上下界网络流，但是因为每一条的边的下界是一样的，所以通过减一处理即可转换为最大流．

#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>

#define fuck(x) cerr<<#x<<" = "<<x<<endl;
#define debug(a, x) cerr<<#a<<"["<<x<<"] = "<<a[x]<<endl;
#define ls (t<<1)
#define rs ((t<<1)|1)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int loveisblue = 486;
const int maxn = 20008;
const int maxm = 200086;
const int inf = 0x3f3f3f3f;
const ll Inf = 999999999999999999;
const int mod = 1000000007;
const double eps = 1e-6;
const double pi = acos(-1);

int Head[maxn],cnt;
struct edge{
    int Next,v,w;
}e[maxm];
void add_edge(int u,int v,int w){
//    cout<<u<<" "<<v<<" "<<w<<endl;
    e[cnt].Next=Head[u];
    e[cnt].v=v;
    e[cnt].w=w;
    Head[u]=cnt++;

    e[cnt].Next=Head[v];
    e[cnt].v=u;
    e[cnt].w=0;
    Head[v]=cnt++;
}

int D_vis[maxn],D_num[maxn];
int source,meeting;
bool bfs()
{

    memset(D_vis,0,sizeof(D_vis));
    for(int i=0;i<=meeting;i++){//注意要覆盖所有点
        D_num[i]=Head[i];
    }
    D_vis[source]=1;
    queue<int>q;
    q.push(source);
    int r=0;
    while(!q.empty()){
        int u=q.front();
        q.pop();
        int k=Head[u];
        while(k!=-1){
            if(!D_vis[e[k].v]&&e[k].w){
                D_vis[e[k].v]=D_vis[u]+1;
                q.push(e[k].v);
            }
            k=e[k].Next;
        }
    }
//    fuck(meeting)
    return D_vis[meeting];
}
int dfs(int u,int f)
{
    if(u==meeting){return f;}
    int &k=D_num[u];
    while(k!=-1){
        if(D_vis[e[k].v]==D_vis[u]+1&&e[k].w){
            int d=dfs(e[k].v,min(f,e[k].w));
            if(d>0){
                e[k].w-=d;
                e[k^1].w+=d;
                return d;
            }
        }
        k=e[k].Next;
    }
    return 0;
}
int Dinic()
{
    int ans=0;
    while(bfs()){
        int f;
        while((f=dfs(source,inf))>0){
            ans+=f;
        }
    }
    return ans;
}

char s[105][105][10];
int mp1[105][105];
int mp2[105][105];
int mph[105][105];
int mps[105][105];
int mpk[105][105];
int cal(char a,char b,char c){
    return (a-48)*100+(b-48)*10+c-48;
}

int main() {
//    ios::sync_with_stdio(false);
//    freopen("in.txt", "r", stdin);

    int n,m;
    while (scanf("%d%d",&n,&m)!=EOF){
        memset(Head,-1,sizeof(Head));
        memset(mp1,0,sizeof(mp1));
        memset(mp2,0,sizeof(mp2));
        cnt = 0;
        int cur = 0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                scanf("%s",s[i][j]);
                if(s[i][j][0]=='.'){
                    cur++;
                    mp1[i][j]=cur;
                    cur++;
                    mp2[i][j]=cur;
                    mpk[i][j]=cnt;
                    add_edge(mp1[i][j],mp2[i][j],8);
                }
            }
        }
        source = 0;
        meeting = 20000;

        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(s[i][j][0]!='.'&&s[i][j][0]!='X'){
                    cur++;
                    mps[i][j]=cur;
                    int sum = cal(s[i][j][0],s[i][j][1],s[i][j][2]);
                    for(int k=i+1;k<=n;k++){
                        if(!mp1[k][j]){ break;}
                        add_edge(cur,mp1[k][j],inf);
                        sum--;
                    }
                    add_edge(source,cur,sum);
                }if(s[i][j][0]!='.'&&s[i][j][4]!='X'){
                    cur++;
                    mph[i][j]=cur;
                    int sum = cal(s[i][j][4],s[i][j][5],s[i][j][6]);
                    for(int k=j+1;k<=m;k++){
                        if(!mp2[i][k]){ break;}
                        add_edge(mp2[i][k],cur,inf);
                        sum--;
                    }
                    add_edge(cur,meeting,sum);
                }
            }
        }
        int ans = Dinic();
//        fuck(ans)
//        fuck("????")
        for(int i=1;i<=n;i++){
            for(int j=1;j<m;j++){
                if(mp1[i][j]==0){
                    printf("_ ");
                }else{
                    printf("%d ",8-e[mpk[i][j]].w+1);
                }
            }
            if(mp1[i][m]==0){
                printf("_
");
            }else{
                printf("%d
",8-e[mpk[i][m]].w+1);
            }
        }

    }

    return 0;
}