Cod sursa(job #596078)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 15 iunie 2011 19:16:06
Problema Flux maxim de cost minim Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.23 kb
#include<stdio.h>
#define INF 30001
#define N 351
int n,m,k,c[N][N],v[N][N],f[N][N],p,z,i,j,s,d;

long EK(int c[N][N],int v[N][N],int n,int s,int d,int f[N][N])
{int pre[N],que[INF],p,q,t,i,l,m,a[N];
long e=0;
while(1)      
       {for(i=1;i<=n;i++)
               {pre[i]=-1;
               a[i]=INF;}
       a[s]=p=q=0;
       que[q++]=s;
       while(p<q)
               {t=que[p++];
               for(i=1;i<=n;i++)
               if(f[t][i]<c[t][i]&&a[i]>a[t]+v[t][i])
                       {que[q++]=i;
                       pre[i]=t;
                       a[i]=a[t]+v[t][i];}}
       if(pre[d]<0)
               return e;
       m=INF;
       for(l=d;l!=s;l=pre[l])
       if(m>(t=c[pre[l]][l]-f[pre[l]][l]))
               m=t;
       for(l=d;l!=s;l=pre[l])
               {f[pre[l]][l]+=m;
               f[l][pre[l]]-=m;}
       e=e+a[d]*m;}}
int main()
{freopen("fmcm.in","r",stdin);
freopen("fmcm.out","w",stdout);
scanf("%d%d%d%d",&n,&m,&s,&d);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
     c[i][j]=f[i][j]=0,v[i][j]=INF;
while(m--)
     {scanf("%d%d%d%d",&i,&j,&p,&z);
     c[i][j]=p;
     v[i][j]=z;
     v[j][i]=-z;}
printf("%ld",EK(c,v,n,s,d,f));    
fclose(stdin);
fclose(stdout);
return 0;}