# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729869 | kirakaminski968 | Crocodile's Underground City (IOI11_crocodile) | C++17 | 585 ms | 63120 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int solve(int N,int M,int (*edges)[2],int *times,int K,int *positions){
vector<pair<int,int>> adj[N];
for(int i = 0;i<M;++i){
adj[edges[i][0]].push_back({edges[i][1],times[i]});
adj[edges[i][1]].push_back({edges[i][0],times[i]});
}
vector<int> vis(N,0); vector<vector<int>> dist(N);
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
for(int i = 0;i<K;++i){
int cur = positions[i];
vis[cur]++;
dist[cur].push_back(0); dist[cur].push_back(0);
pq.push({0,cur});
}
while(!pq.empty()){
int u = pq.top().second; int dis = pq.top().first; pq.pop();
if(vis[u] >= 2) continue;
vis[u]++;
if(vis[u] != 2) continue;
if(u == 0) return dis;
for(auto p : adj[u]){
int v = p.first;
if(dist[v].size() == 2){
sort(dist[v].begin(),dist[v].end());
if(dist[v][1] > p.second+dis){
dist[v].pop_back(); dist[v].push_back(dis+p.second);
pq.push({p.second+dis,v});
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |