# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428703 | pavement | Park (JOI17_park) | C++17 | 2099 ms | 244936 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 "park.h"
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(128302);
#define mp make_pair
#define mt make_tuple
#define pb push_back
static int N, Place[1405], link[1405], sz[1405];
static bool vis[1405];
vector<int> adj[1405];
map<tuple<int, int, vector<int> >, bool> ret;
bool query(int a, int b, int Place[]) {
if (a > b) return query(b, a, Place);
vector<int> tmp;
for (int i = 0; i < N; i++) tmp.pb(Place[i]);
if (ret.find(mt(a, b, tmp)) != ret.end()) return ret[mt(a, b, tmp)];
else return ret[mt(a, b, tmp)] = Ask(a, b, Place);
}
int find(int x) {
if (x == link[x]) return x;
return link[x] = find(link[x]);
}
void unite(int a, int b) {
a = find(a);
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... |