Luzhiled's Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub ei1333/library

:heavy_check_mark: test/verify/aoj-3022.test.cpp

Depends on

Code

// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3022
// clang-format on

#include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <vector>

#include "../../graph/others/block-cut-tree.hpp"

using namespace std;

int main() {
  int N, M;
  cin >> N >> M;
  vector<int> A(N);
  for (auto& a : A) cin >> a;
  BlockCutTree<> bct(N);
  bct.read(M);
  bct.build();
  vector<int64_t> weight(bct.tree.size());
  int64_t all = 0;
  for (int i = 0; i < N; i++) {
    weight[bct[i]] += A[i];
    all += A[i];
  }
  vector<int64_t> ans(N, all);
  for (int i = 0; i < N; i++) {
    ans[i] -= A[i];
  }
  function<int64_t(int, int)> rec = [&](int idx, int par) -> int64_t {
    int64_t mx = 0, sum = 0;
    for (auto& to : bct.tree.g[idx]) {
      if (to == par) continue;
      auto res = rec(to, idx);
      sum += res;
      mx = max(mx, res);
    }
    if (idx >= (int)bct.bc.size()) {
      ans[bct.group[idx][0]] = max(all - sum - weight[idx], mx);
    }
    return sum + weight[idx];
  };
  rec(0, -1);
  for (auto& p : ans) cout << p << "\n";
}
#line 1 "test/verify/aoj-3022.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3022
// clang-format on

#include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <vector>

#line 2 "graph/others/block-cut-tree.hpp"

#include <utility>
#line 5 "graph/others/block-cut-tree.hpp"

#line 2 "graph/connected-components/bi-connected-components.hpp"

#line 4 "graph/connected-components/bi-connected-components.hpp"

#line 2 "graph/graph-template.hpp"

#include <cstddef>
#line 6 "graph/graph-template.hpp"

template <typename T = int>
struct Edge {
  int from, to;
  T cost;
  int idx;

  Edge() = default;

  Edge(int from, int to, T cost = 1, int idx = -1)
      : from(from), to(to), cost(cost), idx(idx) {}

  operator int() const { return to; }
};

template <typename T = int>
struct Graph {
  std::vector<std::vector<Edge<T> > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  std::size_t size() const { return g.size(); }

  void add_directed_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es++);
  }

  void add_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es);
    g[to].emplace_back(to, from, cost, es++);
  }

  void read(int M, int padding = -1, bool weighted = false,
            bool directed = false) {
    for (int i = 0; i < M; i++) {
      int a, b;
      std::cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if (weighted) std::cin >> c;
      if (directed)
        add_directed_edge(a, b, c);
      else
        add_edge(a, b, c);
    }
  }

  inline std::vector<Edge<T> >& operator[](const int& k) { return g[k]; }

  inline const std::vector<Edge<T> >& operator[](const int& k) const {
    return g[k];
  }
};

template <typename T = int>
using Edges = std::vector<Edge<T> >;
#line 2 "graph/others/low-link.hpp"

#line 6 "graph/others/low-link.hpp"

#line 8 "graph/others/low-link.hpp"

/**
 * @brief Low Link(橋/関節点)
 * @see http://kagamiz.hatenablog.com/entry/2013/10/05/005213
 *
 */
template <typename T = int>
struct LowLink : Graph<T> {
 public:
  using Graph<T>::Graph;
  std::vector<int> ord, low, articulation;
  std::vector<Edge<T> > bridge;
  using Graph<T>::g;

  virtual void build() {
    used.assign(g.size(), 0);
    ord.assign(g.size(), 0);
    low.assign(g.size(), 0);
    int k = 0;
    for (int i = 0; i < (int)g.size(); i++) {
      if (!used[i]) k = dfs(i, k, -1);
    }
  }

  explicit LowLink(const Graph<T>& g) : Graph<T>(g) {}

 private:
  std::vector<int> used;

  int dfs(int idx, int k, int par) {
    used[idx] = true;
    ord[idx] = k++;
    low[idx] = ord[idx];
    bool is_articulation = false, beet = false;
    int cnt = 0;
    for (auto& to : g[idx]) {
      if (to == par && !std::exchange(beet, true)) {
        continue;
      }
      if (!used[to]) {
        ++cnt;
        k = dfs(to, k, idx);
        low[idx] = std::min(low[idx], low[to]);
        is_articulation |= par >= 0 && low[to] >= ord[idx];
        if (ord[idx] < low[to]) bridge.emplace_back(to);
      } else {
        low[idx] = std::min(low[idx], ord[to]);
      }
    }
    is_articulation |= par == -1 && cnt > 1;
    if (is_articulation) articulation.push_back(idx);
    return k;
  }
};
#line 7 "graph/connected-components/bi-connected-components.hpp"

template <typename T = int>
struct BiConnectedComponents : LowLink<T> {
 public:
  using LowLink<T>::LowLink;
  using LowLink<T>::g;
  using LowLink<T>::ord;
  using LowLink<T>::low;

  std::vector<std::vector<Edge<T> > > bc;

  void build() override {
    LowLink<T>::build();
    used.assign(g.size(), 0);
    for (int i = 0; i < (int)used.size(); i++) {
      if (!used[i]) dfs(i, -1);
    }
  }

  explicit BiConnectedComponents(const Graph<T>& g) : Graph<T>(g) {}

 private:
  std::vector<int> used;
  std::vector<Edge<T> > tmp;

  void dfs(int idx, int par) {
    used[idx] = true;
    bool beet = false;
    for (auto& to : g[idx]) {
      if (to == par && !std::exchange(beet, true)) continue;
      if (!used[to] || ord[to] < ord[idx]) {
        tmp.emplace_back(to);
      }
      if (!used[to]) {
        dfs(to, idx);
        if (low[to] >= ord[idx]) {
          bc.emplace_back();
          for (;;) {
            auto e = tmp.back();
            bc.back().emplace_back(e);
            tmp.pop_back();
            if (e.idx == to.idx) break;
          }
        }
      }
    }
  }
};
#line 8 "graph/others/block-cut-tree.hpp"

/**
 * @brief Block Cut Tree
 * @see https://ei1333.hateblo.jp/entry/2020/03/25/010057
 */
template <typename T = int>
struct BlockCutTree : BiConnectedComponents<T> {
 public:
  using BiConnectedComponents<T>::BiConnectedComponents;
  using BiConnectedComponents<T>::g;
  using BiConnectedComponents<T>::articulation;
  using BiConnectedComponents<T>::bc;

  std::vector<int> rev;
  std::vector<std::vector<int> > group;
  Graph<T> tree;

  explicit BlockCutTree(const Graph<T>& g) : Graph<T>(g) {}

  int operator[](const int& k) const { return rev[k]; }

  void build() override {
    BiConnectedComponents<T>::build();
    rev.assign(g.size(), -1);
    int ptr = (int)bc.size();
    for (auto& idx : articulation) {
      rev[idx] = ptr++;
    }
    std::vector<int> last(ptr, -1);
    tree = Graph<T>(ptr);
    for (int i = 0; i < (int)bc.size(); i++) {
      for (auto& e : bc[i]) {
        for (auto& ver : {e.from, e.to}) {
          if (rev[ver] >= (int)bc.size()) {
            if (std::exchange(last[rev[ver]], i) != i) {
              tree.add_edge(rev[ver], i, e.cost);
            }
          } else {
            rev[ver] = i;
          }
        }
      }
    }
    group.resize(ptr);
    for (int i = 0; i < (int)g.size(); i++) {
      group[rev[i]].emplace_back(i);
    }
  }
};
#line 12 "test/verify/aoj-3022.test.cpp"

using namespace std;

int main() {
  int N, M;
  cin >> N >> M;
  vector<int> A(N);
  for (auto& a : A) cin >> a;
  BlockCutTree<> bct(N);
  bct.read(M);
  bct.build();
  vector<int64_t> weight(bct.tree.size());
  int64_t all = 0;
  for (int i = 0; i < N; i++) {
    weight[bct[i]] += A[i];
    all += A[i];
  }
  vector<int64_t> ans(N, all);
  for (int i = 0; i < N; i++) {
    ans[i] -= A[i];
  }
  function<int64_t(int, int)> rec = [&](int idx, int par) -> int64_t {
    int64_t mx = 0, sum = 0;
    for (auto& to : bct.tree.g[idx]) {
      if (to == par) continue;
      auto res = rec(to, idx);
      sum += res;
      mx = max(mx, res);
    }
    if (idx >= (int)bct.bc.size()) {
      ans[bct.group[idx][0]] = max(all - sum - weight[idx], mx);
    }
    return sum + weight[idx];
  };
  rec(0, -1);
  for (auto& p : ans) cout << p << "\n";
}

Test cases

Env Name Status Elapsed Memory
g++ testcase_00 :heavy_check_mark: AC 2 ms 4 MB
g++ testcase_01 :heavy_check_mark: AC 2 ms 4 MB
g++ testcase_02 :heavy_check_mark: AC 2 ms 4 MB
g++ testcase_03 :heavy_check_mark: AC 2 ms 4 MB
g++ testcase_04 :heavy_check_mark: AC 2 ms 3 MB
g++ testcase_05 :heavy_check_mark: AC 2 ms 4 MB
g++ testcase_06 :heavy_check_mark: AC 2 ms 4 MB
g++ testcase_07 :heavy_check_mark: AC 2 ms 4 MB
g++ testcase_08 :heavy_check_mark: AC 2 ms 4 MB
g++ testcase_09 :heavy_check_mark: AC 2 ms 3 MB
g++ testcase_10 :heavy_check_mark: AC 2 ms 4 MB
g++ testcase_11 :heavy_check_mark: AC 77 ms 21 MB
g++ testcase_12 :heavy_check_mark: AC 89 ms 29 MB
g++ testcase_13 :heavy_check_mark: AC 39 ms 14 MB
g++ testcase_14 :heavy_check_mark: AC 45 ms 17 MB
g++ testcase_15 :heavy_check_mark: AC 58 ms 17 MB
g++ testcase_16 :heavy_check_mark: AC 55 ms 17 MB
g++ testcase_17 :heavy_check_mark: AC 25 ms 12 MB
g++ testcase_18 :heavy_check_mark: AC 93 ms 25 MB
g++ testcase_19 :heavy_check_mark: AC 36 ms 14 MB
g++ testcase_20 :heavy_check_mark: AC 80 ms 25 MB
g++ testcase_21 :heavy_check_mark: AC 118 ms 41 MB
g++ testcase_22 :heavy_check_mark: AC 119 ms 41 MB
g++ testcase_23 :heavy_check_mark: AC 110 ms 41 MB
g++ testcase_24 :heavy_check_mark: AC 105 ms 41 MB
g++ testcase_25 :heavy_check_mark: AC 94 ms 41 MB
g++ testcase_26 :heavy_check_mark: AC 95 ms 41 MB
g++ testcase_27 :heavy_check_mark: AC 92 ms 41 MB
g++ testcase_28 :heavy_check_mark: AC 94 ms 41 MB
g++ testcase_29 :heavy_check_mark: AC 98 ms 41 MB
g++ testcase_30 :heavy_check_mark: AC 93 ms 41 MB
g++ testcase_31 :heavy_check_mark: AC 55 ms 19 MB
g++ testcase_32 :heavy_check_mark: AC 2 ms 4 MB
g++ testcase_33 :heavy_check_mark: AC 78 ms 34 MB
g++ testcase_34 :heavy_check_mark: AC 87 ms 34 MB
g++ testcase_35 :heavy_check_mark: AC 87 ms 34 MB
clang++ testcase_00 :heavy_check_mark: AC 2 ms 4 MB
clang++ testcase_01 :heavy_check_mark: AC 2 ms 3 MB
clang++ testcase_02 :heavy_check_mark: AC 2 ms 3 MB
clang++ testcase_03 :heavy_check_mark: AC 2 ms 3 MB
clang++ testcase_04 :heavy_check_mark: AC 2 ms 3 MB
clang++ testcase_05 :heavy_check_mark: AC 2 ms 3 MB
clang++ testcase_06 :heavy_check_mark: AC 2 ms 4 MB
clang++ testcase_07 :heavy_check_mark: AC 2 ms 4 MB
clang++ testcase_08 :heavy_check_mark: AC 2 ms 3 MB
clang++ testcase_09 :heavy_check_mark: AC 2 ms 4 MB
clang++ testcase_10 :heavy_check_mark: AC 2 ms 4 MB
clang++ testcase_11 :heavy_check_mark: AC 61 ms 21 MB
clang++ testcase_12 :heavy_check_mark: AC 77 ms 30 MB
clang++ testcase_13 :heavy_check_mark: AC 35 ms 15 MB
clang++ testcase_14 :heavy_check_mark: AC 41 ms 18 MB
clang++ testcase_15 :heavy_check_mark: AC 53 ms 18 MB
clang++ testcase_16 :heavy_check_mark: AC 50 ms 17 MB
clang++ testcase_17 :heavy_check_mark: AC 24 ms 12 MB
clang++ testcase_18 :heavy_check_mark: AC 78 ms 26 MB
clang++ testcase_19 :heavy_check_mark: AC 33 ms 14 MB
clang++ testcase_20 :heavy_check_mark: AC 68 ms 25 MB
clang++ testcase_21 :heavy_check_mark: AC 106 ms 41 MB
clang++ testcase_22 :heavy_check_mark: AC 107 ms 41 MB
clang++ testcase_23 :heavy_check_mark: AC 109 ms 41 MB
clang++ testcase_24 :heavy_check_mark: AC 101 ms 41 MB
clang++ testcase_25 :heavy_check_mark: AC 98 ms 41 MB
clang++ testcase_26 :heavy_check_mark: AC 103 ms 41 MB
clang++ testcase_27 :heavy_check_mark: AC 107 ms 41 MB
clang++ testcase_28 :heavy_check_mark: AC 100 ms 41 MB
clang++ testcase_29 :heavy_check_mark: AC 111 ms 41 MB
clang++ testcase_30 :heavy_check_mark: AC 100 ms 41 MB
clang++ testcase_31 :heavy_check_mark: AC 59 ms 19 MB
clang++ testcase_32 :heavy_check_mark: AC 2 ms 3 MB
clang++ testcase_33 :heavy_check_mark: AC 79 ms 34 MB
clang++ testcase_34 :heavy_check_mark: AC 85 ms 34 MB
clang++ testcase_35 :heavy_check_mark: AC 86 ms 34 MB
Back to top page