Cod sursa(job #902726)

Utilizator deea101Andreea deea101 Data 1 martie 2013 16:25:42
Problema Flux maxim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.44 kb
#include <fstream>
#include <list>
#include <vector>
#define INF (1<<29)
#define nmax 1001
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
vector <int> v[nmax];
list <int> coada;
int n,flux[nmax][nmax],t[nmax],viz[nmax],fmin;
int bfs()
{
    int i,x,y;
    for(i=1;i<=n;i++) viz[i]=0;
    coada.clear();
    coada.push_back(1);
    viz[1]=1;
    while(!coada.empty())
    {
        x=coada.front();
        if(x==n) return 1;
        for(i=0;i<v[x].size();i++)
        {
            y=v[x][i];
            if(!viz[y] && flux[x][y])
            {
                if(y==n) {viz[n]=1; continue;}
                t[y]=x;
                viz[y]=1;
                coada.push_back(y);
            }
        }
        coada.pop_front();
    }
    return viz[n];
}
int main()
{
    int m,i,j,x,y,c,fmax,fm;
    f>>n>>m;
    for(i=0;i<m;i++)
    {
        f>>x>>y>>c;
        v[x].push_back(y);
        v[y].push_back(x);
        flux[x][y]=c;
    }
    fmax=0;
    for(fmin=INF ; bfs() ;)
    {
        for(i=0;i<v[n].size();i++)
        {
            t[n]=v[n][i];
            if(!flux[t[n]][n]) continue;
            for(i=n;i!=1;i=t[i])
                if(flux[t[i]][i]<fmin) fmin=flux[t[i]][i];
            for(i=n;i!=1;i=t[i])
            {
                flux[t[i]][i]-=fmin;
                flux[i][t[i]]+=fmin;
            }
            fmax+=fmin;
        }
    }
    g<<fmax;
}