Pagini recente » Cod sursa (job #917512) | Cod sursa (job #935566) | Cod sursa (job #1397089) | Cod sursa (job #1258703) | Cod sursa (job #1891738)
#include<fstream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int capacitate[1004][1004],fl[1004][1004],c[1004],viz[1004];
int TT[1004];
vector<int>v[1004];
int n,m;
int flux=0;
const int inf=0x3f3f3f3f;
int bfs();
void fluxmin();
void citire();
void afis();
int main()
{
citire();
fluxmin();
afis();
return 0;
}
void citire()
{
int i;
int x,y,z;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y>>z;
capacitate[x][y]+=z;
v[x].push_back(y);
v[y].push_back(x);
}
}
int bfs()
{
int nod,i,j,vf;
c[0]=1;
c[1]=1;
memset(viz,0,sizeof(viz));
viz[1]=1;
for(i=1;i<=c[0];i++)
{
nod=c[i];
if(nod==n)
continue;
for(j=0;j<v[nod].size();j++)
{
vf=v[nod][j];
if(capacitate[nod][vf]==fl[nod][vf]||viz[vf])
continue;
viz[vf]=1;
c[++c[0]]=vf;
TT[vf]=nod;
}
}
return viz[n];
}
void fluxmin()
{
int i,j,fmin;
while(bfs())
for(i=0;i<v[n].size();i++)
{
j=v[n][i];
if(fl[j][n]==capacitate[j][n]||!viz[j])
continue;
TT[n]=j;
fmin=inf;
for(j=n;j!=1;j=TT[j])
fmin=min(fmin,capacitate[TT[j]][j]-fl[TT[j]][j]);
if(fmin==0)
continue;
for(j=n;j!=1;j=TT[j])
{
fl[TT[j]][j]+=fmin;
fl[j][TT[j]]-=fmin;
}
flux+=fmin;
}
}
void afis()
{
g<<flux;
}