Pagini recente » Cod sursa (job #2675293) | Cod sursa (job #2645753) | Cod sursa (job #27310) | Cod sursa (job #1631063) | Cod sursa (job #1191107)
#include <fstream>
#include <algorithm>
#include <vector>
#include <cstring>
#define pinf 1000000000
using namespace std;
ifstream f("maxflow.in");
ofstream g("maxflow.out");
int N,M,c;
int capacitate[1002][1002],flux[1002][1002];
int lant[1002],q[1002],viz[1002];
int pq,nq;
vector <int> l[1002];
void citire(int &N, int &M)
{
int x,y,capac;
f>>N>>M;
for(int i=1;i<=M;i++)
{
f>>x>>y>>capac;
l[x].push_back(y);
l[y].push_back(x);
capacitate[x][y]=capac;
}
}
int bf(int s, int t)
{int x;
memset(viz,-1,sizeof(viz));
pq=nq=1;
q[pq]=s;
viz[s]=1;
lant[s]=-1;
while (pq<=nq)
{
x=q[pq];
viz[x]=1;
int lungime=l[x].size();
for(int i=0;i<lungime;i++)
{c=l[x][i];
if(viz[c]==-1 && capacitate[x][c]-flux[x][c]>0)
{
q[++nq]=c;
viz[c]=1;
lant[c]=x;
if(c==N) return 1;
}
}
pq++;
}
return 0;
}
int Ford(int s, int t)
{
int i;
int fluxmaxim=0;
while (bf(s,t))
{
int x=pinf;
for (i=N;lant[i]>0;i=lant[i])
x=min(x,capacitate[lant[i]][i]-flux[lant[i]][i]);
for (i=N;lant[i]>0;i=lant[i])
{
flux[lant[i]][i]+=x;
flux[i][lant[i]]-=x;
}
fluxmaxim+=x;
}
return fluxmaxim;
}
int main()
{
citire(N,M);
g<<Ford(1,N);
return 0;
}