Cod sursa(job #952777)

Utilizator OpportunityVlad Negura Opportunity Data 23 mai 2013 23:18:50
Problema Flux maxim Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include <fstream>
#include <iostream>
using namespace std;
ifstream fi("maxflow.in");
ofstream fo("maxflow.out");

int i,j,n,m,c[1001][1001],cr[1001][1001],viz[1001],cd[10001],f[1001][1001],t[1001],fmin,rsa[10001],flux;

int BFS()
{
	for (i=1; i<=n; i++) viz[i]=0;
	int st=1,dr=1;
	cd[1]=1;
	while (st<=dr)
	{
		int nod=cd[st++];
		for (i=1; i<=n; i++)
		{
			if (c[nod][i]>f[nod][i] && !viz[i])
			{
				viz[i]=1;
				t[i]=nod;
				cd[++dr]=i;
			}
		}
	}
	
	
	return viz[n];
}

int main(){
	
	fi >> n >> m;
	for (i=1; i<=m; i++)
	{
		int x,y,z;
		fi >> x >> y >> z;
		c[x][y]=cr[x][y]=z;
	}
	
	while (BFS())
	{
		for (i=1; i<=n; i++)
		{
			if (c[i][n]>f[i][n])
			{
				int fmin=c[i][n]-f[i][n];
				for (j=i; j!=1; j=t[j])
					fmin=min(fmin,c[t[j]][j]-f[t[j]][j]);
				for (j=i; j!=1; j=t[j])
				{
					f[t[j]][j]+=fmin;
					f[j][t[j]]-=fmin;
				}
				f[i][n]+=fmin;
				f[n][i]-=fmin;
				flux+=fmin;
			}
		}
	}
	
	fo << flux;
	
	return 0;
}