HDOJ 3491 - Thieves 裸无向图的最小点权割...

                  题意: 

                          在一个无向图中..S处有小偷..小偷到达E处就成功逃脱了..但警察不知道小偷会走怎样的路线..但警察可以布置警力来封路..告诉封每条路所需要的警力..问最少需要多少的警力让小偷无法逃脱..

                  题解:

                           拆点..裸题..

Program:

#include<iostream>    
#include<algorithm>    
#include<stdio.h>    
#include<string.h>  
#include<time.h> 
#include<map> 
#include<math.h>    
#include<queue>    
#define MAXN 100005 
#define MAXM 2000005   
#define oo 1000000007    
#define ll long long    
using namespace std;   
struct Dinic            
{            
       struct node          
       {           
             int c,u,v,next;          
       }edge[MAXM];          
       int ne,head[MAXN];          
       int cur[MAXN], ps[MAXN], dep[MAXN];          
       void initial()          
       {          
             ne=2;          
             memset(head,0,sizeof(head));           
       }          
       void addedge(int u, int v,int c)          
       {           
             edge[ne].u=u,edge[ne].v=v,edge[ne].c=c,edge[ne].next=head[u];          
             head[u]=ne++;          
             edge[ne].u=v,edge[ne].v=u,edge[ne].c=0,edge[ne].next=head[v];          
             head[v]=ne++;          
       }          
       int MaxFlow(int s,int t)          
       {                               
             int tr, res = 0;          
             int i,j,k,f,r,top;          
             while(1)          
             {          
                    memset(dep, -1, sizeof(dep));          
                    for(f=dep[ps[0]=s]=0,r=1;f!= r;)          
                       for(i=ps[f++],j=head[i];j;j=edge[j].next)          
                         if(edge[j].c&&dep[k=edge[j].v]==-1)          
                         {          
                               dep[k]=dep[i]+1;          
                               ps[r++]=k;          
                               if(k == t){  f=r; break;  }          
                         }          
                    if(dep[t]==-1) break;          
                    memcpy(cur,head,sizeof(cur));          
                    i=s,top=0;          
                    while(1)          
                    {          
                         if(i==t)          
                         {          
                               for(tr=oo,k=0;k<top;k++)          
                                  if(edge[ps[k]].c<tr)          
                                     tr=edge[ps[f=k]].c;          
                               for(k=0;k<top;k++)          
                               {          
                                     edge[ps[k]].c-=tr;          
                                     edge[ps[k]^1].c+=tr;          
                               }          
                               i=edge[ps[top=f]].u;          
                               res+= tr;          
                         }          
                         for(j=cur[i];cur[i];j=cur[i]=edge[cur[i]].next)           
                             if(edge[j].c && dep[i]+1==dep[edge[j].v]) break;           
                         if(cur[i])  ps[top++]=cur[i],i=edge[cur[i]].v;           
                         else          
                         {          
                                 if(!top) break;          
                                 dep[i]=-1;          
                                 i=edge[ps[--top]].u;          
                         }          
                   }          
             }          
             return res;          
      }          
}T;      
int main()   
{        
      int C,n,m,s,e,i,x,y;       
      scanf("%d",&C);
      while (C--)
      {
              scanf("%d%d%d%d",&n,&m,&s,&e);
              T.initial();
              for (i=1;i<=n;i++)
                  scanf("%d",&x),T.addedge(i<<1,i<<1|1,x);
              while (m--)
              {
                      scanf("%d%d",&x,&y);
                      T.addedge(x<<1|1,y<<1,oo),T.addedge(y<<1|1,x<<1,oo);
              }
              printf("%d\n",T.MaxFlow(s<<1|1,e<<1));
      }
      return 0;  
}