# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
205793 | ArshiaDadras | Amusement Park (JOI17_amusement_park) | C++14 | 3076 ms | 7428 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.
/* In the name of Allah */
#include<bits/stdc++.h>
#include<Joi.h>
using namespace std;
const int N = 1e4 + 5, LG = 60;
int n, m, k, a[N], b[N], root[N], h[N], sz[N], par[N], id[N];
vector<int> ed[N], adj[N];
bitset<N> mark;
void dfs_tree(int u) {
mark.set(u);
vector<int> help;
for (auto v: ed[u])
if (!mark[v]) {
help.push_back(v);
dfs_tree(v), par[v] = u;
}
adj[u] = help;
}
void change(int u) {
for (auto v: adj[u])
if (!~root[v]) {
root[v] = root[u];
change(v);
}
}
void go(int u) {
# | 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... |