# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
948916 | kim | Longest Trip (IOI23_longesttrip) | C++17 | 11 ms | 860 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;
#define eb emplace_back
#define sz(x) (int)(x).size()
#define ask are_connected
std::vector<int> longest_trip(int N, int D)
{
vector<int> v1,v2;
v1.eb(0), v2.eb(1);
int cur=1;
for(int i=2;i<N;++i){
if(ask({v1.back()},{i})) v1.eb(i), cur=i;
else if(cur!=i-1||ask({v2.back()},{i})) v2.eb(i);
else{
while(sz(v2)) v1.eb(v2.back()), v2.pop_back();
v2.eb(i);
cur=i;
}
}
if(!ask(v1,v2)) return sz(v1)>sz(v2)?v1:v2;
if(ask({v1.back()},{v2.back()})){
for(int i=sz(v2)-1;i>=0;--i) v1.eb(v2[i]);
return v1;
}
if(ask({v1.front()},{v2.back()})){
for(auto &e:v1) v2.eb(e);
return v2;
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... |