# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
497247 | FerThugGato12500 | Crocodile's Underground City (IOI11_crocodile) | C++98 | 2 ms | 2636 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;
#include "crocodile.h"
const int lmt = 100005;
struct wer{
int i, x;
};
bool operator < (const wer &a, const wer &b){
return a.x > b.x;
}
bool mark[lmt];
bool vis[lmt];
vector< pair<int, int> > ed[lmt];
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
for(int i = 0; i < N; i++){
ed[R[i][0]].push_back({R[i][1],L[i]});
ed[R[i][1]].push_back({R[i][0],L[i]});
}
priority_queue<wer> mqun;
for(int i = 0; i < K; i++){
mqun.push({P[i],0});
mark[P[i]] = true;
}
while(mqun.size()){
int ind = mqun.top().i, v = mqun.top().x; mqun.pop();
// cout<<ind<<" "<<v<<" : ";
if(mark[ind]){
cout<<"a\n";
if(ind==0){
return v;
}
vis[ind] = true;
for(int i = 0; i < ed[ind].size(); i++){
int to = ed[ind][i].first, vs = v+ed[ind][i].second;
if(!vis[to]){
mqun.push({to,vs});
}
}
}else {
mark[ind] = true;
// cout<<"b\n";
}
}
}
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... |