# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
847604 | dlalswp25 | Longest Trip (IOI23_longesttrip) | C++17 | 11 ms | 856 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;
bool ask(vector<int> a, vector<int> b) {
if (!a.size() || !b.size()) return false;
return are_connected(a, b);
}
bool adj(int a, int b) {
return ask({a}, {b});
}
std::vector<int> longest_trip(int N, int D)
{
vector<int> A = {0}, B;
for (int i = 1; i < N; i++) {
if (!B.size()) {
(adj(A.back(), i) ? A : B).push_back(i);
} else if (!adj(A.back(), i)) {
B.push_back(i);
} else if (i < N - 1) {
int j = i++;
if (adj(B.back(), i)) {
A.push_back(j);
B.push_back(i);
if (adj(j, i)) {
while (B.size()) {
A.push_back(B.back());
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... |