Pagini recente » Cod sursa (job #1386738) | Cod sursa (job #2011742) | Cod sursa (job #1897340) | Cod sursa (job #656460) | Cod sursa (job #2187524)
#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
int m,n,f,rasp,flux[1005][1005],capacitate[1005][1005],viz[1005],vTati[1005];
vector <int> G[1005];
void citire()
{
scanf("%d%d",&n,&m);
int nod1,nod2,c;
for(int i=1; i<=m; i++)
{
scanf("%d%d%d",&nod1,&nod2,&c);
G[nod1].push_back(nod2);
G[nod2].push_back(nod1);
capacitate[nod1][nod2]=c;
}
}
void dfs(int nod)
{
viz[nod]=1;
for(auto fiu:G[nod])
{
if(capacitate[nod][fiu]>flux[nod][fiu]&&!viz[fiu])
{
vTati[fiu]=nod;
dfs(fiu);
}
}
}
int main()
{
freopen("maxflow.in","r",stdin);
freopen("maxflow.out","w",stdout);
citire();
dfs(1);
while(viz[n])
{
for(auto frunza:G[n])
{
if(viz[frunza]&&capacitate[frunza][n]>flux[frunza][n])
{
vTati[n]=frunza;
f=0x3f3f3f3f;
for(int nod=n; nod!=1; nod=vTati[nod])
{
f=min(f,capacitate[vTati[nod]][nod]-flux[vTati[nod]][nod]);
}
for(int nod=n; nod!=1; nod=vTati[nod])
{
flux[nod][vTati[nod]]-=f;
flux[vTati[nod]][nod]+=f;
}
rasp+=f;
}
}
memset(viz,0,sizeof(viz));
dfs(1);
}
printf("%d",rasp);
return 0;
}