Pagini recente » Cod sursa (job #279068) | Cod sursa (job #670530) | Cod sursa (job #1155044) | Cod sursa (job #113530) | Cod sursa (job #2592768)
#include<fstream>
#include<algorithm>
#include<vector>
#include<queue>
#define INF 2000000000
using namespace std;
ifstream f("cmcm.in");
ofstream g("cmcm.out");
vector<int>a[604];
int n,m,s,d,flux,sol,r[604][604],z[604][604],tata[604],dist[604];
bool inq[604];
queue<int>q;
struct elem
{
int x,y;
};
elem edge[50002];
inline bool bellman_ford()
{
int i,l,p;
for(i=1;i<=n+m+2;i++)
dist[i]=INF,tata[i]=0;
dist[s]=0;
q.push(s);
inq[s]=1;
while(!q.empty())
{
p=q.front();
q.pop();
inq[p]=0;
l=a[p].size();
for(i=0;i<l;i++)
if(r[p][a[p][i]]>0&&dist[a[p][i]]>dist[p]+z[p][a[p][i]])
{
dist[a[p][i]]=dist[p]+z[p][a[p][i]];
tata[a[p][i]]=p;
if(inq[a[p][i]]==0)
{
q.push(a[p][i]);
inq[a[p][i]]=1;
}
}
}
return dist[d]!=INF;
}
inline void fmcm()
{
int i,flow,cost;
while(bellman_ford())
{
flow=INF;
for(i=d;i!=s;i=tata[i])
{
flow=min(flow,r[tata[i]][i]);
if(flow==0)
break;
}
if(flow!=0&&flow!=INF)
{
cost=0;
for(i=d;i!=s;i=tata[i])
{
r[tata[i]][i]-=flow;
r[i][tata[i]]+=flow;
cost+=z[tata[i]][i];
}
flux+=flow;
sol+=flow*cost;
}
}
}
int main()
{
int i,x,y,zz,e;
f>>n>>m>>e;
for(i=1;i<=e;i++)
{
f>>x>>y>>zz;
y+=n;
a[x].push_back(y);
a[y].push_back(x);
r[x][y]+=1;
z[x][y]=zz;
z[y][x]=-zz;
edge[i]={x,y};
}
s=n+m+1;
for(i=1;i<=n;i++)
{
a[s].push_back(i);
a[i].push_back(s);
r[s][i]+=1;
}
d=n+m+2;
for(i=n+1;i<=n+m;i++)
{
a[i].push_back(d);
a[d].push_back(i);
r[i][d]+=1;
}
fmcm();
g<<flux<<" "<<sol<<'\n';
for(i=1;i<=e;i++)
if(r[edge[i].x][edge[i].y]==0)
g<<i<<" ";
return 0;
}