| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 722692 | rainboy | Winter Driving (CCO19_day1problem3) | C11 | 10 ms | 340 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>
#include <stdlib.h>
#define N 200000
long long max(long long a, long long b) { return a > b ? a : b; }
int *ej[N], eo[N];
void append(int i, int j) {
int o = eo[i]++;
if (o >= 2 && (o & o - 1) == 0)
ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
ej[i][o] = j;
}
int aa[N]; long long dp[N], dq[N];
void dfs(int p, int i) {
int o;
dp[i] = aa[i], dq[i] = 0;
for (o = eo[i]; o--; ) {
int j = ej[i][o];
if (j != p) {
dfs(i, j);
dp[i] += dp[j], dq[i] += dq[j];
}
}
dq[i] += aa[i] * dp[i];
}
int main() {
int n, i, j, o, b;
long long ans, sum1, sum2;
scanf("%d", &n);
for (i = 0; i < n; i++)
ej[i] = (int *) malloc(2 * sizeof *ej[i]);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
for (j = 1; j < n; j++) {
scanf("%d", &i), i--;
append(i, j), append(j, i);
}
ans = 0;
for (i = 0; i < n; i++) {
dfs(-1, i);
for (b = 0; b < 1 << eo[i]; b++) {
sum1 = sum2 = 0;
for (o = 0; o < eo[i]; o++) {
j = ej[i][o];
if ((b & 1 << j) == 0)
sum1 += dp[j];
else
sum2 += dp[j];
}
ans = max(ans, dq[i] + (long long) sum1 * sum2);
}
}
for (i = 0; i < n; i++)
ans -= aa[i];
printf("%lld\n", ans);
return 0;
}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... | ||||
