# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
256652 | nandonathaniel | Tax Evasion (LMIO19_mokesciai) | C++14 | 362 ms | 46944 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;
const int MAXN=200005,LOG=18;
vector<int> adj[MAXN],que[MAXN];
int pa[LOG][MAXN],depth[MAXN],ST[MAXN],EN[MAXN],preorder[MAXN],idx;
bool coin[MAXN];
int anc(int u,int naik){
for(int i=LOG-1;i>=0;i--){
if(naik&(1<<i))u=pa[i][u];
}
return u;
}
void dfs(int now){
idx++;
ST[now]=idx;
preorder[idx]=now;
for(auto nxt : adj[now])dfs(nxt);
EN[now]=idx;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n,m,p,a;
cin >> n >> m;
for(int i=2;i<=n;i++){
cin >> p;
adj[p].push_back(i);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |