# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549990 | hohohaha | Meetings 2 (JOI21_meetings2) | C++14 | 251 ms | 94284 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 fori(i, l, r) for(int i = (int) (l); i <= (int) (r); i++)
#define ford(i, r, l) for(int i = (int) (r); i >= (int) (l); i--)
#define ii pair<int, int>
#define fi first
#define se second
#define vi vector<int>
#define eb emplace_back
#define em emplace
#define sp ' '
#define endl '\n'
#define int long long
const int maxn =2e5 +5;
int n;
vi g[maxn];
int tim;
int tin[maxn];
int dep[maxn];
int sz[maxn];
int euler[maxn * 2];
int lca[21][maxn * 2];
vector<int> nodes_sz[maxn];
pair<int, ii> Dia;
int ans[maxn];
void dfs_sz(int u, int p) {
sz[u] = 1;
for(int v: g[u]) {
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... |