| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 840542 | arbuzick | Closing Time (IOI23_closing) | C++17 | 0 ms | 0 KiB |
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) {
if (d == 3) {
vector<int> ans(n);
iota(ans.begin(), ans.end(), 0);
return ans;
}
if (d == 2) {
vector<int> ans = {0};
vector<int> used(n);
used[0] = 1;
while (ans.size() < n) {
int nxt = -1;
for (int i = 0; i < n; ++i) {
if (!used[i] && are_connected({ans.back()}, {i})) {
nxt = i;
used[i] = 1;
break;
}
}
if (nxt == -1) {
reverse(ans.begin(), ans.end());
for (int i = 0; i < n; ++i) {
if (!used[i] && are_connected({ans.back()}, {i})) {
nxt = i;