Submission #573222

#	Time	Username	Problem	Language	Result	Execution time	Memory
573222		600Mihnea	도로 폐쇄 (APIO21_roads)	C++17	0 / 100	2081 ms	33148 KiB

roads

#include <bits/stdc++.h>
#include "roads.h"


using namespace std;

typedef long long ll;

vector<ll> minimum_closure_costs(int n, vector<int> Uedges, vector<int> Vedges, vector<int> Wedges) {

  const ll inf = (ll) 1e18 + 7;

  assert((int) Uedges.size() == n - 1);
  assert((int) Vedges.size() == n - 1);
  assert((int) Wedges.size() == n - 1);

  vector<vector<pair<int, int>>> g(n), ginit;
  vector<vector<int>> vertsWithDeg(n);
  vector<int> deg(n, 0);
  vector<vector<ll>> extras(n);
  vector<ll> dp_take(n), dp_not(n);
  vector<bool> good(n, 1);

  int maxDeg;

  vector<int> sub(n), value(n, 0), parrent(n, -1);
  for (int i = 0; i < n - 1; i++) {
    g[Uedges[i]].push_back({Vedges[i], Wedges[i]});
    g[Vedges[i]].push_back({Uedges[i], Wedges[i]});
  }

  ginit = g;

  for (int i = 0; i < n; i++) {
    deg[i] = (int) g[i].size();
    vertsWithDeg[deg[i]].push_back(i);
  }

  for (int root = 0; root < n; root++) {
    sort(g[root].begin(), g[root].end(), [&] (pair<int, int> a, pair<int, int> b) {
        return deg[a.first] < deg[b.first];});
  }

  function<void(int, int)> build = [&] (int a, int p) {
    parrent[a] = p;
    deg[a] = (int) g[a].size();
    sub[a] = 1;
    vector<pair<int, int>> kids;
    for (auto &it : g[a]) {
      int b = it.first;
      if (b == p) continue;
      value[b] = it.second;
      kids.push_back(it);
      build(b, a);
      sub[a] += sub[b];
    }
    g[a] = kids;
  };

  function<void(int)> dfs = [&] (int a) {
    assert(deg[a] > maxDeg);
    dp_not[a] = dp_take[a] = +inf;



    vector<ll> T;

    ll sum = 0;

    for (auto &it : g[a]) {
      int b = it.first;
      if (deg[b] > maxDeg) {
        ll cost = it.second;

        dfs(b);
        sum += dp_not[b];
        T.push_back(dp_take[b] - dp_not[b]);
      }
    }
    for (auto &x : extras[a]) {
      T.push_back(-x);
    }
    sort(T.begin(), T.end());

    for (int d = 0; d <= maxDeg; d++) {
      dp_not[a] = min(dp_not[a], sum + value[a]);
      if (d + 1 <= maxDeg) {
        dp_take[a] = min(dp_take[a], sum);
      }
      if (d < (int) T.size()) {
        sum += T[d];
      }
    }
  };

  build(0, -1);

  vector<ll> print(n, 0);

  ll pay = 0;

  for (maxDeg = 0; maxDeg < n; maxDeg++) {
    for (auto &v : vertsWithDeg[maxDeg]) {
      good[v] = 0;
      for (auto &it : ginit[v]) {
        int b = it.first, cost = it.second;
        if (good[b] == 0) {
          pay -= cost;
          continue;
        }
        extras[b].push_back(cost);
        pay += cost;
      }
    }
    ll sum = pay;


    for (int root = 0; root < n; root++) {
      if (deg[root] > maxDeg && (parrent[root] == -1 || deg[parrent[root]] <= maxDeg)) {

        dfs(root);
        sum += dp_not[root];

      }
    }

    print[maxDeg] = sum;

  }


  return print;
}

Compilation message (stderr)

roads.cpp: In lambda function:
roads.cpp:73:12: warning: unused variable 'cost' [-Wunused-variable]
   73 |         ll cost = it.second;
      |            ^~~~

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