Submission #616562

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007
#define INF 10000000000000000LL

template <class T>
struct heapEx {
  int *hp, *place, size; T *val;

  void malloc(int N){hp=(int*)std::malloc(N*sizeof(int));place=(int*)std::malloc(N*sizeof(int));val=(T*)std::malloc(N*sizeof(T));}
  void free(){free(hp);free(place);free(val);}
  void* malloc(int N, void *workMemory){hp=(int*)workMemory;workMemory=(void*)(hp+N);place=(int*)workMemory;workMemory=(void*)(place+N);val=(T*)workMemory;workMemory=(void*)(val+N);return workMemory;}
  void init(int N){int i;size=0;rep(i,N)place[i]=-1;}
  void up(int n){int m;while(n){m=(n-1)/2;if(val[hp[m]]<=val[hp[n]])break;swap(hp[m],hp[n]);swap(place[hp[m]],place[hp[n]]);n=m;}}
  void down(int n){int m;for(;;){m=2*n+1;if(m>=size)break;if(m+1<size&&val[hp[m]]>val[hp[m+1]])m++;if(val[hp[m]]>=val[hp[n]])break;swap(hp[m],hp[n]);swap(place[hp[m]],place[hp[n]]);n=m;}}
  void change(int n, T v){T f=val[n];val[n]=v;if(place[n]==-1){place[n] = size;hp[size++] = n;up(place[n]);}else{if(f < v) down(place[n]); else if(f > v) up(place[n]);}}
  int pop(void){int res=hp[0];place[res]=-1;size--;if(size)hp[0]=hp[size],place[hp[0]]=0,down(0);return res;}
};


int N, M, st, ed;
int L[300000];
vector<int> s[300000], w[300000], wws[300000];

ll cost1[300000], cost2[300000];

vector<int> des1[30000], des2[30000], rev_a[30000], rev_i[30000];
vector<ll>  cos1[30000], cos2[30000];

int main(){
  int i, j, k, ind;
  int a, b, c;
  ll nc;
  heapEx<ll> heap;

  reader(&N,&M,&st,&ed);
  rep(i,M){
    reader(L+i);
    rep(j,L[i]){
      reader(&k);
      s[i].push_back(k);
    }
    rep(j,L[i]-1){
      reader(&k);
      w[i].push_back(k);
    }
    wws[i].push_back(0);
    rep(j,L[i]-1) wws[i].push_back(wws[i][j]+w[i][j]);
  }

  rep(i,M){
    rep(j,L[i]-1){
      a = s[i][j];
      b = s[i][j+1];
      c = s[i][L[i]-1];
      des1[a].push_back(b);
      des2[a].push_back(c);
      cos1[a].push_back(wws[i][j+1] - wws[i][j]);
      cos2[a].push_back(wws[i][L[i]-1] - wws[i][j]);

      rev_a[b].push_back(a);
      rev_i[b].push_back(des1[a].size()-1);
    }
    REP(j,1,L[i]){
      a = s[i][j];
      b = s[i][j-1];
      c = s[i][0];
      des1[a].push_back(b);
      des2[a].push_back(c);
      cos1[a].push_back(wws[i][j] - wws[i][j-1]);
      cos2[a].push_back(wws[i][j] - wws[i][0]);

      rev_a[b].push_back(a);
      rev_i[b].push_back(des1[a].size()-1);
    }
  }

  heap.malloc(N);

  heap.init(N);
  rep(i,N) cost2[i] = INF;
  cost2[ed] = 0;
  heap.change(ed,0);
  while(heap.size){
    i = heap.pop();
    rep(j,des1[i].size()){
      k = des1[i][j];
      if(cost2[k] > cost2[i]+cos1[i][j]){
        cost2[k] = cost2[i]+cos1[i][j];
        heap.change(k,cost2[k]);
      }
    }
  }

  heap.init(N);
  rep(i,N) cost1[i] = INF;
  cost1[ed] = 0;
  heap.change(ed,cost1[ed]);
  while(heap.size){
    i = heap.pop();
    rep(j,rev_a[i].size()){
      a = rev_a[i][j];
      ind = rev_i[i][j];

      b = des1[a][ind];
      c = des2[a][ind];
      nc = max(cos1[a][ind]+cost1[b], cos2[a][ind]+cost2[c]);
      if(cost1[a] > nc){
        cost1[a] = nc;
        heap.change(a,cost1[a]);
      }
    }
  }
  
  writerLn(cost1[st]);

  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void reader(double*)’:
./Main.cpp:15:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 void reader(double *x){scanf("%lf",x);}
                                      ^

Judge Result