# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
465374 | rainboy | Poklon (COCI17_poklon7) | C11 | 295 ms | 77256 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 <stdio.h>
#define N 1000000
int max(int a, int b) { return a > b ? a : b; }
int ll[N + 1], rr[N + 1], cc[N + 1], mx[N + 1]; long long sum;
void dfs(int i, int d) {
if (i <= 0) {
sum += -i;
mx[d] = max(mx[d], -i);
} else
dfs(ll[i], d + 1), dfs(rr[i], d + 1);
}
void print(int a) {
if (a == 0)
return;
print(a / 2);
printf("%d", a % 2);
}
int main() {
int n, i, d, d_;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", &ll[i], &rr[i]);
dfs(1, 0);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |