Cod sursa(job #3295508)

Utilizator alecu2008Alecu Alexandru alecu2008 Data 6 mai 2025 10:55:25
Problema Flux maxim Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.24 kb
#include <iostream>
#include <bits/stdc++.h>
using namespace std;



ifstream fin("maxflow.in");
ofstream fout("maxflow.out");

const int nmax=1024,inf=0x3f3f3f3f;
int n,m,x,y,z,nod,nod2;
vector<vector<int> > graf;
int c[nmax][nmax],TT[nmax],f[nmax][nmax];
bitset<nmax> vas;


int df(int nod){
    vas[nod]=1;
    for(int i:graf[nod]){
        if(!vas[i]&&c[nod][i]>f[nod][i]){
            TT[i]=nod;
            df(i);
        }
    }
    return vas[n];
}





int main()
{
    int flow,fmin;
    fin>>n>>m;
    graf.assign(n+1,vector<int>());
    for(int i=0;i<m;i++){
        fin>>x>>y>>z;
        c[x][y]+=z;
        graf[x].push_back(y);
        graf[y].push_back(x);
    }
    //cout<<df(1);
    for(flow=0;df(1);){
        //cout<<vas[n];
        for(int i:graf[n]){
        fmin=inf;
        if (f[i][n]==c[i][n]||!vas[i]) continue;
        TT[n]=i;
        for(nod=n;nod!=1;nod=TT[nod]){
            //cout<<nod<<" ";
            fmin=min(fmin,c[TT[nod]][nod]-f[TT[nod]][nod]);
        }
        for(nod=n;nod!=1;nod=TT[nod]){

            f[TT[nod]][nod]+=fmin;
            f[nod][TT[nod]]-=fmin;
        }
        flow+=fmin;
        }
        vas.reset();
    }
    fout<<flow;
    return 0;
}