Cod sursa(job #604219)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 21 iulie 2011 00:13:33
Problema Flux maxim de cost minim Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.58 kb
#include<stdio.h>
#define N 350
int n,m,k,c[N][N],f[N][N],p,i,s,d,pre[N],t,l,h[N],poz[N],j,g[N][N],deg[N],o[N][N],b[N];
long e;
int main()
{freopen("fmcm.in","r",stdin),freopen("fmcm.out","w",stdout);
scanf("%d%d%d%d",&n,&m,&s,&d),s--,d--;
while(m--)
          scanf("%d%d%d%d",&i,&j,&l,&p),i--,j--,g[i][deg[i]++]=j,g[j][deg[j]++]=i,o[i][j]=p,o[j][i]=-p,c[i][j]=l;
while(1)      
          {for(i=0;i<n;i++)
                   poz[i]=pre[i]=-1,b[i]=10001;
          b[s]=l=0,m=10001,h[l++]=s;
          while(l)
                   {i=h[0],poz[i]=-1,h[0]=h[--l],poz[h[0]]=0;
                   for(j=1;j<l-1;j<<=1)
                   if(b[h[j+1]]<b[h[0]])
                          j++,p=h[j],h[j]=h[0],h[0]=p,poz[h[j]]=j,poz[h[0]]=0;
                   for(k=0;k<deg[i];k++)
                   if(c[i][g[i][k]]>f[i][g[i][k]]&&b[g[i][k]]>b[i]+o[i][g[i][k]])
                          {b[g[i][k]]=b[i]+o[i][g[i][k]],pre[g[i][k]]=i;
                          if(poz[g[i][k]]==-1)
                                 j=poz[g[i][k]]=l,h[l++]=g[i][k];
                          else
                                 j=poz[g[i][k]];
                          for(t=j>>1;t&&b[t]>b[j];t>>=1)
                                 p=h[j],h[j]=h[t],h[t]=p,poz[h[j]]=j,poz[h[t]]=t;}}
          if(pre[d]==-1)
                   break;
          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+=b[d]*m;}
printf("%ld",e);
fclose(stdin),fclose(stdout);
return 0;}