Pagini recente » Cod sursa (job #1203036) | Cod sursa (job #1390593) | Cod sursa (job #2463230) | Cod sursa (job #1322361) | Cod sursa (job #1199141)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("maxflow.in");
ofstream o("maxflow.out");
vector <int> a[1001];
vector <int> b[1001];
int parc[1000],val[1001],tata[1000],semn[1001],n,m,retea[1001][1001],flux[1001][1001],ok;
void df(int nod,int v);
void marc(int nod,int father,int v){
//for(int i=1;i<=n;i++)o<<semn[i]<<" "; o<<endl;
//o<<endl;
//o<<v<<endl;
//o<<endl;
if(semn[nod])flux[father][nod] += v;
else flux[father][nod] -= v;
if(father==1){
for(int i=1;i<=n;i++)parc[i]=0;
ok=1;
df(1,1000000);
}
else marc(father,tata[father],v);
}
void df(int nod,int v){
//if(nod!=1) val[nod] = v;
//o<<v<<endl;
if(nod == n){
ok=0;
marc(n,tata[n],v);
return;
}
parc[nod]=1;
//o<<"nod-"<<nod<<" "<<b[nod].size()<<endl;
for(int i=0;i<a[nod].size();i++){
if(parc[a[nod][i]]!=1 && ok && flux[nod][a[nod][i]]<retea[nod][a[nod][i]]){
tata[a[nod][i]]=nod;
semn[a[nod][i]]=1;
// o<<"kk";
df(a[nod][i],min(v,retea[nod][a[nod][i]]-flux[nod][a[nod][i]]));
}
}
for(int i=0;i<b[nod].size();i++){
if(parc[b[nod][i]]!=1 && flux[b[nod][i]][nod]>0 && ok && b[nod][i]!=1){
tata[b[nod][i]]=nod;
semn[b[nod][i]]=0;//ok=0;
// o<<b[nod][i]<<"--"<<endl;
// o<<"iii"<<endl; return;
df(b[nod][i],min(v,flux[b[nod][i]][nod]));
}
}
ok=0;
parc[nod]=0;
}
int main(){
f>>n>>m;
int x,y,z;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)flux[i][j]=retea[i][j]=0;
for(int i=1;i<=m;i++){
f>>x>>y>>z;
a[x].push_back(y);
b[y].push_back(x);
retea[x][y] = z;
}
ok=1;
//o<<b[1].size()<<endl;
for(int i=1;i<=n;i++){
// for(int j=0;j<b[i].size();j++)o<<b[i][j]<<" ";
// o<<endl;
}
df(1,10000000);
int f = 0;
for(int i=1;i<=n;i++)
{
//for(int j=1;j<=n;j++)o<<flux[i][j]<<" ";
//o<<endl;
}
for(int j=1;j<=n;j++)f+=flux[1][j];
o<<f;
}