Cod sursa(job #240769)

Utilizator EdeNNu Cred EdeN Data 8 ianuarie 2009 17:48:34
Problema Flux maxim Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.5 kb
#include <cstdio>
#include <vector>

#define INF 0x3f3f3f

using namespace std;

int n, m;
int c[1100][1100], f[1100][1100];
int t[1100];
bool viz[1100];

vector <int> v[1100];

void citire()
{
    int i, x, y, z;
    scanf("%d %d",&n, &m);
    for(i=1; i<=m; ++i)
    {
        scanf("%d %d %d",&x, &y, &z);
        v[x].push_back(y);
        v[y].push_back(x);
        c[x][y]=z;
    }
}

bool vad()
{
    int i, k, q[1100], nod;
    q[0] = q[1] = 1;
    memset (viz,0, sizeof viz);
    viz[1] = 1;
    for (i=1; i<=q[0]; ++i)
    {
        nod=q[i];
        if(nod==n) continue;
        for (i=0; i<v[nod].size(); ++i)
        {
            k=v[nod][i];
            if (f[nod][k] == c[nod][k] || viz[k]) continue;
            viz[k]=1;
            q[++q[0]]=k;
            t[k]=nod;
        }
    }
    return viz[n];
}

void flux()
{
    int i, flow=0, fmin;
    while (vad())
    {
        for(i=0; i<v[n].size(); ++i)
        {
            int nod=v[n][i];
            if (f[nod][n] == c[nod][n] || viz[nod]==0) continue;
            t[n] = nod;
            fmin = INF;
            for (i=n; i!=1; i=t[i])
                fmin=min(fmin, c[t[i]][i] - f[t[i]][i]);
            for (i=n; i!=1; i=t[i])
                f[t[i]][i] += fmin,
		f[i][t[i]] -= fmin;
            flow += fmin;
        }
    }
    printf("%d\n",flow);
}

int main()
{
    freopen("maxflow.in","rt",stdin);
    freopen("maxflow.out","wt",stdout);
    citire();
    flux();
}