結果

問題 No.2295 Union Path Query (Medium)
ユーザー 👑 emthrmemthrm
提出日時 2023-05-12 16:46:57
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 233 ms / 4,000 ms
コード長 7,266 bytes
コンパイル時間 3,408 ms
コンパイル使用メモリ 257,904 KB
実行使用メモリ 20,336 KB
最終ジャッジ日時 2023-08-19 01:31:59
合計ジャッジ時間 20,358 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,384 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,388 KB
testcase_03 AC 233 ms
8,420 KB
testcase_04 AC 212 ms
9,896 KB
testcase_05 AC 158 ms
12,320 KB
testcase_06 AC 121 ms
14,232 KB
testcase_07 AC 199 ms
8,300 KB
testcase_08 AC 140 ms
19,152 KB
testcase_09 AC 140 ms
18,984 KB
testcase_10 AC 145 ms
19,196 KB
testcase_11 AC 165 ms
19,176 KB
testcase_12 AC 161 ms
19,024 KB
testcase_13 AC 145 ms
17,808 KB
testcase_14 AC 118 ms
17,340 KB
testcase_15 AC 118 ms
20,036 KB
testcase_16 AC 116 ms
19,860 KB
testcase_17 AC 116 ms
18,992 KB
testcase_18 AC 161 ms
18,704 KB
testcase_19 AC 167 ms
18,772 KB
testcase_20 AC 141 ms
19,024 KB
testcase_21 AC 130 ms
18,864 KB
testcase_22 AC 167 ms
18,772 KB
testcase_23 AC 162 ms
20,044 KB
testcase_24 AC 166 ms
19,864 KB
testcase_25 AC 142 ms
19,508 KB
testcase_26 AC 166 ms
20,144 KB
testcase_27 AC 162 ms
19,252 KB
testcase_28 AC 170 ms
19,556 KB
testcase_29 AC 184 ms
19,608 KB
testcase_30 AC 162 ms
19,336 KB
testcase_31 AC 151 ms
19,240 KB
testcase_32 AC 148 ms
19,452 KB
testcase_33 AC 148 ms
19,344 KB
testcase_34 AC 171 ms
19,448 KB
testcase_35 AC 155 ms
19,348 KB
testcase_36 AC 149 ms
19,244 KB
testcase_37 AC 151 ms
19,200 KB
testcase_38 AC 151 ms
19,360 KB
testcase_39 AC 152 ms
19,292 KB
testcase_40 AC 147 ms
19,308 KB
testcase_41 AC 147 ms
19,272 KB
testcase_42 AC 147 ms
19,508 KB
testcase_43 AC 152 ms
19,292 KB
testcase_44 AC 150 ms
19,656 KB
testcase_45 AC 156 ms
19,940 KB
testcase_46 AC 154 ms
19,716 KB
testcase_47 AC 159 ms
19,780 KB
testcase_48 AC 187 ms
20,336 KB
testcase_49 AC 202 ms
20,280 KB
testcase_50 AC 139 ms
19,272 KB
testcase_51 AC 152 ms
19,352 KB
testcase_52 AC 153 ms
19,588 KB
testcase_53 AC 156 ms
19,296 KB
testcase_54 AC 174 ms
20,180 KB
testcase_55 AC 163 ms
19,196 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

struct PartiallyPersistentUnionFind {
  explicit PartiallyPersistentUnionFind(const int n)
      : data(n, -1), last(n, -1), history(n, {{-1, -1}}) {}

  int root(const int t, const int ver) const {
    return last[ver] == -1 || t < last[ver] ? ver : root(t, data[ver]);
  }

  bool unite(const int t, int u, int v) {
    u = root(t, u);
    v = root(t, v);
    if (u == v) return false;
    if (data[u] > data[v]) std::swap(u, v);
    data[u] += data[v];
    data[v] = u;
    last[v] = t;
    history[u].emplace_back(t, data[u]);
    return true;
  }

  bool is_same(const int t, const int u, const int v) const {
    return root(t, u) == root(t, v);
  }

  int size(const int t, int ver) const {
    ver = root(t, ver);
    return -std::prev(std::lower_bound(history[ver].begin(),
                                       history[ver].end(),
                                       std::make_pair(t, 0)))->second;
  }

 private:
  std::vector<int> data, last;
  std::vector<std::vector<std::pair<int, int>>> history;
};

template <typename CostType>
struct Edge {
  CostType cost;
  int src, dst;

  explicit Edge(const int src, const int dst, const CostType cost = 0)
      : cost(cost), src(src), dst(dst) {}

  auto operator<=>(const Edge& x) const = default;
};

template <int M>
struct MInt {
  unsigned int v;

  MInt() : v(0) {}
  MInt(const long long x) : v(x >= 0 ? x % M : x % M + M) {}

  static constexpr int get_mod() { return M; }
  static void set_mod(const int divisor) { assert(divisor == M); }

  static void init(const int x) {
    inv<true>(x);
    fact(x);
    fact_inv(x);
  }

  template <bool MEMOIZES = false>
  static MInt inv(const int n) {
    // assert(0 <= n && n < M && std::gcd(n, M) == 1);
    static std::vector<MInt> inverse{0, 1};
    const int prev = inverse.size();
    if (n < prev) return inverse[n];
    if constexpr (MEMOIZES) {
      // "n!" and "M" must be disjoint.
      inverse.resize(n + 1);
      for (int i = prev; i <= n; ++i) {
        inverse[i] = -inverse[M % i] * (M / i);
      }
      return inverse[n];
    }
    int u = 1, v = 0;
    for (unsigned int a = n, b = M; b;) {
      const unsigned int q = a / b;
      std::swap(a -= q * b, b);
      std::swap(u -= q * v, v);
    }
    return u;
  }

  static MInt fact(const int n) {
    static std::vector<MInt> factorial{1};
    const int prev = factorial.size();
    if (n >= prev) {
      factorial.resize(n + 1);
      for (int i = prev; i <= n; ++i) {
        factorial[i] = factorial[i - 1] * i;
      }
    }
    return factorial[n];
  }

  static MInt fact_inv(const int n) {
    static std::vector<MInt> f_inv{1};
    const int prev = f_inv.size();
    if (n >= prev) {
      f_inv.resize(n + 1);
      f_inv[n] = inv(fact(n).v);
      for (int i = n; i > prev; --i) {
        f_inv[i - 1] = f_inv[i] * i;
      }
    }
    return f_inv[n];
  }

  static MInt nCk(const int n, const int k) {
    if (n < 0 || n < k || k < 0) return 0;
    return fact(n) * (n - k < k ? fact_inv(k) * fact_inv(n - k) :
                                  fact_inv(n - k) * fact_inv(k));
  }
  static MInt nPk(const int n, const int k) {
    return n < 0 || n < k || k < 0 ? 0 : fact(n) * fact_inv(n - k);
  }
  static MInt nHk(const int n, const int k) {
    return n < 0 || k < 0 ? 0 : (k == 0 ? 1 : nCk(n + k - 1, k));
  }

  static MInt large_nCk(long long n, const int k) {
    if (n < 0 || n < k || k < 0) return 0;
    inv<true>(k);
    MInt res = 1;
    for (int i = 1; i <= k; ++i) {
      res *= inv(i) * n--;
    }
    return res;
  }

  MInt pow(long long exponent) const {
    MInt res = 1, tmp = *this;
    for (; exponent > 0; exponent >>= 1) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
    }
    return res;
  }

  MInt& operator+=(const MInt& x) {
    if (std::cmp_greater_equal(v += x.v, M)) v -= M;
    return *this;
  }
  MInt& operator-=(const MInt& x) {
    if (std::cmp_greater_equal(v += M - x.v, M)) v -= M;
    return *this;
  }
  MInt& operator*=(const MInt& x) {
    v = static_cast<unsigned long long>(v) * x.v % M;
    return *this;
  }
  MInt& operator/=(const MInt& x) { return *this *= inv(x.v); }

  auto operator<=>(const MInt& x) const = default;

  MInt& operator++() {
    if (std::cmp_equal(++v, M)) v = 0;
    return *this;
  }
  MInt operator++(int) {
    const MInt res = *this;
    ++*this;
    return res;
  }
  MInt& operator--() {
    v = (v == 0 ? M - 1 : v - 1);
    return *this;
  }
  MInt operator--(int) {
    const MInt res = *this;
    --*this;
    return res;
  }

  MInt operator+() const { return *this; }
  MInt operator-() const { return MInt(v ? M - v : 0); }

  MInt operator+(const MInt& x) const { return MInt(*this) += x; }
  MInt operator-(const MInt& x) const { return MInt(*this) -= x; }
  MInt operator*(const MInt& x) const { return MInt(*this) *= x; }
  MInt operator/(const MInt& x) const { return MInt(*this) /= x; }

  friend std::ostream& operator<<(std::ostream& os, const MInt& x) {
    return os << x.v;
  }
  friend std::istream& operator>>(std::istream& is, MInt& x) {
    long long v;
    is >> v;
    x = MInt(v);
    return is;
  }
};
using ModInt = MInt<MOD>;

int main() {
  int n, x, q; cin >> n >> x >> q;
  vector<int> w(q, -1);
  vector<ModInt> q3(n, 0);
  PartiallyPersistentUnionFind union_find(n);
  REP(tm, q) {
    int type; cin >> type;
    if (type == 1) {
      int v; cin >> v >> w[tm];
      if (union_find.is_same(tm, v, x)) continue;
      const int rv = union_find.root(tm, v), rx = union_find.root(tm, x);
      q3[rv] += ModInt(union_find.size(tm, rv)) * union_find.size(tm, rx) * w[tm];
      union_find.unite(tm, rv, rx);
      const int r = union_find.root(tm, v), other = r ^ rv ^ rx;
      q3[r] += q3[other];
      q3[other] = 0;
    } else if (type == 2) {
      int u, v; cin >> u >> v;
      if (u == v) {
        cout << 0 << '\n';
        continue;
      }
      if (!union_find.is_same(tm, u, v)) {
        cout << "-1\n";
        continue;
      }
      int lb = -1, ub = tm - 1;
      while (ub - lb > 1) {
        const int t = midpoint(lb, ub);
        (union_find.is_same(t, u, v) ? ub : lb) = t;
      }
      cout << w[ub] << '\n';
      x += w[ub];
    } else if (type == 3) {
      int v; cin >> v;
      cout << q3[union_find.root(tm, v)] << '\n';
    } else if (type == 4) {
      int value; cin >> value;
      x += value;
    }
    x %= n;
  }
  return 0;
}
0