Pagini recente » Utilizatori inregistrati la preONI 2008, Runda Finala, Clasele 5-8 | Cod sursa (job #2408399) | Cod sursa (job #1078463) | Cod sursa (job #313389) | Cod sursa (job #1404179)
#include <iostream>
#include <cstdio>
#include <vector>
#define inf 0x7fffffff
using namespace std;
struct muchie
{
int y,c;
};
int n,m;
vector <muchie> g[1010];
vector <int> sir[1010];
void citire()
{
freopen("maxflow.in","r",stdin);
scanf("%d %d",&n,&m);
for(int i=0; i<m; i++)
{
muchie aux;
int x;
scanf("%d %d %d",&x,&aux.y,&aux.c);
g[x].push_back(aux);
}
}
int sum;
int ok=0,k;
int minim(int a, int b)
{
if(a<b)
return a;
return b;
}
int l=0;
void DFS(int x, int m)
{
if(x!=n)
for(int i=0; i<g[x].size(); i++)
{
DFS(g[x][i].y,minim(g[x][i].c,m));
if(ok==1)
g[x][i].c-=l;
if(!g[x][i].c)
g[x].erase(g[x].begin()+i);
}
else
{
ok=1;
sum+=m;
l=m;
}
}
int main()
{
citire();
do
{
ok=0;
DFS(1,inf);
}
while(ok==1);
freopen("maxflow.out","w",stdout);
printf("%d",sum);
return 0;
}