[POJ1273][USACO4.2]Drainage Ditches (网络流最大流)

题意

网络流最大流模板

思路

EK也不会超时

所以说是一个数据比较水的模板题

但是POJ有点坑，多组数据，而且题目没给

哭得我AC率直掉

代码

用的朴素Dinic

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
#define N 200010
#define INF 0x3fffffff
inline int read() {
    int x = ,f = ;
    char ch = getchar();
    while(ch<''||ch>'') { if(ch=='-') f = -; ch = getchar(); }
    while(ch>=''&&ch<='') {x=(x<<)+(x<<)+(ch^);ch=getchar();}
    return x * f;
}
struct point{
    int fr,to,val;
    int nxt;
}edge[N];
int head[N];
int cnt;
void add_edge(int x,int y,int z)
{
    edge[cnt].fr=x,edge[cnt].to=y,edge[cnt].val=z;
    edge[cnt].nxt=head[x],head[x]=cnt++;
    edge[cnt].fr=y,edge[cnt].to=x,edge[cnt].val=;
    edge[cnt].nxt=head[y],head[y]=cnt++;
}
//我放弃链式前向星
int n,m,st,ed;
int deep[N];
int BFS()
{
    queue<int>q;
    memset(deep,,sizeof(deep));
    q.push(st);
    deep[st]=;
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        for(int i=head[u];i!=-;i=edge[i].nxt)
        {
            int tmp=edge[i].to;
            if(edge[i].val<= || deep[tmp]) continue;
            deep[tmp]=deep[u]+;
            q.push(tmp);
        }
    }
    return deep[ed];
}
int ans;
int dfs(int u,int flow)//flow为到达终点最多能增广的值
{
    if(u==ed) return flow;
    int add=;
    for(int i=head[u];i!=-&&add<flow;i=edge[i].nxt)
    {
        int v=edge[i].to;
        if(deep[v]!=deep[u]+) continue;
        if(!edge[i].val) continue;//剪枝
        int tmpadd=dfs(v,min(edge[i].val,flow-add));
        edge[i].val-=tmpadd;
        edge[i^].val+=tmpadd;//sub
        add+=tmpadd;
    }
    return add;
}
void Dinic()
{
    while(BFS()) ans+=dfs(st,INF);
}
int main()
{
    while(scanf("%d%d",&n,&m)==)
    {
        ans=;
        st=,ed=m;
        memset(edge,,sizeof(edge));
        memset(head,-,sizeof(head));
        for(int i=,u,v,co;i<=n;i++)
        {
            u=read(),v=read(),co=read();
            add_edge(u,v,co);
        }
        Dinic();
        printf("%d\n",ans);
    }
    return ;
}