# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29500 | Nikefor | Crocodile's Underground City (IOI11_crocodile) | C++98 | 943 ms | 161776 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 "crocodile.h"
#include<bits/stdc++.h>
#define ii pair<int,int>
using namespace std;
int visit[100002];
int res;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
priority_queue<ii, vector<ii>, greater<ii> > q;
vector<ii> adj[N+2];
for(int i=0; i<M; i++) {
int v1 = R[i][0], v2 = R[i][1];
adj[v1].push_back(make_pair(v2,i));
adj[v2].push_back(make_pair(v1,i));
}
for(int i=0; i<K; i++) { q.push(make_pair(0,P[i])); visit[P[i]]++; }
while(!q.empty()) {
ii e = q.top();
int v = e.second;
// printf("%d deyim\n", v);
q.pop();
visit[v]++;\
if(visit[v]!=2) continue;
if(!v){
res = e.first;
break;
}
for(int i=0; i<adj[v].size(); i++) {
if(visit[adj[v][i].first]<2) q.push(make_pair(e.first+L[adj[v][i].second], adj[v][i].first ));
}
}
return res;
}
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... |