# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
707259 | lto5 | Relay Marathon (NOI20_relaymarathon) | C++14 | 1433 ms | 129216 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 <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int64_t INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
bool minimize(T& a, T b) {
if (a > b) {
return a = b, 1;
}
return 0;
}
int n, m, k;
vector<pair<int, int>> g[N];
int spec[N];
tuple<int64_t, int, int> best_pair() {
vector<int64_t> d(n + 1, INF);
vector<int> head(n + 1, 0);
priority_queue<pair<int64_t, int>, vector<pair<int64_t, int>>, greater<pair<int64_t, int>>> pq;
for (int i = 1; i <= n; i++) {
if (spec[i]) {
head[i] = i;
d[i] = 0;
pq.emplace(d[i], i);
}
}
while (!pq.empty()) {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |