# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1034029 | vjudge1 | Meetings 2 (JOI21_meetings2) | C++17 | 399 ms | 59476 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>
#define int long long
#define ll pair<int,int>
using namespace std;
const int N=400022;
set<int> ke[N];
int maxx[N];
int h[N];
int kq[N];
int oo=1e9;
int kq2[N];
int sz[N];
void dfs(int u,int pa)
{
sz[u]=1;
for (int v : ke[u])
{
if (v==pa) continue;
dfs(v,u);
sz[u]+=sz[v];
}
}
int dfs2(int u,int pa,int kk)
{
for (int v : ke[u])
{
if (v==pa) continue;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |