# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
630605 | valerikk | Meetings 2 (JOI21_meetings2) | C++17 | 866 ms | 33420 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>
using namespace std;
#define x first
#define y second
#define all(a) begin(a), end(a)
#define sz(a) ((int) (a).size())
using ll = long long;
const int N = 200005;
int n;
vector<int> g[N];
int init_sz[N], init_d[N];
bool used[N];
int sz[N], d[N];
int ans[N], first[N];
void upd_ans(int x, int y) {
ans[2 * x] = max(ans[2 * x], y);
}
void dfs_prepare(int u = 0, int p = -1, int cd = 0) {
init_sz[u] = 1;
init_d[u] = cd;
for (int v : g[u]) {
if (v != p) {
dfs_prepare(v, u, cd + 1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |