# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211246 | socho | Solar Storm (NOI20_solarstorm) | C++14 | 1494 ms | 246120 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 MXN = 1000005, MXK = 22;
long long n, s, k;
long long pf[MXN];
vector<int> subs[MXN];
int par[MXN][MXK];
int depth[MXN];
void dfs_decomp(int node, int last, int dep) {
depth[node] = dep;
par[node][0] = last;
for (int i=1; i<MXK; i++) {
int ab = par[node][i-1];
if (ab != -1) {
par[node][i] = par[ab][i-1];
}
}
for (int i=0; i<subs[node].size(); i++) {
if (subs[node][i] == last) continue;
dfs_decomp(subs[node][i], node, dep+1);
}
}
int kth_parent(int n, int k) {
k = min(k, depth[n]);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |