# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
965090 | Pannda | Fun Tour (APIO20_fun) | C++17 | 1 ms | 600 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 "fun.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> createFunTour(int n, int _400000) {
auto allDistance = [&](int u) {
vector<int> res(n);
for (int v = 0; v < n; v++) {
res[v] = hoursRequired(u, v);
}
return res;
};
int r = [&]() -> int {
vector<int> dist = allDistance(0);
return max_element(dist.begin(), dist.end()) - dist.begin();
}();
vector<int> dist = allDistance(r);
int ir = max_element(dist.begin(), dist.end()) - dist.begin();
vector<int> idist = allDistance(ir);
vector<int> order(n);
iota(order.begin(), order.end(), 0);
sort(order.begin(), order.end(), [&](int u, int v) { return dist[u] > dist[v]; });
vector<int> iorder = order;
sort(order.begin(), order.end(), [&](int u, int v) { return idist[u] > idist[v]; });
vector<bool> used(n, false);
bool toggle = false;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |