Pagini recente » Cod sursa (job #1252251) | Cod sursa (job #904251) | Cod sursa (job #1675805) | Cod sursa (job #836821) | Cod sursa (job #396873)
Cod sursa(job #396873)
#include<iostream>
#include<string>
#include<vector>
using namespace std;
#define NM 1024
#define PB push_back
#define inf 2000000000
#define min(a,b)((a)<(b)?(a):(b))
#define maxbuf 65536
FILE*fin=fopen("maxflow.in","r");
int N,M;
int flux[NM][NM],cap[NM][NM];
int coada[NM],tata[NM],st,dr;
char viz[NM];
vector<int> G[NM];
char buf[maxbuf];
int indb;
inline void refbuf()
{
int ans=fread(buf,1,maxbuf,fin);
if(ans<maxbuf) buf[ans]=0;
indb=0;
}
inline int getnr()
{
int ans=0;
one:
while(indb<maxbuf && !isdigit(buf[indb])) ++indb;
if(indb==maxbuf)
{
refbuf();
goto one;
}
two:
while(indb<maxbuf && isdigit(buf[indb]))
{
ans=ans*10+buf[indb]-'0';
++indb;
}
if(indb==maxbuf)
{
refbuf();
goto two;
}
return ans;
}
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;
viz[nnod]=1;
tata[dr]=st;
}
++st;
}
return 0;
}
int main()
{
int ans=0,u,v,c;
//freopen("maxflow.in","r",stdin);
freopen("maxflow.out","w",stdout);
refbuf();
N=getnr();
M=getnr();
for(int i=1;i<=M;++i)
{
u=getnr();
v=getnr();
c=getnr();
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;
}