presscoder's blog

By presscoder, history, 6 weeks ago, In English

Looking at question,Its dijstra implementation

using namespace std;

vector adj[200005]; ll mod=1e9+7; ar<ll,5> d[200005]; ll vis[200005]; int main(){

ll n,m;
cin>>n>>m;
while(m--){
    ll x,y,w;
    cin>>x>>y>>w;
    adj[x].pb(mpa(y,w));
}

for(ll i=1;i<=n;i++){

    d[i][0]=i;//dest
    d[i][1]=(i==1?0:1e18);//distance
    d[i][2]=(i==1?1:0);//no of routes
    d[i][3]=(i==1?1:1e18);//min_nodes
    d[i][4]=(i==1?1:0);//max_nodes

}






set< ar<ll,5> > q;

q.insert(d[1]);

while(q.size()){
    ar<ll,5> h=*q.begin();
    q.erase(q.begin());


    ll v=h[0];
    vis[v]=1;

    for(const auto &u:adj[v]){
       ll prop=d[v][1]+u.ss;
       ll to=u.ff;

       if(d[to][1] > prop){
         if(q.find(d[to])!=q.end())q.erase(q.find(d[to]));
         d[to][1]=prop;
         d[to][2]=d[v][2];
         d[to][3]=d[v][3]+1;
         d[to][4]=d[v][4]+1;
         q.insert(d[to]);
       }else if(d[to][1]==prop){
         q.erase(q.find(d[to]));
         d[to][2]=(d[to][2]+d[v][2])%mod;
         d[to][3]=max(d[to][3],d[v][3]+1);
         d[to][4]=min(d[to][4],d[v][4]+1);
         q.insert(d[to]);
       }


    }


}

 cout<<d[n][1]<<" "<<d[n][2]%mod<<" "<<d[n][4]-1<<" "<<d[n][3]-1;

}

Above is giving Wrong answer for 2 cases can anyone help me to find whats wrong in this

 
 
 
 
  • Vote: I like it
  • -9
  • Vote: I do not like it

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by presscoder (previous revision, new revision, compare).