# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011612 | mdn2002 | Longest Trip (IOI23_longesttrip) | C++17 | 13 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 "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int N, int D) {
vector<int> a, b, c;
for (int i = 0; i < N; i ++) c.push_back(i);
srand(12312);
random_shuffle (c.begin(), c.end());
a.push_back(c[0]);
int not_connected = 0;
for (int I = 1; I < N; I ++) {
int x = a.back(), i = c[I] , y = are_connected({x}, {i});
if (y) {
a.push_back(i);
not_connected = 0;
continue;
}
if (b.size() == 0) {
b.push_back(i);
not_connected = 1;
}
else {
if (not_connected) {
b.push_back(i);
not_connected = 1;
continue;
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... |