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)
{
vector<int> vi(N - 1);
iota(vi.begin(), vi.end(), 1);
vector<int> trip(1, 0);
while (vi.size() >= 2)
if (are_connected(vector<int>(1, trip.back()), vector<int>(1, vi.front())))
{
trip.push_back(vi.front());
vi.erase(vi.begin());
}
else
{
trip.push_back(vi[1]);
trip.push_back(vi[0]);
vi.erase(vi.begin());
vi.erase(vi.begin());
}
if (vi.size() == 1)
{
if (are_connected(vector<int>(1, trip.back()), vector<int>(1, vi.front())))
{
trip.push_back(vi.front());
vi.erase(vi.begin());
}
else
{
trip.push_back(trip.front());
trip.push_back(vi.front());
vi.erase(vi.begin());
trip.erase(trip.begin());
}
}
return trip;
}
# | 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... |