# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
844202 | gingers | Longest Trip (IOI23_longesttrip) | C++17 | 9 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;
std::vector<int> longest_trip(int N, int D){
#define pb push_back
vector <int> v1,v2;
v1.pb(0);
for (int i=1; i<N; i++){
if (v2.empty()){
if (are_connected({i},{v1.front()})){
v1.insert(v1.begin(),i);
} else {
v2.pb(i);
}
continue;
}
if (i+1==N){
bool a=are_connected({i},{v1.front()});
bool b=are_connected({i},{v2.front()});
if (a&&b){
v2.insert(v2.begin(),i);
for (int j:v2) v1.insert(v1.begin(),j);
v2.clear();
} else if (a){
v1.insert(v1.begin(),i);
} else if (b){
v2.insert(v2.begin(),i);
}
} else {
if (are_connected({i},{i+1})){
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... |