HDU6214 Smallest Minimum Cut

题目链接：HDU6214

留一个链式前向星+Dinic模板（希望不要被某人发现，嘿嘿嘿）。

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <vector>
 #include <queue>
 using namespace std;
 #define next Next
 const int inf = 0x3f3f3f3f;
 const int maxn=;
 int level[maxn];
 int iter[maxn];
 int head[maxn],tot;
 struct edge{
     int to,cap,Next;
 } e[]; ///此处应为边的两倍，加一条容量为0的反向边
 void init(){
     memset(head,-,sizeof(head));
     tot=;
 }
 void add(int from,int to,int cap){
     e[tot].Next=head[from];
     e[tot].to=to;
     e[tot].cap=cap;
     head[from]=tot;
     tot++;
 }
 void addedge(int from,int to,int cap){
     add(from,to,cap);
     add(to,from,);
 }
 void bfs(int s){
     memset(level,-,sizeof(level));
     queue<int> q;
     level[s]=;
     q.push(s);
     while(!q.empty()){
         int v=q.front(); q.pop();
         for(int i=head[v];~i;i=e[i].Next){
             edge &ed=e[i];
             if(ed.cap>&&level[ed.to]<){
                 level[ed.to]=level[v]+;
                 q.push(ed.to);
             }
         }
     }
 }
 int dfs(int v,int t,int f){
     if(v==t) return f;
     for(int &i=iter[v];~i;i=e[i].Next){
         edge &ed=e[i];
         if(ed.cap>&&level[v]<level[ed.to]){
             int d=dfs(ed.to,t,min(f,ed.cap));
             if(d>){
                 ed.cap-=d;
                 e[i^].cap+=d;
                 return d;
             }
         }
     }
     return ;
 }
 int max_flow(int s,int t){
     int flow=;
     while(){
         bfs(s);
         if(level[t]<) return flow;
         memcpy(iter,head,sizeof(iter));
         int f;
         while((f=dfs(s,t,inf))>){
             flow+=f;
         }
     }
 }
 int main()
 {
     int n,m,T;
     scanf("%d",&T);
     while(T--)
     {
         init();
         int s,t;
         scanf("%d %d",&n,&m);
         scanf("%d %d",&s,&t);
         for(int i=;i<=m;i++)
         {
             int u,v,w;
             scanf("%d %d %d",&u,&v,&w);
             addedge(u,v,w*+);
         }
         int ans = max_flow(s,t);
         printf("%d\n",ans%);
     }
     return ;
 }