# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61205 | Vahan | Crocodile's Underground City (IOI11_crocodile) | C++17 | 1856 ms | 103160 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<vector>
#include<set>
using namespace std;
#define mp make_pair
const long long MAX=100000000000000000;
long long d[200000],er[200000],ar[200000];
vector<pair<int,int> > g[200000];
set<pair<long long,long long > > ss;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
for(int i=0;i<M;i++)
{
g[R[i][0]].push_back(mp(R[i][1],L[i]));
g[R[i][1]].push_back(mp(R[i][0],L[i]));
}
for(int i=0;i<N;i++)
{
ar[i]=MAX;
er[i]=MAX;
d[i]=MAX;
}
for(int i=0;i<K;i++)
{
er[P[i]]=0;
ar[P[i]]=0;
ss.insert(mp(0,P[i]));
}
for(int i=0;i<N;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... |