# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
900606 | abcvuitunggio | Longest Trip (IOI23_longesttrip) | C++17 | 11 ms | 952 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={0},b={1};
int ch=0;
for (int i=2;i<N;i++){
if (are_connected({a.back()},{i})){
a.push_back(i);
ch=0;
continue;
}
if (ch||are_connected({b.back()},{i})){
b.push_back(i);
ch=1;
continue;
}
reverse(b.begin(),b.end());
for (int i:b)
a.push_back(i);
b={i};
}
if (a.size()<b.size())
swap(a,b);
if (!are_connected(a,b))
return a;
vector <int> x={0,a.size()-1},y={0,b.size()-1};
for (int i:x)
for (int j:y)
if (are_connected({a[i]},{b[j]})){
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... |