# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967563 | happy_node | Amusement Park (JOI17_amusement_park) | C++17 | 0 ms | 0 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 "Joi.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX=10005;
vector<int> adj[MX];
int timer=-1;
vector<int> euler;
int sz[MX], par[MX], tin[MX], tout[MX];
void dfs(int v, int p) {
tin[v]=++timer;
euler.push_back(tin[v]);
sz[v]=1;
par[v]=p;
for(auto u:adj[v]) {
if(u==p) continue;
dfs(u,v);
sz[v]+=sz[u];
}
tout[v]=timer;
}
struct DSU {
int par[MX];