Submission #958806

#TimeUsernameProblemLanguageResultExecution timeMemory
958806dpsaveslivesCrocodile's Underground City (IOI11_crocodile)C++17
Compilation error
0 ms0 KiB
#include "crocodile.h" #include <bits/stdc++.h> #define int long long #define f first #define s second using namespace std; const int MAXN = 1e5+10; vector<pair<int,int>> adj[MAXN]; int travel_plan(int N,int M,int R[][2],int* L,int K,int* P){ for(int i = 0;i<M;++i){ int u = R[i][0], v = R[i][1], w = L[i]; adj[u].push_back({v,w}); adj[v].push_back({u,w}); } priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq; vector<vector<int>> dist(N); for(int i = 0;i<K;++i){ pq.push({0,P[i]}); dist[P[i]].push_back(0); dist[P[i]].push_back(0); } while(!pq.empty()){ int cd = pq.top().f, u = pq.top().s; pq.pop(); for(auto p : adj[u]){ int v = p.f, w = p.s; if(dist[v].size() == 0){ dist[v].push_back(dist[u][1]+w); //pq.push({cd+w,v}); } else if(dist[v].size() == 1){ dist[v].push_back(cd+w); sort(dist[v].begin(),dist[v].end()); pq.push({dist[v][1],v}); } else{ if(dist[u][1]+w < dist[v][0]){ dist[v][1] = dist[v][0]; dist[v][0] = dist[u][1]+w; pq.push({dist[v][1],v}); } else if(dist[u][1]+w < dist[v][1]){ dist[v][1] = dist[u][1]+w; pq.push({dist[v][1]+w,v}); } } } } return dist[0][1]; }

Compilation message (stderr)

/usr/bin/ld: /tmp/cc1lsXf2.o: in function `main':
grader.cpp:(.text.startup+0x36): undefined reference to `travel_plan(int, int, int (*) [2], int*, int, int*)'
collect2: error: ld returned 1 exit status