# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124793 | model_code | Cat in a tree (BOI17_catinatree) | C++17 | 97 ms | 19960 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<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N,D;
vector<vector<int> > T;
vector<int> opt, optdist, sacrdist;
void DFS(int pos) {
// Base case: pos is a leaf
if(T[pos].size() == 0) {
opt[pos] = 1;
optdist[pos] = 0;
sacrdist[pos] = D;
return;
}
int v = T[pos][0];
DFS(v);
if(optdist[v] + 1 >= D) {
opt[pos] = opt[v] + 1;
optdist[pos] = 0;
sacrdist[pos] = optdist[v] + 1;
} else {
opt[pos] = opt[v];
optdist[pos] = optdist[v] + 1;
sacrdist[pos] = sacrdist[v] + 1;
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... |