# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
699546 | amin | Crocodile's Underground City (IOI11_crocodile) | C++14 | 646 ms | 71872 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;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
//cout<<1000000<<endl;
int n=N;
int m=M;
vector<int>v[n],c[n];
int co[n];
for(int i=0;i<n;i++)
{
co[i]=0;
}
for(int i=0;i<m;i++)
{
int x=R[i][0];
int y=R[i][1];
// x--;
// y--;
v[x].push_back(y);
v[y].push_back(x);
c[x].push_back(L[i]);
c[y].push_back(L[i]);
}
priority_queue<pair<int,int> >pq;
int vis[n];
for(int i=0;i<K;i++)
{
// P[i]--;
co[P[i]]=1;
pq.push({0,P[i]});
}
while(!pq.empty())
{
int val=-pq.top().first;
int in=pq.top().second;
//Acout<<in<<endl;
pq.pop();
if(co[in]==1)
{
co[in]++;
if(in==0)
{
return val;
}
}else
if(co[in]==0)
{
co[in]++;
continue;
}else
continue;
for(int i=0;i<v[in].size();i++)
{
pq.push({-(val+c[in][i]),v[in][i]});
}
}
}
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... |