Cod sursa(job #1043576)

Utilizator cat_red20Vasile Ioana cat_red20 Data 28 noiembrie 2013 19:18:41
Problema Flux maxim Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.39 kb
#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
int n,m,q[1001],t[1001],viz[1001],flux[1001][1001],c[1001][1001],fl,sum;
vector<int>v[1001];
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
void citire()
{
    int x,y,f;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>f;
        v[x].push_back(y);
        c[x][y]=f;
    }
}

int bfs()
{
    int u,p,nod,cap;
    p=u=1;
    viz[1]=1;
    q[1]=1;
    while(viz[n]==0 && p<=u)
    {
        for(int i=1;i<=n;i++)
        {
            if(viz[i]==0 && c[q[p]][i]>flux[q[p]][i])
            {
                q[++u]=i;
                t[i]=q[p];
                viz[i]=1;
            }
        }
        p++;
    }
    if(viz[n]==0)
    return 0;

    return 1;

}

int parinti()
{
    int mini=110000;
    int nod=n;
    while(nod!=1)
    {
        if(mini>c[t[nod]][nod]-flux[t[nod]][nod])
        {
            mini=c[t[nod]][nod]-flux[t[nod]][nod];
        }

        nod=t[nod];
    }
    return mini;
}

void detFlux()
{
    int nod=n;
    while(nod!=1)
    {
        flux[nod][t[nod]]-=fl;
        flux[t[nod]][nod]+=fl;
        nod=t[nod];
    }
}
int main()
{
    citire();
    while(bfs())
    {
        memset(viz,0,sizeof(viz));
        fl=parinti();
        detFlux();
        sum+=fl;
    }
    fout<<sum;
    return 0;
}