Pagini recente » Cod sursa (job #1576454) | Cod sursa (job #3213701) | Cod sursa (job #2325402) | Cod sursa (job #2454641) | Cod sursa (job #396888)
Cod sursa(job #396888)
#include<iostream>
using namespace std;
#define NM 1024
#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];
int G[NM][512];
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;
int n=G[nod][0];
for(int j=1;j<=n;++j)
{
int nnod=G[nod][j];
if(viz[nnod]) continue;
if(cap[nod][nnod]-flux[nod][nnod]<=0) continue;
coada[++dr]=nnod;
viz[nnod]=1;
tata[dr]=st;
}
++st;
}
return 0;
}
int main()
{
int start=clock();
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][++G[u][0]]=v;
G[v][++G[v][0]]=u;
cap[u][v]+=c;
}
srand(time(0));
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);
int stop=clock();
//printf("\n%lf",(double)(stop-start)/CLOCKS_PER_SEC);
return 0;
}