Cod sursa(job #396861)

Utilizator perticas_catalinperticas catalin perticas_catalin Data 15 februarie 2010 23:26:00
Problema Flux maxim Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 1.87 kb
#include<iostream>
#include<string>
#include<vector>

using namespace std;

#define NM 1005
#define PB push_back
#define inf 2000000000
#define min(a,b)((a)<(b)?(a):(b))

int N,M;

int flux[NM][NM],cap[NM][NM];

int coada[NM],tata[NM],st,dr;
char viz[NM];

vector<int> G[NM];

inline int bf()
{
     for(int i=1;i<=N;++i)
        viz[i]=0;
     
     st=1,dr=1;
     coada[st]=1;
     viz[1]=1;
     
     while(st<=dr)
     {
         int nod=coada[st];
         
         if(nod==N) return 1;
         
         for(int j=0;j<G[nod].size();++j)
         {
             int nnod=G[nod][j];
             if(viz[nnod]) continue;
             if(cap[nod][nnod]-flux[nod][nnod]<=0) continue;
             
             coada[++dr]=nnod;
             tata[dr]=st;    
         }                
         ++st;         
     }  
     
     return 0;
}

int main()
{
    int ans=0,u,v,c;
    
    freopen("maxflow.in","r",stdin);
    freopen("maxflow.out","w",stdout);
    
    scanf("%d %d",&N,&M);
    
    for(int i=1;i<=M;++i)
    {
       scanf("%d %d %d",&u,&v,&c);
       
       G[u].PB(v);
       G[v].PB(u);
       
       cap[u][v]=c;
    }
    
    while(bf())
    {
       int ansc=inf;   
       
       int ind=st;
       
       while(tata[ind])
       {
           int nod=coada[ind];
           int fat=coada[tata[ind]];
                 
           ansc=min(ansc,cap[fat][nod]-flux[fat][nod]);     
           
           ind=tata[ind]; 
       }     
       
       ans+=ansc;
       
       ind=st;
       
       while(tata[ind])
       {
           int nod=coada[ind];
           int fat=coada[tata[ind]];
                 
           flux[fat][nod]+=ansc;
           flux[nod][fat]-=ansc;    
           
           ind=tata[ind]; 
       } 
    }
    
    printf("%d",ans);
    
    return 0;
}