#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
//#define int long long
//bool are_connected(vector<int> a, vector<int> b);
vector<int> longest_trip(int n, int d) {
if (d == 3) {
vector<int> ans;
for (int i = 0; i < n; i++) ans.push_back(i);
return ans;
}
else if (d == 2) {
queue<int> ans;
ans.push(0);
for (int i = 0; i < n-1; i++) {
if (are_connected({i}, {i+1})) {
ans.push(i+1);
continue;
}
else {
if (i + 2 < n) {
ans.push(i+2);
ans.push(i+1);
}
else {
ans.pop();
ans.push(0);
ans.push(i+1);
}
i++;
}
}
vector<int> fin;
while (!ans.empty()) {
fin.push_back(ans.front());
ans.pop();
}
return fin;
}
return {};
}
# | 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... |