test/verify/aoj-dsl-1-b.test.cpp

• View this file on GitHub
• Last update: 2024-07-28 19:56:12+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_B

Depends on

• structure/union-find/weighted-union-find.hpp
• template/template.hpp

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_B

#include "../../template/template.hpp"

#include "../../structure/union-find/weighted-union-find.hpp"

int main() {
  int N, M;
  cin >> N >> M;
  WeightedUnionFind< int > tree(N);
  while(M--) {
    int A, B, C, D;
    cin >> A >> B >> C;
    if(A == 0) {
      cin >> D;
      tree.unite(B, C, D);
    } else {
      if(tree.find(B) == tree.find(C)) {
        cout << tree.diff(B, C) << endl;
      } else {
        cout << "?" << endl;
      }
    }
  }
}

#line 1 "test/verify/aoj-dsl-1-b.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_B

#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(std::forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}
#line 4 "test/verify/aoj-dsl-1-b.test.cpp"

#line 1 "structure/union-find/weighted-union-find.hpp"
template <typename T>
struct WeightedUnionFind {
  vector<int> data;
  vector<T> ws;

  WeightedUnionFind() {}

  WeightedUnionFind(int sz) : data(sz, -1), ws(sz) {}

  int find(int k) {
    if (data[k] < 0) return k;
    auto par = find(data[k]);
    ws[k] += ws[data[k]];
    return data[k] = par;
  }

  T weight(int t) {
    find(t);
    return ws[t];
  }

  bool unite(int x, int y, T w) {
    w += weight(x);
    w -= weight(y);
    x = find(x), y = find(y);
    if (x == y) return false;
    if (data[x] > data[y]) {
      swap(x, y);
      w *= -1;
    }
    data[x] += data[y];
    data[y] = x;
    ws[y] = w;
    return true;
  }

  T diff(int x, int y) { return weight(y) - weight(x); }
};
#line 6 "test/verify/aoj-dsl-1-b.test.cpp"

int main() {
  int N, M;
  cin >> N >> M;
  WeightedUnionFind< int > tree(N);
  while(M--) {
    int A, B, C, D;
    cin >> A >> B >> C;
    if(A == 0) {
      cin >> D;
      tree.unite(B, C, D);
    } else {
      if(tree.find(B) == tree.find(C)) {
        cout << tree.diff(B, C) << endl;
      } else {
        cout << "?" << endl;
      }
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00.in	AC	5 ms	3 MB
g++	01_small_00.in	AC	5 ms	3 MB
g++	02_corner_00.in	AC	5 ms	3 MB
g++	03_general_00.in	AC	5 ms	3 MB
g++	04_rand_00.in	AC	5 ms	3 MB
g++	04_rand_01.in	AC	5 ms	3 MB
g++	04_rand_02.in	AC	5 ms	3 MB
g++	04_rand_03.in	AC	5 ms	3 MB
g++	04_rand_04.in	AC	5 ms	3 MB
g++	04_rand_05.in	AC	5 ms	3 MB
g++	04_rand_06.in	AC	5 ms	3 MB
g++	04_rand_07.in	AC	5 ms	3 MB
g++	05_large_00.in	AC	22 ms	4 MB
g++	05_large_01.in	AC	28 ms	4 MB
g++	06_maximum_00.in	AC	64 ms	4 MB
g++	06_maximum_02.in	AC	62 ms	4 MB
g++	07_dense_00.in	AC	9 ms	3 MB
g++	07_dense_01.in	AC	12 ms	4 MB
g++	07_dense_02.in	AC	23 ms	4 MB
g++	07_dense_03.in	AC	40 ms	4 MB
g++	08_shell_00.in	AC	118 ms	4 MB
g++	09_extreme_line_00.in	AC	117 ms	4 MB
g++	09_extreme_same_00.in	AC	124 ms	4 MB
g++	09_extreme_same_01.in	AC	119 ms	4 MB
clang++	00_sample_00.in	AC	5 ms	3 MB
clang++	01_small_00.in	AC	5 ms	3 MB
clang++	02_corner_00.in	AC	5 ms	3 MB
clang++	03_general_00.in	AC	5 ms	3 MB
clang++	04_rand_00.in	AC	5 ms	3 MB
clang++	04_rand_01.in	AC	5 ms	3 MB
clang++	04_rand_02.in	AC	5 ms	3 MB
clang++	04_rand_03.in	AC	5 ms	3 MB
clang++	04_rand_04.in	AC	5 ms	3 MB
clang++	04_rand_05.in	AC	5 ms	3 MB
clang++	04_rand_06.in	AC	5 ms	3 MB
clang++	04_rand_07.in	AC	5 ms	3 MB
clang++	05_large_00.in	AC	30 ms	4 MB
clang++	05_large_01.in	AC	44 ms	4 MB
clang++	06_maximum_00.in	AC	94 ms	4 MB
clang++	06_maximum_02.in	AC	68 ms	4 MB
clang++	07_dense_00.in	AC	9 ms	3 MB
clang++	07_dense_01.in	AC	17 ms	4 MB
clang++	07_dense_02.in	AC	32 ms	4 MB
clang++	07_dense_03.in	AC	45 ms	4 MB
clang++	08_shell_00.in	AC	129 ms	4 MB
clang++	09_extreme_line_00.in	AC	118 ms	4 MB
clang++	09_extreme_same_00.in	AC	146 ms	4 MB
clang++	09_extreme_same_01.in	AC	122 ms	4 MB

Back to top page