Cod sursa(job #1516797)

Utilizator patrutoiuandreipatrutoiu andrei patrutoiuandrei Data 3 noiembrie 2015 16:34:09
Problema Flux maxim Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.29 kb
#include <fstream>
#include <vector>
#include <string.h>
#include <limits.h>

#define NDIM 1003
#define INF INT_MAX
#define pb push_back
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int n,m,i,nod,fmin,flow,a,b,cost,c[NDIM][NDIM],q[NDIM*NDIM],f[NDIM][NDIM],par[NDIM],fiu;
bool viz[NDIM];
vector <int> G[NDIM];
int BFS()
{
    memset(viz,0,sizeof(viz));
    q[0]=q[1]=viz[1]=1;
    for(int i=1;i<=q[0];i++)
    {
        nod=q[i];
        for(size_t j=0;j<G[nod].size();j++)
        {
            fiu=G[nod][j];
            if(c[nod][fiu]==f[nod][fiu]||viz[fiu]) continue;
            viz[fiu]=1;
            par[fiu]=nod;
            q[++q[0]]=fiu;
            if(fiu==n)
                return 1;
        }
    }
    return 0;
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>cost;
        c[a][b]=cost;
        G[a].pb(b);
        G[b].pb(a);
    }
    for(flow=0;BFS();flow+=fmin)
    {
        fmin=INF;
        for(nod=n;nod!=1;nod=par[nod])
        {
            fmin=min(fmin,c[par[nod]][nod]-f[par[nod]][nod]);
        }
        for(nod=n;nod!=1;nod=par[nod])
        {
            f[par[nod]][nod]+=fmin;
            f[nod][par[nod]]-=fmin;
        }
    }
    fout<<flow;
    return 0;
}