oj.uz

Submission #483174

# Submission time Handle Problem Language Result Execution time Memory
483174 2021-10-28T03:22:30 Z ntabc05101 Dostavljač (COCI18_dostavljac) C++14
140 / 140
 253 ms 4252 KB 
#include<bits/stdc++.h>
using namespace std;

const int mxN = 505;

int n, m;
int a[mxN];
vector<int> adj[mxN];
long long dp[mxN][mxN][2];

void dfs(int u, int p = -1) {
  dp[u][1][0] = 0;
  for (auto &to: adj[u]) {
    if (to != p) {
      dfs(to, u);
      for (int i = m; i; i--) {
        auto &res = dp[u][i][0];
        auto &res2 = dp[u][i][1];
        for (int j = 0; j < i; j++) {
          if (i - j > 2) {
            res = max(res, dp[u][i - j - 3][0] + dp[to][j][1]);
            //res2 = max(res2, dp[u][i - j - 3][1] + dp[to][j][1] + a[u]);
          }
          if (i - j > 1) {
            //res = max(res, dp[u][i - j - 2][1] + dp[to][j][0] + a[u]);
            res = max(res, dp[u][i - j - 2][0] + dp[to][j][1]);
            res2 = max(res2, dp[u][i - j - 2][1] + dp[to][j][1]);
          }
          //if (i > j) {
            res = max(res, dp[u][i - j - 1][1] + dp[to][j][0]);
          //}
        }
      }
    }
  }
  for (int i = m; i; i--) {
    for (bool j: {0, 1}) {
      dp[u][i][j] = max(dp[u][i][j], dp[u][i - 1][j] + a[u]);
    }
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);

  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 1, x, y; i < n; i++) {
    cin >> x >> y; x--; y--;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }

  dfs(0);
  long long res = 0;
  for (int i = 1; i <= m; i++) {
    res = max(res, dp[0][i][0]);
  }

  cout << res << "\n";

  return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 996 KB Output is correct
2 Correct 3 ms 844 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1100 KB Output is correct
2 Correct 36 ms 1604 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 1808 KB Output is correct
2 Correct 21 ms 1740 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2400 KB Output is correct
2 Correct 157 ms 2688 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 3424 KB Output is correct
2 Correct 52 ms 3464 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 4252 KB Output is correct
2 Correct 25 ms 3396 KB Output is correct