Pagini recente » infoarena 2.0 | Cod sursa (job #2397752) | Cod sursa (job #2254326) | Cod sursa (job #417483) | Cod sursa (job #1053908)
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>
#define x first
#define y second
#define NMAX 1007
#define INF 100000000
using namespace std;
int Cap[NMAX][NMAX], Flux[NMAX][NMAX], dad[NMAX];
int n, Maxflow, m;
vector <int> v[NMAX];
queue <int> q;
void bfs(){
while(! q.empty())
q.pop();
q.push(1);
dad[1] = -1;
while(! q.empty() && dad[n] == 0){
int Nod = q.front();
if(Nod == n)
break;
for(int i = 0; i < v[Nod].size(); ++ i)
if(dad[v[Nod][i]] == 0 && Cap[Nod][v[Nod][i]] > Flux[Nod][v[Nod][i]]){
q.push(v[Nod][i]);
dad[v[Nod][i]] = Nod;
}
q.pop();
}
}
inline int fluxmax(){
while(1){
memset(dad, 0, sizeof(dad));
bfs();
if(dad[n] == 0)
return Maxflow;
for(int j = 0; j < v[n].size(); ++ j){
int i = v[n][j];
if(Cap[i][n] > Flux[i][n] && dad[i]){
int Min = Cap[i][n] - Flux[i][n], Nod = i;
while(Nod != 1){
int Dad = dad[Nod];
Min = min(Min, Cap[Dad][Nod] - Flux[Dad][Nod]);
Nod = Dad;
}
if(! Min)
continue;
Maxflow += Min;
Flux[i][n] += Min;
Flux[n][i] -= Min;
Nod = i;
while(Nod != 1){
int Dad = dad[Nod];
Flux[Nod][Dad] -= Min;
Flux[Dad][Nod] += Min;
Nod = Dad;
}
}
}
}
return Maxflow;
}
int main(){
freopen("maxflow.in", "r", stdin);
freopen("maxflow.out", "w", stdout);
scanf("%d %d", &n, &m);
for(int i = 1; i <= m; ++i){
int a = 0, b = 0, c = 0;
scanf("%d %d %d", &a, &b, &c);
v[a].push_back(b);
v[b].push_back(a);
Cap[a][b] += c;
Flux[a][b] = 0;
}
printf("%d", fluxmax());
return 0;
}