# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
899578 | Szil | Longest Trip (IOI23_longesttrip) | C++17 | 9 ms | 608 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>
#include "longesttrip.h"
using namespace std;
// bool are_connected(int[] A, int[] B);
vector<int> longest_trip(int N, int D)
{
assert(D == 2);
queue<int> q;
vector<int> ans;
for (int i = 0; i < N; i++) {
q.push(i);
}
int extra = -1;
while (!q.empty()) {
int u = q.front();
q.pop();
ans.emplace_back(u);
if (q.empty()) continue;
int v = q.front();
if (!are_connected({u}, {v})) {
q.pop();
if (q.empty()) {
extra = v;
} else {
q.push(v);
}
}
}
int insert = -1;
if (extra != -1) {
for (int i = 1; i < ans.size(); i++) {
if (are_connected({ans[i-1]}, {extra}) && are_connected({extra}, {ans[i]})) {
insert = i;
break;
}
}
}
vector<int> res;
for (int i = 0; i < ans.size(); i++) {
if (i == insert) res.emplace_back(extra);
res.emplace_back(ans[i]);
}
for (int i = 1; i < res.size(); i++) {
assert(are_connected({res[i-1]}, {res[i]}));
}
return res;
}
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... |