Cod sursa(job #603795)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 18 iulie 2011 17:49:45
Problema Flux maxim de cost minim Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.48 kb
#include<stdio.h>
#define N 350
#define XS(a,b) a^=b^=a^=b
int n,m,k,c[N][N],f[N][N],p,z,i,s,d,pre[N],t,l,h[N],poz[N],j,g[N][N],deg[N]={0},o[N][N],r;
long e=0,b[N];
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,&p,&z);
          i--,j--;
          g[i][deg[i]++]=j,g[j][deg[j]++]=i;
          o[i][j]=z,o[j][i]=-z,c[i][j]=p;}
while(1)      
          {for(t=0;t<n;t++)
                   poz[t]=-1,b[t]=3000;
          b[s]=l=0,r=3000,h[l++]=s,pre[d]=-1;
          while(l)
                   {i=h[0],poz[i]=-1,h[0]=h[--l],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]]<0)
                                      {poz[g[i][k]]=j=l,h[l++]=g[i][k];
                                      for(;j>1;j>>=1)
                                              XS(poz[h[j]],poz[h[j>>1]]),XS(h[j],h[j>>1]);}}}
          if(pre[d]<0)
                   break;
          for(l=d;l!=s;l=pre[l])
          if(r>(t=c[pre[l]][l]-f[pre[l]][l]))
                   r=t;
          for(l=d;l!=s;l=pre[l])
                   f[pre[l]][l]+=r,f[l][pre[l]]-=r;
          e+=b[d]*r;}
printf("%ld",e);
fclose(stdin);
fclose(stdout);
return 0;}