# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211487 | bigg | Crocodile's Underground City (IOI11_crocodile) | C++14 | 853 ms | 77884 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;
const int MAXN = 112345, MAXM = 1123456;
std::vector<int> grafo [MAXN];
std::vector<int> grafop[MAXN];
int marc[MAXN];
priority_queue<pair<long long, int>, vector<pair<long long, int> >, greater<pair<long long, int > > > q;
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
for(int i = 0; i < M; i++){
int u, v, w;
u = R[i][0];
v = R[i][1];
w = L[i];
//printf("%d %d %d\n", u, v, w);
grafo[u].push_back(v);
grafo[v].push_back(u);
grafop[u].push_back(w);
grafop[v].push_back(w);
}
for(int i = 0; i < K; i++){
q.push(make_pair(0, P[i]));
marc[P[i]] = 1;
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... |