Cod sursa(job #1409596)

Utilizator gabib97Gabriel Boroghina gabib97 Data 30 martie 2015 16:45:27
Problema Flux maxim Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.34 kb
#include <stdio.h>
#include <string.h>
#include <vector>
#define inf 100000000
using namespace std;
int n,m,i,x,y,z,c[1001][1001],t[1001],q[100005],f[1001],nr,r,j;
long long flux;
vector<int> G[1001];
bool BFS()
{
    int i,p,u,z;
    p=u=1;
    for (i=1;i<=n;i++) t[i]=0;
    while (p<=u)
    {
        x=q[p++]; z=G[x].size();
        for (i=0;i<z;i++)
            if (!t[G[x][i]]&&c[x][G[x][i]])
        {
            q[++u]=G[x][i];
            t[G[x][i]]=x;
        }
    }
    return t[n];
}
int main()
{
    freopen ("maxflow.in","r",stdin);
    freopen ("maxflow.out","w",stdout);
    scanf("%i%i",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%i%i%i",&x,&y,&z);
        c[x][y]=z;
        G[x].push_back(y);
        G[y].push_back(x);
        if (y==n) f[++nr]=x;
    }
    q[1]=1;
    while (BFS())
    for (i=1;i<=nr;i++)
        if (t[f[i]]&&c[f[i]][n])
        {
            r=c[f[i]][n];
            for (j=f[i];j!=1;j=t[j])
                r=min(r,c[t[j]][j]);
            if (r)
            {
                flux+=r;
                for (j=f[i];j!=1;j=t[j])
                {
                    c[t[j]][j]-=r;
                    c[j][t[j]]+=r;
                }
                c[f[i]][n]-=r;
                c[n][f[i]]+=r;
            }
        }
    printf("%lld",flux);
    return 0;
}