Pagini recente » Cod sursa (job #2178491) | Cod sursa (job #2370990) | Cod sursa (job #2792084) | Cod sursa (job #1815006) | Cod sursa (job #1396953)
#include <cstdio>
#include <vector>
#include <bitset>
#include <cstring>
#define NMAX 1005
#define INF 0x3f3f3f3f
using namespace std;
bitset <NMAX>ap;
vector <int>v[NMAX];
int n,m,x,y,z,flow;
int boss[NMAX],cap[NMAX][NMAX];
inline bool df(int nod)
{
for (auto it:v[nod])
if (!ap[it] && cap[nod][it])
{
ap[it]=1;
boss[it]=nod;
df(it);
}
}
int main()
{
freopen("maxflow.in","r",stdin);
freopen("maxflow.out","w",stdout);
scanf ("%d %d",&n,&m);
for (;m;m--)
{
scanf("%d %d %d",&x,&y,&z);
v[x].push_back(y);
v[y].push_back(x);
cap[x][y]=z;
}
ap[1]=1;
while (df(1) && ap[n])
{
int maxflow=INF;
for (int i=n;i>1;i=boss[i])
maxflow=(maxflow>cap[boss[i]][i]?cap[boss[i]][i]:maxflow);
for (int i=n;i>1;i=boss[i])
cap[boss[i]][i]-=maxflow,
cap[i][boss[i]]+=maxflow;
flow+=maxflow;
for (int i=2;i<=n;i++)ap[i]=0;
}
printf("%d",flow);
fclose(stdin);
fclose(stdout);
}