# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
846710 | Trisanu_Das | Longest Trip (IOI23_longesttrip) | C++17 | 282 ms | 344 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 "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int N, int D) {
vector<int> ans = {0};
bool vis[N];
vis[0] = true;
bool adj[N][N];
for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) if(i != j) adj[i][j] = adj[j][i] = are_connected({i}, {j});
while (true) {
if (ans.size() == N) return ans;
bool flag = false;
for (int i = 0; i < N && !flag; i++) {
if (!vis[i]) {
if (adj[ans[0]][i]) {
ans.insert(ans.begin(), i);
flag = true;
vis[i] = true;
break;
}
if (adj[ans.back()][i]) {
ans.push_back(i);
flag = true;
vis[i] = true;
break;
}
for (int j = 0; j < ans.size(); j++) {
if (adj[ans[j]][i]) {
vector<int> new_path;
new_path.insert(new_path.end(), ans.begin() + j + 1, ans.end());
new_path.insert(new_path.end(), ans.begin(), ans.begin() + j + 1);
ans = new_path;
ans.push_back(i);
flag = true;
vis[i] = true;
break;
}
}
}
}
if (!flag) {
if (ans.size() >= (N - ans.size())) return ans;
ans.clear();
for (int i = 0; i < N; ++i) if (!vis[i]) ans.push_back(i);
return ans;
}
}
}
Compilation message (stderr)
# | 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... |