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 vi vector<int>
int ask(vector<int> a,vector<int> b){
return are_connected(a,b);
}
int ask(int a,int b){
return ask(vector<int>({a}),vector<int>({b}));
}
std::vector<int> longest_trip(int N, int D){
deque<int> ans;
if(!ask(0,1)){
ans = {0,2,1};
}
else if(!ask(0,2)){
ans = {0,1,2};
}
else{
ans = {2,0,1};
}
for(int i = 3;i<N;i++){
if(ask(i,ans.front())){
ans.push_front(i);
}
else{
ans.push_back(i);
}
}
vi v;
for(auto &i:ans)v.push_back(i);
return v;
}
# | 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... |