# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88011 | Pajaraja | Crocodile's Underground City (IOI11_crocodile) | C++17 | 1522 ms | 106532 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>
using namespace std;
vector<pair<int,int> > g[100007];
int cnt[100007],d[100007];
int travel_plan(int N, int M,int R[][2],int L[],int K,int P[])
{
fill(d,d+100007,-1);
for(int i=0;i<M;i++)
{
pair<int,int> p=make_pair(-L[i],R[i][0]);
g[R[i][1]].push_back(p);
p.second=R[i][1];
g[R[i][0]].push_back(p);
}
priority_queue<pair<int,int> > q;
for(int i=0;i<K;i++)
{
for(int j=0;j<g[P[i]].size();j++) q.push(g[P[i]][j]);
d[P[i]]=0;
}
while(!q.empty())
{
pair<int,int> p=q.top();
q.pop();
if(d[p.second]!=-1) continue;
cnt[p.second]++;
if(cnt[p.second]==2)
{
d[p.second]=p.first;
for(int i=0;i<g[p.second].size();i++)
{
pair<int,int> r=g[p.second][i];
r.first+=p.first;
q.push(r);
}
}
}
return -d[0];
}
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... |