void dij(int s){
fill(d,d+n,inf);
d[s]=0;
way[s]=1;
for(int i=0;i<n;i++){
int min=inf,u=-1;
for(int j=0;j<n;j++){
if(vis[j]==0&&d[j]<min){
min=d[j];u=j;
}
}
if(u==-1)return;
vis[u]=1;
for(int j=0;j<G[u].size();j++)
{int v=G[u][j].v;
int w=G[u][j].w;
if(vis[v]==0&&d[v]>d[u]+w){
d[v]=d[u]+w;
pre[v].clear();
pre[v].push_back(u);
way[v]=way[u];
people[v]=c[v]+people[u];
}
else if(vis[v]==0&&d[v]==d[u]+w){
pre[v].push_back(u);
if(people[v]<c[v]+people[u]){
people[v]=c[v]+people[u];
}
way[v]=0;
for(int i=0;i<pre[v].size();i++)
way[v]+=way[pre[v][i]];
}
}
}
}
fill(d,d+n,inf);
d[s]=0;
way[s]=1;
for(int i=0;i<n;i++){
int min=inf,u=-1;
for(int j=0;j<n;j++){
if(vis[j]==0&&d[j]<min){
min=d[j];u=j;
}
}
if(u==-1)return;
vis[u]=1;
for(int j=0;j<G[u].size();j++)
{int v=G[u][j].v;
int w=G[u][j].w;
if(vis[v]==0&&d[v]>d[u]+w){
d[v]=d[u]+w;
pre[v].clear();
pre[v].push_back(u);
way[v]=way[u];
people[v]=c[v]+people[u];
}
else if(vis[v]==0&&d[v]==d[u]+w){
pre[v].push_back(u);
if(people[v]<c[v]+people[u]){
people[v]=c[v]+people[u];
}
way[v]=0;
for(int i=0;i<pre[v].size();i++)
way[v]+=way[pre[v][i]];
}
}
}
}