Cod sursa(job #1665719)

Utilizator theodor1289Theodor Amariucai theodor1289 Data 27 martie 2016 12:07:22
Problema Flux maxim Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.87 kb
#include <fstream>
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
short n, m, x, y;
int capacitate[1010][1010], c, aux;
int flux[1010][1010], minminus, minplus, fluxparcurgere;
int coada[1010], p, u, sumaflux;
int tata[1010];
bool viz[1010];

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        capacitate[x][y]=c;
    }

    tata[n]=1;
    while(1)
    {
        tata[n]=0;
        for(int i=1;i<=n;i++)
            viz[i]=0;

        coada[1]=1;
        viz[1]=1;
        p=u=1;
        while(p<=u && tata[n]==0)
        {
            for(int i=1;i<=n;i++)
            if(!viz[i])
            {
                if(capacitate[coada[p]][i]>flux[coada[p]][i])
            {
                coada[++u]=i;
            viz[i]=1;
                tata[i]=coada[p];
            }
            else
            if(flux[i][coada[p]]>0 && capacitate[coada[p]][i])
            {
                coada[++u]=i;
                viz[i]=1;
                tata[i]=-coada[p];
            }
            }
            p++;
        }

        if(tata[n]==0)
            break;

        aux=n;
        minminus=minplus=1000000000;
        while(tata[aux])
        {
            if(tata[aux]>0)
                minplus=min(minplus, capacitate[tata[aux]][aux]-flux[tata[aux]][aux]);
            else
                minminus=min(minminus, flux[aux][tata[aux]]);
            aux=tata[aux];
        }


        fluxparcurgere=min(minminus, minplus);

        aux=n;
        while(tata[aux])
        {
            if(tata[aux]>0)
                flux[tata[aux]][aux]+=fluxparcurgere;
            else
                flux[aux][tata[aux]]-=fluxparcurgere;
            aux=tata[aux];
        }

    }
    for(int i=1;i<=n;i++)
        sumaflux+=flux[i][n];
    fout<<sumaflux;
    return 0;
}