Submission #318381

#TimeUsernameProblemLanguageResultExecution timeMemory
318381nekiCrocodile's Underground City (IOI11_crocodile)C++14
100 / 100
603 ms75076 KiB
#include <bits/stdc++.h> #include "crocodile.h" #define fore(i, a) for(auto&& i:a) #define fi first #define se second #define ps(a) push_back(a) #define pb(a) pop_back(a) #define sc scanf #define vc vector #define pa pair<ll, ll> #define ll int #define loop(i, a, b) for(ll i=a;i<b;i++) #define pool(i, a, b) for(ll i=a-1;i>=b;i--) #define lb lower_bound #define ub upper_bound #define all(a) a.begin(), a.end() #define llmax LLONG_MAX/2 #define llmin -LLONG_MAX/2 using namespace std; #define mn 200100 #define pa pair<ll, ll> #define ld long double vc<pa> edg[mn]; ll vis[mn]; int travel_plan(int n,int m,int r[][2],int l[],int k,int p[]){ loop(i, 0, m){ edg[r[i][0]].ps(make_pair(r[i][1], l[i])); edg[r[i][1]].ps(make_pair(r[i][0], l[i])); } priority_queue<pa> q;loop(i, 0, k) q.emplace(0, p[i]), vis[p[i]]=1; while(q.size()){ ll u=q.top().se, d=q.top().fi;q.pop(); if(vis[u]++ ==1){ if(u==0) return -d; fore(v, edg[u]) q.emplace(d-v.se, v.fi); } } }

Compilation message (stderr)

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:30:24: warning: control reaches end of non-void function [-Wreturn-type]
   30 |     priority_queue<pa> q;loop(i, 0, k) q.emplace(0, p[i]), vis[p[i]]=1;
      |                        ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...