# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
727424 | model_code | Cat Exercise (JOI23_ho_t4) | C++17 | 404 ms | 59888 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;
typedef long long ll;
typedef vector<ll> vll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define MAX_N 200010
ll n,p[MAX_N],a[MAX_N],b[MAX_N];
vll g[MAX_N];
struct LCA{
#define D 20
ll depth[MAX_N],par[MAX_N][D];
void dfs(ll x,ll from,ll d){
depth[x]=d;
par[x][0]=from;
for(auto y:g[x])if(y!=from){
dfs(y,x,d+1);
}
}
void init(){
dfs(0,0,0);
rep(d,D-1){
rep(i,n){
par[i][d+1]=par[par[i][d]][d];
# | 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... |