# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997177 | kunzaZa183 | Longest Trip (IOI23_longesttrip) | C++17 | 12 ms | 640 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> trip1(1, 0), trip2(1, 1);
int state = 2;
int num1;
for (int i = 2; i < N; i++) {
if (state == 0) {
if (are_connected(vector<int>(1, trip2.front()), vector<int>(1, i)))
trip2.push_back(i);
else
trip1.insert(trip1.begin() + num1, i);
state = 2;
} else if (state == 1) {
if (are_connected(vector<int>(1, trip1.back()), vector<int>(1, i)))
trip1.push_back(i);
else
trip2.push_back(i);
state = 2;
} else if (state == 2) {
bool b1 = are_connected(vector<int>(1, trip1.back()), vector<int>(1, i)),
b2 = are_connected(vector<int>(1, trip2.back()), vector<int>(1, i));
if (b1 && b2) {
reverse(trip2.begin(), trip2.end());
trip1.push_back(i);
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... |