Cod sursa(job #610074)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 24 august 2011 16:57:36
Problema Flux maxim de cost minim Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 2.17 kb
#include<stdio.h>
#include<string.h>
#define N 351
int neg,n,m,k,j,i,l,s,d,t,q,w,c[N][N],f[N][N],p[N],h[N],r[N],g[N][N],a[N],o[N][N],b[N],u[N],y,z,v[5],x,r2;
long e;
char s1[50],*pch;
int main()
{freopen("fmcm.in","r",stdin);
freopen("fmcm.out","w",stdout);
scanf("%d%d%d%d",&n,&m,&s,&d);
while(m--)
          {gets(s1);
          r2=0;
          pch=strtok(s1," ");
          while(pch)
                 {neg=x=0;
                 for(t=0;t<strlen(pch);t++)
                 if(pch[t]>='0'&&pch[t]<='9')
                        x=x*10+(pch[t]-'0');
                 else
                        if(pch[t]=='-')
                               neg=1;
                 if(neg)
                        x=-x;
                 v[++r2]=x;
                 pch=strtok(NULL," ");}
          i=v[1],j=v[2],l=v[3],k=v[4];
          g[i][a[i]++]=j,g[j][a[j]++]=i,o[i][j]=k,o[j][i]=-k,c[i][j]=l;}
while(!z)      
          {for(i=1;i<=n;i++)
                   b[i]=10001,r[i]=0;
          b[s]=p[d]=0,h[1]=s,m=10001,l=1;
          while(l)
                   {i=h[1],r[i]=y=0,h[1]=h[l--],r[h[1]]=1;
                   for(j=1;(t=2*j)<=l&&!y;j=t)
                          {if(t<l&&b[h[t+1]]<b[h[t]])
                                 t++;
                          if(b[h[j]]<=b[h[t]])
                                 y=1;
                          else
                                 k=h[j],h[j]=h[t],h[t]=k,r[h[j]]=j,r[h[t]]=t;}
                   for(k=0,j=g[i][0];k<a[i];j=g[i][++k])
                   if(b[j]>b[i]+o[i][j]&&c[i][j]>f[i][j])
                          {b[j]=b[i]+o[i][j],p[j]=i;
                          if(!r[j])
                                 h[++l]=j,r[j]=l;
                          for(t=r[j];t>3&&b[h[t]]<b[h[q=t/2]];t=q)
                                 w=h[t],h[t]=h[q],h[q]=w,r[h[t]]=t,r[h[q]]=q;}}
          if(!p[d])
                   z=1;
          else
                   {for(l=d;l!=s;l=p[l])
                   if(m>(k=c[p[l]][l]-f[p[l]][l]))
                           m=k;
                   for(l=d;l!=s;l=p[l])
                           f[p[l]][l]+=m,f[l][p[l]]-=m;
                   e=e+b[d]*m;}}
printf("%ld",e);
return 0;}