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)
{
if(D==3){
vector<int>ret;
for(int i=0;i<N;i++){
ret.push_back(i);
}
return ret;
}else if(D==2){
deque<int>dq;
int now=0;
if(are_connected({0},{1})){
dq.push_back(0);
dq.push_back(1);
now=2;
}else{
dq.push_back(0);
dq.push_back(2);
dq.push_back(1);
now=3;
}
for(;now<N;now++){
if(are_connected({dq.front()},{now})){
dq.push_front(now);
}else{
dq.push_back(now);
}
}
vector<int>ret;
for(auto x:dq){
ret.push_back(x);
}
return ret;
}
return {};
}
# | 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... |