제출 #530556

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
530556		cig32	Dostavljač (COCI18_dostavljac)	C++17	14 / 140	118 ms	4348 KiB

dostavljac

#include "bits/stdc++.h"
using namespace std;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 505;
const int MOD = 1e9 + 7;
#define int long long
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int a[MAXN];
vector<int> adj[MAXN];
int dp[MAXN][MAXN][2]; // k = 1: returned to the root
void dfs(int node, int prv) {
  vector<int> v;
  v.push_back(-1);
  for(int x: adj[node]) {
    if(x != prv) {
      dfs(x, node);
      v.push_back(x);
    }
  }
  int k = v.size() - 1;
  int sub_dp[k + 1][MAXN][2];
  for(int i=0; i<MAXN; i++) sub_dp[0][i][0] = sub_dp[0][i][1] = 0;
  sub_dp[0][1][0] = sub_dp[0][1][1] = a[node];
  for(int i=1; i<=k; i++) {
    sub_dp[i][0][0] = sub_dp[i][0][1] = 0;
    for(int j=1; j<MAXN; j++) {
      sub_dp[i][j][0] = max(sub_dp[i-1][j][0], sub_dp[i][j-1][0]);
      sub_dp[i][j][1] = max(sub_dp[i-1][j][1], sub_dp[i][j-1][1]);
      for(int l=1; l<j; l++) {
        sub_dp[i][j][0] = max(sub_dp[i][j][0], sub_dp[i-1][j-l-1][1] + max(dp[v[i]][l][0], dp[v[i]][l][1]));
        if(l+1 < j) sub_dp[i][j][1] = max(sub_dp[i][j][1], sub_dp[i-1][j-l-2][1] + dp[v[i]][l][1]); 
      }
      sub_dp[i][j][0] = max(sub_dp[i][j][0], sub_dp[i][j][1]);
    }
  }
  for(int i=1; i<MAXN; i++) {
    for(int j=0; j<2; j++) {
      dp[node][i][j] = sub_dp[k][i][j];
    }
  }
}
void solve(int tc) {
  int n, m;
  cin >> n >> m;
  for(int i=1; i<=n; i++) cin >> a[i];
  for(int i=1; i<n; i++) {
    int a, b;
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  dfs(1, -1);
  cout << max(dp[1][m][0], dp[1][m][1]) << "\n";
}

int32_t main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}  

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14