oj.uz

답안 #115818

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115818 2019-06-09T08:14:52 Z IOrtroiii Chase (CEOI17_chase) C++14
100 / 100
 639 ms 168592 KB 
/*
12 2
2 3 3 8 1 5 6 7 8 3 5 4
2 1
2 7
3 4
4 7
7 6
5 6
6 8
6 9
7 10
10 11
10 12
*/
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
const int N = 100100;
const int K = 110;

int n, k;
int a[N];
vector<int> g[N];
ll go[N];
ll up[N][K];
ll down[N][K];
ll ans = 0;

void dfs(int u, int p) {
   for (int v : g[u]) if (v != p) {
      dfs(v, u);
   }
   down[u][1] = go[u];
   for (int v : g[u]) if (v != p) {
      for (int i = 1; i <= k; ++i) {
         up[u][i] = max(up[u][i], max(up[v][i], up[v][i - 1] + go[u] - a[p]));
         down[u][i] = max(down[u][i], max(down[v][i], down[v][i - 1] + go[u] - a[v]));
         ans = max(ans, up[v][i - 1] + go[u]);
         ans = max(ans, down[v][i - 1] + go[u] - a[v]);
      }
   }
   for (int i = 0; i <= k; ++i) {
      pair<ll, ll> mx = {0, 0};
      for (int v : g[u]) if (v != p) {
         mx.second = max(mx.second, up[v][i]);
         if (mx.second > mx.first) {
            swap(mx.first, mx.second);
         }
      }
      for (int v : g[u]) if (v != p) {
         ll cur;
         if (up[v][i] == mx.first) {
            cur = mx.second;
         } else {
            cur = mx.first;
         }
         ans = max(ans, cur + down[v][k - i]);
      }
   }
   for (int i = 1; i <= k; ++i) {
      pair<ll, ll> mx = {0, 0};
      for (int v : g[u]) if (v != p) {
         mx.second = max(mx.second, up[v][i - 1]);
         if (mx.second > mx.first) {
            swap(mx.first, mx.second);
         }
      }
      for (int v : g[u]) if (v != p) {
         ll cur;
         if (up[v][i - 1] == mx.first) {
            cur = mx.second;
         } else {
            cur = mx.first;
         }
         ans = max(ans, cur + down[v][k - i] + go[u] - a[v]);
      }
   }
}

int main() {
   ios_base::sync_with_stdio(false);
   cin >> n >> k;
   if (k == 0) {
      cout << 0 << endl;
      return 0;
   }
   for (int i = 1; i <= n; ++i) {
      cin >> a[i];
   }
   for (int i = 1; i < n; ++i) {
      int u, v;
      cin >> u >> v;
      g[u].push_back(v);
      g[v].push_back(u);
      go[u] += a[v];
      go[v] += a[u];
   }
   dfs(1, 0);
   cout << ans << endl;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct
7 Correct 7 ms 4096 KB Output is correct
8 Correct 6 ms 4096 KB Output is correct
9 Correct 5 ms 3712 KB Output is correct
10 Correct 7 ms 4352 KB Output is correct
11 Correct 6 ms 4352 KB Output is correct
12 Correct 6 ms 4352 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 407 ms 144084 KB Output is correct
2 Correct 398 ms 143840 KB Output is correct
3 Correct 528 ms 95892 KB Output is correct
4 Correct 224 ms 166028 KB Output is correct
5 Correct 444 ms 168504 KB Output is correct
6 Correct 435 ms 168544 KB Output is correct
7 Correct 431 ms 168028 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 4 ms 2688 KB Output is correct
5 Correct 4 ms 2688 KB Output is correct
6 Correct 4 ms 2688 KB Output is correct
7 Correct 7 ms 4096 KB Output is correct
8 Correct 6 ms 4096 KB Output is correct
9 Correct 5 ms 3712 KB Output is correct
10 Correct 7 ms 4352 KB Output is correct
11 Correct 6 ms 4352 KB Output is correct
12 Correct 6 ms 4352 KB Output is correct
13 Correct 407 ms 144084 KB Output is correct
14 Correct 398 ms 143840 KB Output is correct
15 Correct 528 ms 95892 KB Output is correct
16 Correct 224 ms 166028 KB Output is correct
17 Correct 444 ms 168504 KB Output is correct
18 Correct 435 ms 168544 KB Output is correct
19 Correct 431 ms 168028 KB Output is correct
20 Correct 443 ms 168592 KB Output is correct
21 Correct 4 ms 2688 KB Output is correct
22 Correct 459 ms 168112 KB Output is correct
23 Correct 237 ms 166176 KB Output is correct
24 Correct 469 ms 168236 KB Output is correct
25 Correct 639 ms 95500 KB Output is correct
26 Correct 398 ms 144056 KB Output is correct
27 Correct 405 ms 143992 KB Output is correct