Pagini recente » Cod sursa (job #2237684) | Cod sursa (job #1348262) | Cod sursa (job #2135417) | Cod sursa (job #2778069) | Cod sursa (job #2549847)
#include <bits/stdc++.h>
#define dim 1010
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
deque <int> d;
bitset<dim> fr;
vector <int> L[dim];
int C[dim][dim],F[dim][dim];
int n,x,y,z,M,t[dim],m,i,flux,v;
bool bfs(){
fr.reset();
d.push_back(1);
fr[1]=1;
int nod;
int g=0,i;
while(!d.empty()){
nod=d.front();
d.pop_front();
for(i=0;i<L[nod].size();i++){
v=L[nod][i];
if(fr[v]==0&&C[nod][v]-F[nod][v]>0){
fr[v]=1;
d.push_back(v);
v==n?g=1:0;
t[v]=nod;
}
}
}
return g;
}
int main()
{
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>x>>y>>z;
L[x].push_back(y);
L[y].push_back(x);
C[x][y]=z;
}
while(bfs())
{
for(auto it:L[n])
{
M=C[it][n]-F[it][n];
if(M>0&&fr[it]==1){
int aux=it;
while(t[aux]!=0)
{
M=min(M,C[t[aux]][aux]-F[t[aux]][aux]);
aux=t[aux];
}
aux=it;
F[it][n]+=M;
F[n][it]-=M;
flux+=M;
while(t[aux]!=0)
{
F[t[aux]][aux]+=M;
F[aux][t[aux]]-=M;
aux=t[aux];
}
}
}
}
fout<<flux;
}