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){
deque <int> q={0};
if (!are_connected({0},{1}))
q.push_back(2);
q.push_back(1);
for (int i=3;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;
}
# | 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... |