Submission #133704

#TimeUsernameProblemLanguageResultExecution timeMemory
133704BoxworldCrocodile's Underground City (IOI11_crocodile)C++14
100 / 100
729 ms61348 KiB
#include "crocodile.h" #include <bits/stdc++.h> using namespace std; typedef pair<int,int> Pa; const int maxN=100100; struct edge{int v,d,nxt;}a[20*maxN]; int vis[maxN],head[maxN]; int cnt=0; priority_queue<Pa,vector<Pa>,greater<Pa> > Q; void add(int u,int v,int d){ a[cnt].v=v; a[cnt].d=d; a[cnt].nxt=head[u]; head[u]=cnt++; } int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){ for (int i=0;i<N;i++){vis[i]=0;head[i]=-1;} for (int i=0;i<M;i++){ add(R[i][0],R[i][1],L[i]); add(R[i][1],R[i][0],L[i]); } for (int i=0;i<K;i++){ Q.push(make_pair(0,P[i])); vis[P[i]]=1; } while(!Q.empty()){ int dis=Q.top().first,u=Q.top().second;Q.pop(); if (++vis[u]!=2)continue; if (u==0)return dis; for (int i=head[u];i!=-1;i=a[i].nxt)Q.push(make_pair(dis+a[i].d,a[i].v)); } }

Compilation message (stderr)

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:32:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...