# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095405 | giaminh2211 | Cat Exercise (JOI23_ho_t4) | C++14 | 178 ms | 51836 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;
using ll=long long;
const int N=2e5+13;
int n;
int a[N];
int h[N];
int d[N];
vector<int> g[N];
int x, y;
int par[N];
int st[N][20];
int val[N];
ll dp[N];
void dfs(int v, int par){
for(int c: g[v]){
if(c==par) continue;
d[c]=d[v]+1;
st[c][0]=v;
for(int j=1; j<20; j++){
st[c][j]=st[st[c][j-1]][j-1];
}
dfs(c, v);
}
}
void scan(){
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |