# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62146 | aome | Crocodile's Underground City (IOI11_crocodile) | C++17 | 1018 ms | 100468 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;
typedef pair<int, int> ii;
const int N = 100005;
int visit[N];
bool finish[N];
vector< pair<int, int> > G[N];
void add(int u, int v, int w) {
G[u].push_back({w, v}), G[v].push_back({w, u});
}
int travel_plan(int n, int M, int R[][2], int L[], int K, int P[]) {
priority_queue< ii, vector<ii>, greater<ii> > pq;
for (int i = 0; i < M; ++i) {
add(R[i][0], R[i][1], L[i]);
}
for (int i = 0; i < K; ++i) {
pq.push({0, P[i]}), finish[P[i]] = 1;
}
while (pq.size()) {
int u = pq.top().second;
int du = pq.top().first;
pq.pop(), visit[u]++;
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... |