Pagini recente » Cod sursa (job #1165093) | Cod sursa (job #1014225) | Cod sursa (job #1399596) | Cod sursa (job #2660632) | Cod sursa (job #2549851)
#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,A;
bool bfs()
{
fr.reset();
d.push_back(1);
fr[1]=1;
int nod;
int g=0,i;
while(d.size())
{
nod=d.front();
d.pop_front();
for(i=L[nod].size()-1; i>=0; i--)
{
v=L[nod][i];
if(!fr[v]&&C[nod][v]-F[nod][v]>0)
{
d.push_back(v);
fr[v]=1;
v==n?g=1:1;
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)
{
A=it;
while(t[A]!=0)
{
M=min(M,C[t[A]][A]-F[t[A]][A]);
A=t[A];
}
A=it;
F[it][n]+=M;
F[n][it]-=M;
flux+=M;
while(t[A]!=0)
{
F[t[A]][A]+=M;
F[A][t[A]]-=M;
A=t[A];
}
}
}
}
fout<<flux;
}