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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //mt19937_64 for ll
int rnd(int l, int r) {
return l + rng() % (r - l + 1);
}
vector<int> longest_trip(int n, int D) {
vector<int> v = {rnd(0, n - 1)};
vector<bool> vis(n); vis[v[0]] = true;
while ((int)v.size() <= ((n + 1) >> 1)) {
bool tr = false;
for (int i = 0; i < n && !tr; i++) {
if (!vis[i] && are_connected({v.back()}, {i})) {
v.push_back(i);
tr = vis[i] = true;
}
}
if (!tr) v.pop_back();
}
return v;
}
# | 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... |