제출 #412325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
412325		model_code	도로 폐쇄 (APIO21_roads)	C++17	31 / 100	2065 ms	30036 KiB

roads

#include "roads.h"

// O(N^2 log(N)) solution
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(c) ((c).begin()), ((c).end())
#define sz(x) ((int)(x).size())

const ll INF = 1LL << 50;

vector<ll> minimum_closure_costs(int n, vector<int> a, vector<int> b, vector<int> w) {
  ll W = 0;
  vector<vector<int>> adj(n);
  for (int i = 0; i + 1 < n; i++) {
    adj[a[i]].push_back(i);
    adj[b[i]].push_back(i);
    W += w[i];
  }
  vector<vector<ll>> dp(n, vector<ll>(2));
  function<void(int, int, int)> dfs = [&](int s, int p, int k) {
    vector<ll> vals;
    ll sum = 0;
    for (int ind : adj[s]) {
      int v = a[ind] ^ b[ind] ^ s;
      if (v == p) continue;
      dfs(v, s, k);
      sum += dp[v][0] + w[ind];
      vals.push_back(dp[v][1] - dp[v][0] - w[ind]);
    }
    sort(all(vals));
    dp[s][0] = dp[s][1] = INF;
    for (int i = 0; i <= min(k, sz(vals)); i++) {
      dp[s][0] = min(dp[s][0], sum);
      if (i < k) dp[s][1] = min(dp[s][1], sum);
      if (i < sz(vals)) sum += vals[i];
    }
  };
  vector<ll> answers(n, 0);
  answers[0] = W;
  for (int k = 1; k < n; k++) {
    dfs(0, 0, k);
    answers[k] += dp[0][0];
    if(answers[k] == 0) break;
  }
  return answers;
}

• Subtask 1: 0 / 5
• Subtask 2: 7 / 7
• Subtask 3: 14 / 14
• Subtask 4: 10 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22