# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210091 | arjun_9426 | Chase (CEOI17_chase) | C++17 | 335 ms | 262392 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>
#define long long long
using namespace std;
const int N = 1e5+5;
int n, k;
long A[N], S[N], ans;
long dp1[N][105], dp2[N][105]; //up, down
vector<int> g[N];
void dfs(int u, int p) {
dp1[u][0] = dp2[u][0] = 0;
dp1[u][1] = S[u];
long mx1[105] = {0}, mx2[105] = {0};
for(int v : g[u]) if(v != p) {
dfs(v, u);
for(int i = 1; i <= k; i++) {
dp1[u][i] = max({dp1[u][i], dp1[v][i], dp1[v][i-1] + S[u] - A[v]});
dp2[u][i] = max({dp2[u][i], dp2[v][i], dp2[v][i-1] + S[u] - A[p]});
long val = dp2[v][i];
if(val >= mx1[i]) swap(mx1[i], val);
if(val >= mx2[i]) swap(mx2[i], val);
}
}
for(int v : g[u]) if(v != p) {
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... |