Cod sursa(job #809847)

Utilizator SebiSebiPirtoaca George Sebastian SebiSebi Data 9 noiembrie 2012 08:36:47
Problema Flux maxim Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.21 kb
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;

const int NMAX = 1001;

int c[NMAX][NMAX],cd[NMAX],viz[NMAX],p[NMAX],n;
vector <int> v[NMAX];

int bfs()
{
	int i,nod,st,dr;
	for(i=1;i<=n;i++)
		viz[i]=0;
	cd[1]=1;
	viz[1]=1;
	st=1;
	dr=1;
	while(st<=dr) {
		nod=cd[st];
		st++;
		for(vector <int> :: iterator it=v[nod].begin();it!=v[nod].end();it++)  
			if(viz[*it]==0 && c[nod][*it]>=1) {
				viz[*it]=1;
				cd[++dr]=*it;
				p[*it]=nod;
				if(*it==n)
					return 1;
			}
	}
	return 0;
}

void citire()
{
	int m,i,x,y,capacity;
	ifstream f("maxflow.in");
	f>>n>>m;
	for(i=1;i<=m;i++) {
		f>>x>>y>>capacity;
		v[x].push_back(y);
		v[y].push_back(x);
		c[x][y]=capacity;
	}
	f.close();
}

int edmonds_karp()
{
	int fluxcurent,fluxmax,nod;
	for(fluxmax=0 ; bfs(); fluxmax=fluxmax+fluxcurent) {
		fluxcurent=(1<<30);
		for(nod=n;nod!=1;nod=p[nod]) 
			fluxcurent=min(fluxcurent,c[p[nod]][nod]);
		for(nod=n;nod!=1;nod=p[nod]) {
			c[p[nod]][nod]=c[p[nod]][nod]-fluxcurent;
			c[nod][p[nod]]=c[nod][p[nod]]+fluxcurent;
		}
	}
	return fluxmax;
}

int main () 
{
	ofstream g("maxflow.out");
	citire();
	g<<edmonds_karp();
	g.close();
	return 0;
}