# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848632 | piOOE | Longest Trip (IOI23_longesttrip) | C++17 | 22 ms | 1108 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 "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> longest_trip(int N, int D) {
mt19937 rnd(228);
vector<int> a, b, ord(N);
iota(ord.begin(), ord.end(), 0);
shuffle(ord.begin(), ord.end(), rnd);
int known = -1;
for (int x : ord) {
if (a.empty() || b.empty()) {
(a.empty() ? a : b).push_back(x);
continue;
}
if (rnd() % 2) {
swap(a, b);
}
if (1) {
int res = are_connected({a.back()}, {x});
if (res == 1) {
a.push_back(x);
known = -1;
} else if (known != -1) {
if (known == 1) { // unreachable
a.insert(a.end(), b.rbegin(), b.rend());
b = {x};
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |