# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
854207 | boris_mihov | Longest Trip (IOI23_longesttrip) | C++17 | 10 ms | 1128 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 <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <random>
#include <vector>
typedef long long llong;
const int MAXN = 256 + 10;
const llong INF = 1e18;
const int INTINF = 1e9;
int n;
std::mt19937 rng(420);
std::vector <int> perm;
std::vector <int> convert(const std::vector <int> &v)
{
std::vector <int> res;
for (const int &i : v) res.push_back(perm[i]);
return res;
}
bool areConnected(std::vector <int> a, std::vector <int> b)
{
std::vector <int> A, B;
for (const int &i : a) A.push_back(perm[i]);
for (const int &i : b) B.push_back(perm[i]);
return are_connected(A, B);
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... |