Pagini recente » Cod sursa (job #2245086) | Cod sursa (job #843278) | Cod sursa (job #2237826) | Cod sursa (job #2323268) | Cod sursa (job #1816807)
#include <iostream>
#include<fstream>
#include<vector>
#define inf 1000000
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int sz,c[1000000],C[1001][1001],F[1001][1001],k,i,flow,fmin,n,m,father[1001],x,y,cst;
vector<int>v[1001];
bool viz[1001];
int bfs()
{
sz=1;
c[1]=1;
int i,nod;
for(i=1;i<=n;i++)
viz[i]=0;
viz[1]=1;
for(i=1;i<=sz;i++)
{
nod=c[i];
for(k=0;k<v[nod].size();k++)
{
int vertex=v[nod][k];
if(viz[v[nod][k]] || F[nod][v[nod][k]]==0)
continue;
c[++sz]=v[nod][k];
viz[v[nod][k]]=1;
father[v[nod][k]]=nod;
if(v[nod][k]==n)
return 1;
}
}
return 0;
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y>>cst;
v[x].push_back(y);
v[y].push_back(x);
F[x][y]=cst;
}
for(flow=0;bfs();flow+=fmin)
{
fmin=inf;
for(i=n;i!=1;i=father[i])
fmin=min(fmin,F[father[i]][i]);
for(i=n;i!=1;i=father[i])
{
F[father[i]][i]-=fmin;
F[i][father[i]]+=fmin;
}
}
g<<flow;
}