# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
840761 | emeraldblock | Longest Trip (IOI23_longesttrip) | C++17 | 18 ms | 428 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 <random>
#include "longesttrip.h"
using namespace std;
vector<int> pi,ip;
bool check(vector<int> a, vector<int> b) {
for (auto& x : a) x = pi[x];
for (auto& x : b) x = pi[x];
return are_connected(a,b);
}
vector<int> isline(vector<int> a) {
for (auto& x : a) x = pi[x];
#ifdef LOCAL
for (int i = 1; i < a.size(); ++i) {
assert(are_connected({a[i-1]}, {a[i]}));
}
#endif
return a;
}
mt19937 mt(361);
std::vector<int> longest_trip(int N, int D)
{
pi.resize(N);
iota(pi.begin(),pi.end(),0);
shuffle(pi.begin(),pi.end(),mt);
# | 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... |