Pagini recente » Cod sursa (job #2532449) | Cod sursa (job #2655150) | Cod sursa (job #1350009) | Cod sursa (job #1540671) | Cod sursa (job #3226747)
#include <bits/stdc++.h>
#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
///#include <tryhardmode>
///#include <GODMODE::ON>
using namespace std;
#define cin fin
#define cout fout
ifstream fin("maxflow.in");
ofstream fout("maxflow.out");
const int NMAX=1e3+5;
const int INF=2e9;
vector<int>v[NMAX];
int flux[NMAX][NMAX];
bool viz[NMAX];
int t[NMAX];
int n,s,d;
bool bfs()
{
int i;
for(i=1;i<=n;i++)
viz[i]=false;
queue<int>q;
q.push(s);
viz[s]=true;
while(!q.empty())
{
int p=q.front();
q.pop();
if(p==d)
return true;
for(auto i:v[p])
{
if(!viz[i] && flux[p][i]>0)
{
viz[i]=true;
t[i]=p;
q.push(i);
}
}
}
return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int m,i,j;
long long kon=0;
cin>>n>>m;
for(i=1;i<=m;i++)
{
int x,y,c;
cin>>x>>y>>c;
v[x].push_back(y);
v[y].push_back(x);
flux[x][y]=c;
}
s=1;
d=n;
while(bfs())
{
for(auto i:v[d])
{
if(!viz[i] || flux[i][d]<=0)
continue;
t[d]=i;
int x=d;
int mini=INF;
while(x!=s)
{
mini=min(mini,flux[t[x]][x]);
x=t[x];
}
if(mini==0)
continue;
x=d;
while(x!=s)
{
flux[x][t[x]]+=mini;
flux[t[x]][x]-=mini;
x=t[x];
}
kon+=mini;
}
}
cout<<kon;
return 0;
}