# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110490 | wilwxk | Ball Machine (BOI13_ballmachine) | C++11 | 1088 ms | 21368 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=1e5+5;
const int LOGN=22;
vector<int> g[MAXN];
int dp[MAXN][LOGN];
int prof[MAXN], gin[MAXN];
int marc[MAXN];
set<int> s;
int n, q, root;
int contv;
void dfs(int cur, int p) {
for(auto viz : g[cur]) {
if(viz==p) continue;
dp[viz][0]=cur;
gin[cur]++;
prof[viz]=prof[cur]+1;
dfs(viz, cur);
}
}
int pula(int cur) {
for(int i=LOGN-1; i>=0; i--) {
if(marc[dp[cur][i]]) cur=dp[cur][i];
}
return cur;
}
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... |