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<bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
vector<int> longest_trip(int N, int D)
{
deque<int> res;
set<int> left;
for (int i = 0; i < N; i++)
{
left.insert(i);
}
if (are_connected({0}, {1}))
{
left.erase(0);
left.erase(1);
res.push_back(0);
res.push_back(1);
}
else if (are_connected({0}, {2}))
{
left.erase(0);
left.erase(2);
res.push_back(0);
res.push_back(2);
}
else
{
left.erase(1);
left.erase(2);
res.push_back(1);
res.push_back(2);
}
for (int i : left)
{
if (are_connected({i}, {res.front()}))
{
res.push_front(i);
}
else
{
res.push_back(i);
}
}
vector<int> ans;
while (!res.empty())
{
ans.push_back(res.front());
res.pop_front();
}
return ans;
}
# | 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... |