Pagini recente » Cod sursa (job #48368) | Cod sursa (job #1155691) | Cod sursa (job #875927) | Cod sursa (job #3169767) | Cod sursa (job #1649592)
#include <fstream>
#include <vector>
#include <cstring>
#define x first
#define y second
#define mp make_pair
using namespace std;
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
int i,j,n,m,p[1005],a,b,c[1001][1001],nod,ok,mini,oc[1001][1001];
long long int flow;
vector <int > v[1005];
void add(int nod)
{
if(p[nod]>0)
{
mini = min(mini, c[ p[nod] ][nod]);
add(p[nod]);
c[ p[nod] ][nod] -= mini;
if(!oc[nod][ p[nod] ])
c[nod][ p[nod] ] += mini;
}
}
void dfs(int nod)
{
int i;
for(i = 0; i < v[nod].size(); i++)
{
if(ok) return;
int nxt = v[nod][i];
if(c[nod][v[nod][i]]>0 && p[nxt] == 0)
{
p[nxt] = nod;
if(nxt == n)
{
ok = 1;
mini = c[nod][nxt];
add(nod);
flow += mini;
c[nod][nxt] -= mini;
}
else
dfs(nxt);
}
}
}
int main()
{
fin >> n >> m;
for(i = 1; i <= m; i++)
{
fin >> a >> b >> j;
v[a].push_back(b);
v[b].push_back(a);
c[a][b] = j;
oc[a][b] = 1;
}
ok = 1;
while(ok)
{
ok = 0;
p[1] = -1;
dfs(1);
memset(p,0,sizeof(p));
}
fout<<flow;
a++;
b++;
return 0;
}