Pagini recente » Cod sursa (job #2094479) | Cod sursa (job #1961984) | Cod sursa (job #2046194) | Cod sursa (job #1942613) | Cod sursa (job #1509166)
using namespace std;
#include <fstream>
#include <vector>
#include <string.h>
FILE *f=fopen ("maxflow.in","r");
FILE *g=fopen ("maxflow.out","w");
#define Nmax 1024
#define sz size()
#define mp make_pair
#define INF 0x3f3f3f3f
int C[Nmax][Nmax]; //capacitatea
int F[Nmax][Nmax]; //fluxul
int TT[Nmax]; //nodul anterior din coada (un stramos)
vector<int>G[Nmax];
int N,M;
int cd[Nmax]; //coada
int viz[Nmax];
int BF()
{
int i,j,nod,V;
cd[0]=1;
cd[1]=1;
memset(viz,0,sizeof(viz));
viz[1]=1;
for(i=1;i<=cd[0];i++)
{
nod=cd[i];
if(nod==N) continue;
for(j=0;j<G[nod].sz;j++)
{
V=G[nod][j];
if(C[nod][V]==F[nod][V] || viz[V]) continue;
viz[V]=1;
cd[++cd[0]]=V;
TT[V]=nod;
}
}
return viz[N];
}
int min(int a,int b)
{
if(a<b) return a;
return b;
}
int main()
{
int flow,fmin,i,x,y,z,nod;
fscanf(f,"%d%d",&N,&M);
for(i=1;i<=M;i++)
{
fscanf(f,"%d%d%d",&x,&y,&z);
C[x][y]+=z;
G[x].push_back(y);
G[y].push_back(x);
}
for(flow=0;BF();)
for(i=0; i<G[N].sz; i++)
{
nod=G[N][i];
if(F[nod][N]==C[nod][N] || !viz[nod])continue;
TT[N]=nod;
fmin=INF;
for(nod=N;nod!=1;nod=TT[nod])
fmin=min(fmin,C[TT[nod]][nod]-F[TT[nod]][nod]);
if(fmin==0) continue;
for(nod=N;nod!=1;nod=TT[nod])
{
F[ TT[nod] ][nod] += fmin;
F[nod][ TT[nod] ] -= fmin;
}
flow+=fmin;
}
fprintf(g,"%d",flow);
return 0;
}