网络流拆点upc

http://acm.upc.edu.cn/problem.php?cid=1051&pid=47

题意：问最多可以有多少个WIN

思路：要把I拆成两个点，然后就是最大流

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
const int maxn=3610;
const int INF=1000000000;
char grid[maxn][maxn];
struct node
{
    int v,next,f;
}edge[maxn*8];

int pre[maxn],cur[maxn],h[maxn],gap[maxn],dis[maxn];
int N,M,n,m,num;
int k=0,nn;

void add_edge(int x,int y,int f)
{
    edge[k].v=y;
    edge[k].next=h[x];
    edge[k].f=f;
    h[x]=k++;
    edge[k].v=x;
    edge[k].next=h[y];
    edge[k].f=0;
    h[y]=k++;
}

int sap(int s,int t)
{
    for(int i=0;i<=nn;i++)
    {
        cur[i]=h[i];
        gap[i]=dis[i]=0;
    }
    int u;
    int flow=0,aug=INF;
    gap[s]=nn;
    u=pre[s]=s;
    bool flag;
    while(dis[s]<nn)
    {
        flag=0;
        for(int &j=cur[u];j!=-1;j=edge[j].next)
        {
            int v=edge[j].v;
            if(edge[j].f>0&&dis[u]==dis[v]+1)
            {
                flag=1;
                if(edge[j].f<aug)
                    aug=edge[j].f;
                pre[v]=u;
                u=v;
                if(u==t)
                {
                    flow+=aug;
                    while(u!=s)
                    {
                        u=pre[u];
                        edge[cur[u]].f-=aug;
                        edge[cur[u]^1].f+=aug;
                    }
                    aug=INF;
                }
                break;
            }

        }
        if(flag)
            continue;
        int mindis=nn;
        for(int j=h[u];j!=-1;j=edge[j].next)
        {
            int v=edge[j].v;
            if(dis[v]<mindis&&edge[j].f>0)
            {
                mindis=dis[v];
                cur[u]=j;
            }
        }
        if((--gap[dis[u]])==0)
            break;
        gap[dis[u]=mindis+1]++;
        u=pre[u];
    }
    return flow;
}
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
void process(int x,int y,char p,int sum)
{
    for(int i=0;i<4;i++)
    {
        int tx=x+dx[i];
        int ty=y+dy[i];
        if(tx>=0&&tx<n&&ty>=0&&ty<m&&grid[tx][ty]==p)
            add_edge(sum,tx*m+ty+1,1);
    }
}

int main()
{
    while(gets(grid[0])!=NULL)
    {
        n=1;
        while(gets(grid[n]))
        {
           if(grid[n][0]==0)break;
            else {n++;}
        }
        m=strlen(grid[0]);
        int s=0,t;
        memset(h,-1,sizeof(h));
        k=0;
        num=n*m+1;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(grid[i][j]=='W')
                {
                    add_edge(s,i*m+j+1,1);
                    process(i,j,'I',i*m+j+1);
                }
                if(grid[i][j]=='I')
                {
                    add_edge(i*m+j+1,num,1);
                    process(i,j,'N',num);
                    num++;
                }
            }
        }
        t=num;nn=t+1;
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
            if(grid[i][j]=='N')
            add_edge(i*m+j+1,t,1);
        cout<<sap(s,t)<<endl;
    }
    return 0;
}