Cod sursa(job #606393)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 4 august 2011 09:25:17
Problema Cuplaj maxim de cost minim Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.24 kb
#include<fstream.h>
#define E 50001
#define N 606
int n,m,c[N][N],f[N][N],z,i,j,a[E],b[E],u[N],p,q,t,l,nr;
long k,v[N][N],e,x[E],w[E],g[N];
int main()
{ifstream f1("cmcm.in");
ofstream f2("cmcm.out");
f1>>n>>m>>k;     
for(i=1;i<=k;i++)
     f1>>a[i]>>b[i]>>z,c[a[i]][b[i]+n+1]=1,v[a[i]][b[i]+n+1]=z,v[b[i]+n+1][a[i]]=-z;
for(i=1;i<=n;i++)
     v[0][i]=0,c[0][i]=1;
for(i=n+2;i<=n+m+1;i++)
     v[i][n+1]=0,c[i][n+1]=1;
while(1)      
       {for(i=1;i<=n+m+1;i++)
               u[i]=0,g[i]=E;
       g[0]=p=q=0,w[q++]=0;
       while(p<q)
               {t=w[p++];
               if(t&&t<=n)
                       {for(i=n+1;i<=n+m+1;i++)
                       if(f[t][i]<c[t][i]&&g[i]>g[t]+v[t][i])
                               w[q++]=i,u[i]=t,g[i]=g[t]+v[t][i];}
               else
                       {for(i=1;i<=n+1;i++)
                       if(f[t][i]<c[t][i]&&g[i]>g[t]+v[t][i])
                               w[q++]=i,u[i]=t,g[i]=g[t]+v[t][i];}}
       if(!u[n+1])
               break;
       for(l=n+1;l;l=u[l])
               f[u[l]][l]++,f[l][u[l]]--;
       e+=g[n+1];}
for(i=1;i<=k;i++)
if(f[a[i]][b[i]+n+1]==1)
       x[nr++]=i;
f2<<nr<<" "<<e<<"\n";
for(i=0;i<nr;i++)
       f2<<x[i]<<" ";    
return 0;}