Pagini recente » Cod sursa (job #2305709) | Cod sursa (job #3241860) | Cod sursa (job #2666225) | Cod sursa (job #3031761) | Cod sursa (job #1853823)
#include <stdio.h>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
//ifstream cin("maxflow.in");
ofstream cout("maxflow.out");
struct celula{
int nod;
celula *next;
}*g[1001],*a;
int n,m,x,y,cost,i,flow;
int c[1001][1001];
int t[1001],q[1001];
bool viz[1001];
void update()
{
int mini=2000000000;
int aux=n;
while(aux>1)
{
mini=min(mini,c[t[aux]][aux]);
aux=t[aux];
}
flow+=mini;
aux=n;
while(aux>1)
{
c[t[aux]][aux]-=mini;
c[aux][t[aux]]+=mini;
aux=t[aux];
}
}
bool bfs()
{
q[1]=1;
int l=1, r=1;
int nod=1;
int ok=0;
memset(viz,0,sizeof(viz));
viz[1]=1;
while(l<=r)
{
nod=q[l];
l++;
for(celula *p=g[nod]; p!=NULL; p=p->next)
{
if(viz[p->nod]==0 && c[nod][p->nod]>0)
{
t[p->nod]=nod;
if(p->nod==n) update(), ok=1;
else
q[++r]=p->nod, viz[p->nod]=1;
}
}
}
return ok;
}
int main()
{
freopen("maxflow.in", "r",stdin);
scanf("%d%d", &n, &m);
// cin>>n>>m;
for(i=1;i<=m;++i)
{
scanf("%d%d%d", &x, &y, &cost);
// cin>>x>>y>>cost;
c[x][y]=cost;
a=new celula;
a->nod=x;
a->next=g[y];
g[y]=a;
a=new celula;
a->nod=y;
a->next=g[x];
g[x]=a;
}
while(bfs())
{
}
cout<<flow;
return 0;
}