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 pb push_back
int n,d;
vector<int> longest_trip(int N, int D)
{
deque<int>trip;
trip.pb(0);
n=N,d=D;
for(int i=1;i<n;i++){
bool ok=are_connected({trip.back()},{i});
if(ok)trip.pb(i);
else if(trip.size()==1){
trip.pb(i+1);
trip.pb(i);
i++;
}else{
trip.push_front(i);
}
}
return vector<int>(trip.begin(),trip.end());
}
# | 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... |