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){
if (D>1){
deque <int> q={0};
if (!are_connected({0},{1}))
q.push_back(2);
q.push_back(1);
for (int i=q.size();i<N;i++)
if (are_connected({i},{q.front()}))
q.push_front(i);
else
q.push_back(i);
vector <int> res;
for (int i:q)
res.push_back(i);
return res;
}
vector <int> a,b;
a.push_back(0);
b.push_back(1);
for (int i=2;i<N;i++){
if (are_connected({a.back()},{i})){
a.push_back(i);
continue;
}
if (are_connected({b.back()},{i})){
b.push_back(i);
continue;
}
reverse(b.begin(),b.end());
for (int i:b)
a.push_back(i);
b={i};
}
if (are_connected({a[0]},{b[0]}))
reverse(a.begin(),a.end());
for (int i:b)
a.push_back(i);
return a;
}
# | 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... |