# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1030227 | Agreb | 가장 긴 여행 (IOI23_longesttrip) | C++17 | 27 ms | 600 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){
vector <int> path, clique, used(N);
for (int i = 0; i <= 2; i++){
for (int j = 0; j < i; j++){
if (are_connected({i}, {j})){
path = {i, j};
used[i] = used[j] = 1;
break;
}
}
if (!path.empty()) break;
}
mt19937 rnd(239);
for (int v = 0; v < N; v++){
if (used[v]) continue;
int P = path.size();
int st = path[0], fin = path[P-1];
if (!are_connected(path, {v})){
clique.push_back(v);
continue;
}
if (are_connected({st}, {v})){
reverse(path.begin(), path.end());
path.push_back(v);
continue;
}
if (P > 1 && are_connected({fin}, {v})){
path.push_back(v);
continue;
}
vector <int> perm;
for (int i = 1; i < P-1; i++) perm.push_back(i);
shuffle(perm.begin(), perm.end(), rnd);
for (int i : perm){
int u = path[i];
if (are_connected({u}, {v})){
vector <int> npath;
for (int j = 0; j < P; j++)
npath.push_back(path[(j+i+1)%P]);
npath.push_back(v);
path = npath;
break;
}
}
}
assert(path.size() + clique.size() == N);
if (path.size() >= clique.size()) return path;
else return clique;
}
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... |