Pagini recente » Cod sursa (job #834263) | Cod sursa (job #2922181) | Cod sursa (job #299087) | Cod sursa (job #1127953) | Cod sursa (job #2265914)
#include <iostream>
#include <bits/stdc++.h>
#define Nmax 500
#define pb push_back
#define inf 2000000
#define ll long long
using namespace std;
ifstream fin("fmcm.in");
ofstream fout("fmcm.out");
vector <int> V[Nmax];
int C[Nmax][Nmax],GR[Nmax][Nmax];
int tata[Nmax], dist[Nmax];
int Drum(int n, int s, int d)
{
bool flag = true;
int flux, x;
for (int i = 1; i <= n; i++)
{
tata[i] = 0;
dist[i] = inf;
}
dist[s] = 0;
tata[s] = s;
//fout << dist[d] << endl;
while (flag)
{
flag = false;
for (int i = 1; i <= n; i++)
for (int j = 0 ; j < (int)V[i].size(); j++)
if (GR[i][V[i][j]] > 0 && dist[i] + C[i][V[i][j]] < dist[V[i][j]])
{
//fout << V[i][j] << " = " << dist[i] << "+" << C[i][V[i][j]] << "\n";
dist[V[i][j]] = dist[i] + C[i][V[i][j]];
tata[V[i][j]] = i;
flag = true;
}
}
//fout << dist[d] << "\n";
if (dist[d] < inf/2)
{
x = d;
flux = inf;
while (x != s)
{
flux = min(GR[tata[x]][x],flux);
x = tata[x];
}
x = d;
while (x != s)
{
GR[tata[x]][x] -= flux;
GR[x][tata[x]] += flux;
x = tata[x];
}
return flux*dist[d];
}
return 0;
}
int main()
{
int n,m,s,d,x,y,c,z;
ll int fluxmax = 0;
fin >> n >> m >> s >> d;
for (int i = 0; i < m; i++)
{
fin >> x >> y >> c >> z;
GR[x][y] = c;
C[x][y] = z;
C[y][x] = -z;
V[x].pb(y);
V[y].pb(x);
}
x = 1;
while (x != 0)
{
//cout << x << "\n";
x = Drum(n,s,d);
fluxmax += x;
//fout << fluxmax;
}
fout << fluxmax;
return 0;
}