CP-templates

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub Misuki743/CP-templates

:heavy_check_mark: test/incremental_scc.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/incremental_scc"

#include "../default/t.cpp"
#include "../modint/MontgomeryModInt.cpp"
#include "../ds/DSU.cpp"
#include "../graph/SCC.cpp"
#include "../graph/incrementalSCC.cpp"

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, m; cin >> n >> m;
  vector<mint> x(n);
  for(int i = 0; i < n; i++) cin >> x[i];
  vector<array<int, 2>> e(m);
  for(auto &[u, v] : e) cin >> u >> v;

  auto t = incrementalSCC(e, n);
  vector<mint> sum = x, cost(n, 0);
  DSU dsu(n);
  mint ans = 0;
  for(int i = 0, j = 0; i < m; i++) {
    while(j < ssize(t) and t[j][2] == i) {
      auto [u, v, _] = t[j++];
      u = dsu.query(u), v = dsu.query(v);
      mint sump = sum[u] + sum[v], costp = cost[u] + cost[v] + sum[u] * sum[v];
      ans += costp - (cost[u] + cost[v]);
      sum[u] = sum[v] = sump, cost[u] = cost[v] = costp;
      dsu.merge(u, v);
    }
    cout << ans << '\n';
  }

  return 0;
}
#line 1 "test/incremental_scc.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/incremental_scc"

#line 1 "default/t.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>
#include <bit>
#include <compare>
#include <concepts>
#include <numbers>
#include <ranges>
#include <span>

#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)

#define clock chrono::steady_clock::now().time_since_epoch().count()

using namespace std;

template<class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(size_t i = 0; T x : arr) {
    os << x;
    if (++i != N) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(size_t i = 0; T x : vec) {
    os << x;
    if (++i != size(vec)) os << ' ';
  }
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> &s) {
  for(size_t i = 0; T x : s) {
    os << x;
    if (++i != size(s)) os << ' ';
  }
  return os;
}
template<class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2> &m) {
  for(size_t i = 0; pair<T1, T2> x : m) {
    os << x;
    if (++i != size(m)) os << ' ';
  }
  return os;
}

#ifdef DEBUG
#define dbg(...) cerr << '(', _do(#__VA_ARGS__), cerr << ") = ", _do2(__VA_ARGS__)
template<typename T> void _do(T &&x) { cerr << x; }
template<typename T, typename ...S> void _do(T &&x, S&&...y) { cerr << x << ", "; _do(y...); }
template<typename T> void _do2(T &&x) { cerr << x << endl; }
template<typename T, typename ...S> void _do2(T &&x, S&&...y) { cerr << x << ", "; _do2(y...); }
#else
#define dbg(...)
#endif

using ll = long long;
using ull = unsigned long long;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using max_heap = priority_queue<T>;

template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP = plus<T>>
void pSum(rng &v) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = OP()(p, x);
}
template<ranges::forward_range rng, class T = ranges::range_value_t<rng>, class OP>
void pSum(rng &v, OP op) {
  if (!v.empty())
    for(T p = v[0]; T &x : v | views::drop(1))
      x = p = op(p, x);
}

template<ranges::forward_range rng>
void Unique(rng &v) {
  ranges::sort(v);
  v.resize(unique(v.begin(), v.end()) - v.begin());
}

template<ranges::random_access_range rng>
rng invPerm(rng p) {
  rng ret = p;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = i;
  return ret;
}

template<ranges::random_access_range rng, ranges::random_access_range rng2>
rng Permute(rng v, rng2 p) {
  rng ret = v;
  for(int i = 0; i < ssize(p); i++)
    ret[p[i]] = v[i];
  return ret;
}

template<bool directed>
vector<vector<int>> readGraph(int n, int m, int base) {
  vector<vector<int>> g(n);
  for(int i = 0; i < m; i++) {
    int u, v; cin >> u >> v;
    u -= base, v -= base;
    g[u].emplace_back(v);
    if constexpr (!directed)
      g[v].emplace_back(u);
  }
  return g;
}

template<class T>
void setBit(T &msk, int bit, bool x) {
  msk = (msk & ~(T(1) << bit)) | (T(x) << bit);
}
template<class T> void flipBit(T &msk, int bit) { msk ^= T(1) << bit; }
template<class T> bool getBit(T msk, int bit) { return msk >> bit & T(1); }

template<class T>
T floorDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? a / b : (a - b + 1) / b;
}
template<class T>
T ceilDiv(T a, T b) {
  if (b < 0) a *= -1, b *= -1;
  return a >= 0 ? (a + b - 1) / b : a / b;
}

template<class T> bool chmin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template<class T> bool chmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
#line 1 "modint/MontgomeryModInt.cpp"
//reference: https://github.com/NyaanNyaan/library/blob/master/modint/montgomery-modint.hpp#L10
//note: mod should be an odd prime less than 2^30.

template<uint32_t mod>
struct MontgomeryModInt {
  using mint = MontgomeryModInt;
  using i32 = int32_t;
  using u32 = uint32_t;
  using u64 = uint64_t;

  static constexpr u32 get_r() {
    u32 res = 1, base = mod;
    for(i32 i = 0; i < 31; i++)
      res *= base, base *= base;
    return -res;
  }

  static constexpr u32 get_mod() {
    return mod;
  }

  static constexpr u32 n2 = -u64(mod) % mod; //2^64 % mod
  static constexpr u32 r = get_r(); //-P^{-1} % 2^32

  u32 a;

  static u32 reduce(const u64 &b) {
    return (b + u64(u32(b) * r) * mod) >> 32;
  }

  static u32 transform(const u64 &b) {
    return reduce(u64(b) * n2);
  }

  MontgomeryModInt() : a(0) {}
  MontgomeryModInt(const int64_t &b) 
    : a(transform(b % mod + mod)) {}

  mint pow(u64 k) const {
    mint res(1), base(*this);
    while(k) {
      if (k & 1) 
        res *= base;
      base *= base, k >>= 1;
    }
    return res;
  }

  mint inverse() const { return (*this).pow(mod - 2); }

  u32 get() const {
    u32 res = reduce(a);
    return res >= mod ? res - mod : res;
  }

  mint& operator+=(const mint &b) {
    if (i32(a += b.a - 2 * mod) < 0) a += 2 * mod;
    return *this;
  }

  mint& operator-=(const mint &b) {
    if (i32(a -= b.a) < 0) a += 2 * mod;
    return *this;
  }

  mint& operator*=(const mint &b) {
    a = reduce(u64(a) * b.a);
    return *this;
  }

  mint& operator/=(const mint &b) {
    a = reduce(u64(a) * b.inverse().a);
    return *this;
  }

  mint operator-() { return mint() - mint(*this); }
  bool operator==(mint b) const {
    return (a >= mod ? a - mod : a) == (b.a >= mod ? b.a - mod : b.a);
  }
  bool operator!=(mint b) const {
    return (a >= mod ? a - mod : a) != (b.a >= mod ? b.a - mod : b.a);
  }

  friend mint operator+(mint c, mint d) { return c += d; }
  friend mint operator-(mint c, mint d) { return c -= d; }
  friend mint operator*(mint c, mint d) { return c *= d; }
  friend mint operator/(mint c, mint d) { return c /= d; }

  friend ostream& operator<<(ostream& os, const mint& b) {
    return os << b.get();
  }
  friend istream& operator>>(istream& is, mint& b) {
    int64_t val;
    is >> val;
    b = mint(val);
    return is;
  }
};

using mint = MontgomeryModInt<998244353>;
#line 1 "ds/DSU.cpp"
struct DSU {
  vector<int> bos, sz;
  int size;

  DSU(int _size) : bos(_size), sz(_size, 1), size(_size) {
    iota(bos.begin(), bos.end(), 0);
  }

  int query(int v) {
    if (bos[v] == v)
      return v;
    else
      return bos[v] = query(bos[v]);
  }

  bool merge(int v1, int v2) {
    int b1 = query(v1), b2 = query(v2);

    if (b1 == b2)
      return false;

    if (sz[b1] > sz[b2])
      swap(b1, b2);
    bos[b1] = b2, sz[b2] += sz[b1];

    return true;
  }
};
#line 1 "graph/SCC.cpp"
struct SCC {
  vector<int> groupId;
  vector<vector<int>> group, G;
  int size;

  SCC(vector<vector<int>> &g) : groupId(ssize(g)), size(0) {
    vector<vector<int>> gr(g.size());
    for(int u = 0; u < ssize(g); u++)
      for(int v : g[u])
        gr[v].emplace_back(u);

    int t = 0;
    vector<bool> vis(ssize(g), false);
    vector<int> tout(ssize(g));
    auto dfs = [&](int v, auto &&self) -> void {
      vis[v] = true;
      for(int x : gr[v])
        if (!vis[x])
          self(x, self);
      tout[t++] = v;
    };

    for(int v = 0; v < ssize(g); v++)
      if (!vis[v])
        dfs(v, dfs);

    auto dfs2 = [&](int v, auto &&self) -> void {
      vis[v] = true;
      for(int x : g[v])
        if (!vis[x])
          self(x, self);
      groupId[v] = size;
    };

    fill(vis.begin(), vis.end(), false);
    for(int v = ssize(g) - 1; v >= 0; v--) {
      if (!vis[tout[v]]) {
        dfs2(tout[v], dfs2);
        size += 1;
      }
    }

    for(int &x : groupId)
      x = size - x - 1;

    group.resize(size);
    for(int v = 0; v < ssize(g); v++)
      group[groupId[v]].emplace_back(v);

    G.resize(size);
    for(int v = 0; v < ssize(g); v++)
      for(int x : g[v])
        if (groupId[v] != groupId[x])
          G[groupId[v]].emplace_back(groupId[x]);
  }
};
#line 1 "graph/incrementalSCC.cpp"
//#include "ds/DSU.cpp"
//#include "graph/SCC.cpp"

vector<array<int, 3>> incrementalSCC(vector<array<int, 2>> _e, int n) {
  vector<array<int, 3>> e(ssize(_e));
  for(int i = 0; auto [u, v] : _e)
    e[i] = {u, v, i}, i++;

  DSU dsu(n);
  vector<array<int, 3>> ret;
  vector<int> mp(n, -1);
  auto calc = [&](int l, int r, vector<array<int, 3>> e, auto &&self) -> void {
    if (l + 1 == r) return;

    int mid = (l + r) / 2;

    vector<array<int, 3>> el, er;
    {
      auto ep = e;
      int nxt = 0;
      for(auto &x : ep) for(int &v : x | views::take(2)) {
        v = dsu.query(v);
        if (mp[v] == -1) mp[v] = nxt++;
        v = mp[v];
      }
      for(auto &x : e) for(int &v : x | views::take(2)) mp[dsu.query(v)] = -1;
      vector<vector<int>> g(nxt);
      for(auto &[u, v, t] : ep)
        if (t <= mid)
          g[u].emplace_back(v);
      auto gId = SCC(g).groupId;
      for(int i = 0; auto &[u, v, t] : ep)
        (gId[u] == gId[v] ? el : er).push_back(e[i++]);
    }

    self(l, mid, el, self);

    for(auto [u, v, t] : el)
      if (dsu.merge(u, v))
        ret.push_back({u, v, mid});

    self(mid, r, er, self);
  };

  calc(0, ssize(e), e, calc);

  return ret;
}
#line 8 "test/incremental_scc.test.cpp"

signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);

  int n, m; cin >> n >> m;
  vector<mint> x(n);
  for(int i = 0; i < n; i++) cin >> x[i];
  vector<array<int, 2>> e(m);
  for(auto &[u, v] : e) cin >> u >> v;

  auto t = incrementalSCC(e, n);
  vector<mint> sum = x, cost(n, 0);
  DSU dsu(n);
  mint ans = 0;
  for(int i = 0, j = 0; i < m; i++) {
    while(j < ssize(t) and t[j][2] == i) {
      auto [u, v, _] = t[j++];
      u = dsu.query(u), v = dsu.query(v);
      mint sump = sum[u] + sum[v], costp = cost[u] + cost[v] + sum[u] * sum[v];
      ans += costp - (cost[u] + cost[v]);
      sum[u] = sum[v] = sump, cost[u] = cost[v] = costp;
      dsu.merge(u, v);
    }
    cout << ans << '\n';
  }

  return 0;
}
Back to top page