Pagini recente » Cod sursa (job #2602794) | Cod sursa (job #2614791) | Cod sursa (job #248553) | Cod sursa (job #2611581) | Cod sursa (job #3038197)
#include <stdio.h>
#include <stdlib.h>
#define N 1001
#define inf 1e9
#define min(x,y) (x<y?x:y)
unsigned short int n , m , a , b , l , r , x , i;
unsigned int flow;
int c , nf;
unsigned short int q[N] , t[N];
unsigned char viz[N];
unsigned int f[N][N];
unsigned char bfs(){
for(i = 1 ; i <= n ; ++ i){
viz[i] = 0;
}
q[l = r = 1] = viz[1] = 1;
while(l <= r){
x = q[l++];
for(i = 1 ; i <= n ; ++ i){
if(f[x][i] > 0 && !viz[i]){
viz[i] = 1;
t[i] = x;
q[++r] = i;
if(i == n)
return 1;
}
}
}
return 0;
}
unsigned int maxflow(){
flow = 0;
while(bfs()){
nf = inf;
x = n;
while(t[x]){
nf = min(nf , f[t[x]][x]);
x = t[x];
}
flow += nf , x = n;
while(t[x]){
f[t[x]][x] -= nf;
f[x][t[x]] += nf;
x = t[x];
}
}
return flow;
}
int main(){
FILE *fin = fopen("maxflow.in" , "r");
FILE *fout = fopen("maxflow.out" , "w");
fscanf(fin , "%hu%hu" , &n , &m);
for(i = 1 ; i <= m ; ++ i){
fscanf(fin , "%hu%hu%d" , &a , &b , &c);
f[a][b] = c;
}
fprintf(fout , "%d\n" , maxflow());
return 0;
}