# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
896519 | 2024-01-01T15:22:43 Z | LCJLY | Crocodile's Underground City (IOI11_crocodile) | C++14 | 2 ms | 4444 KB |
#include "crocodile.h" // #include <bits/stdc++.h> using namespace std; typedef pair<int,int>pii; //#define int long long int travel_plan(int n, int m, int r[][2], int w[], int k, int p[]){ vector<pii>adj[n+5]; for(int x=0;x<m;x++){ adj[r[x][0]].push_back({r[x][1],w[x]}); adj[r[x][1]].push_back({r[x][0],w[x]}); } pii dist[n+5]; memset(dist,-1,sizeof(dist)); priority_queue<pii,vector<pii>,greater<pii>>pq; for(int x=0;x<k;x++){ dist[p[x]]={0,0}; pq.push({0,p[x]}); } bool visited[n+5]; memset(visited,0,sizeof(visited)); while(!pq.empty()){ pii cur=pq.top(); pq.pop(); int x=cur.second; int d=cur.first; if(dist[x].second==-1||dist[x].second!=d) continue; visited[x]=true; for(auto it:adj[x]){ int nx=it.first; int nd=d+it.second; if(dist[nx].second!=-1&&dist[nx].second<=nd) continue; if(dist[nx].first==-1||nd<=dist[nx].first){ dist[nx].second=dist[nx].first; dist[nx].first=nd; pq.push({nd,nx}); } else{ dist[nx].second=nd; pq.push({nd,nx}); } } } if(dist[0].second!=-1){ return dist[0].second; } else return -1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 4444 KB | Output is correct |
2 | Correct | 1 ms | 4444 KB | Output is correct |
3 | Correct | 2 ms | 4444 KB | Output is correct |
4 | Incorrect | 1 ms | 4444 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 4444 KB | Output is correct |
2 | Correct | 1 ms | 4444 KB | Output is correct |
3 | Correct | 2 ms | 4444 KB | Output is correct |
4 | Incorrect | 1 ms | 4444 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 4444 KB | Output is correct |
2 | Correct | 1 ms | 4444 KB | Output is correct |
3 | Correct | 2 ms | 4444 KB | Output is correct |
4 | Incorrect | 1 ms | 4444 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |