Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/aizu/dsl_1_b.test.cpp

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_1_B"

#include "../../code/ds/dsu_weighted.hpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n, q;
  std::cin >> n >> q;
  tifa_libs::ds::dsu_weighted dsu(n);
  for (u32 i = 0; i < q; ++i) {
    u32 op, u, v;
    std::cin >> op >> u >> v;
    if (op) {
      if (!dsu.same(u, v))
        std::cout << "?\n";
      else
        std::cout << dsu.depth(u) - dsu.depth(v) << '\n';
    } else {
      i64 k;
      std::cin >> k;
      dsu.merge(u, v, k);
    }
  }
  return 0;
}
#line 1 "src/test_cpverifier/aizu/dsl_1_b.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_1_B"

#line 1 "src/code/ds/dsu_weighted.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};


#line 5 "src/code/ds/dsu_weighted.hpp"

namespace tifa_libs::ds {

class dsu_weighted {
  vec<i32> p;
  vec<i64> dep;

 public:
  explicit constexpr dsu_weighted(u32 n) : p(n, -1), dep(n) {}

  constexpr i32 find(u32 x) {
    if (p[x] < 0) return (i32)x;
    auto _ = find((u32)p[x]);
    dep[x] += dep[(u32)p[x]];
    return p[x] = _;
  }
  constexpr u32 size(u32 x) { return (u32)-p[(u32)find(x)]; }
  constexpr i64 depth(u32 x) { return find(x), dep[x]; }
  constexpr bool same(u32 x, u32 y) { return find(x) == find(y); }
  constexpr bool merge(u32 x, u32 y, i64 d = 1) {
    (d += depth(y) - depth(x)) *= -1;
    if ((x = (u32)find(x)) == (y = (u32)find(y))) return false;
    if (p[x] > p[y]) {
      std::swap(x, y);
      d *= -1;
    }
    p[x] += p[y];
    p[y] = (i32)x;
    dep[y] = d;
    return true;
  }
};

}  // namespace tifa_libs::ds


#line 4 "src/test_cpverifier/aizu/dsl_1_b.test.cpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n, q;
  std::cin >> n >> q;
  tifa_libs::ds::dsu_weighted dsu(n);
  for (u32 i = 0; i < q; ++i) {
    u32 op, u, v;
    std::cin >> op >> u >> v;
    if (op) {
      if (!dsu.same(u, v))
        std::cout << "?\n";
      else
        std::cout << dsu.depth(u) - dsu.depth(v) << '\n';
    } else {
      i64 k;
      std::cin >> k;
      dsu.merge(u, v, k);
    }
  }
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 00_sample_00.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 01_small_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 02_corner_00.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 03_general_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_rand_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_rand_01.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_rand_02.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_rand_03.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_rand_04.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_rand_05.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_rand_06.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 04_rand_07.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 05_large_00.in :heavy_check_mark: AC 14 ms 5 MB
g++-12 05_large_01.in :heavy_check_mark: AC 15 ms 4 MB
g++-12 06_maximum_00.in :heavy_check_mark: AC 26 ms 5 MB
g++-12 06_maximum_02.in :heavy_check_mark: AC 26 ms 5 MB
g++-12 07_dense_00.in :heavy_check_mark: AC 10 ms 4 MB
g++-12 07_dense_01.in :heavy_check_mark: AC 12 ms 4 MB
g++-12 07_dense_02.in :heavy_check_mark: AC 18 ms 4 MB
g++-12 07_dense_03.in :heavy_check_mark: AC 25 ms 4 MB
g++-12 08_shell_00.in :heavy_check_mark: AC 42 ms 5 MB
g++-12 09_extreme_line_00.in :heavy_check_mark: AC 40 ms 5 MB
g++-12 09_extreme_same_00.in :heavy_check_mark: AC 44 ms 5 MB
g++-12 09_extreme_same_01.in :heavy_check_mark: AC 46 ms 5 MB
Back to top page