verify/AOJ-DSL_1_B.test.cpp

View this file on GitHub
Last update: 2022-11-21 09:10:20+09:00
Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_B
Link: View error logs on GitHub Actions

Depends on

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_B"

#include "../template/template.hpp"
#include "../data-structure/weighted-unionfind.hpp"

int main(){
  int n, q;
  cin >> n >> q;
  WeightedUnionFind wuf(n, 0);
  REP(i,q){
    int t;
    cin >> t;
    if(t == 0){
      int x, y, z;
      cin >> x >> y >> z;

      wuf.merge(y, x, z);
    }else{
      int x, y;
      cin >> x >> y;
      if(wuf.isSame(x, y)){
        cout << wuf.getDiff(y, x) << endl;
      }else{
        cout << "?" << endl;
      }
    }
  }
}

#line 1 "verify/AOJ-DSL_1_B.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_B"

#line 1 "template/template.hpp"
#include<bits/stdc++.h>
using ll = long long;
#define REP(i, n) for(ll i = 0; (i) < ll(n); ++ (i))
#define FOR(i, m, n) for(ll i = (m); (i) <= ll(n); ++ (i))
#define REPR(i, n) for(ll i = ll(n) - 1; (i) >= 0; -- (i))
#define FORR(i, m, n) for(ll i = ll(n); (i) >= ll(m); -- (i))
#define ALL(x) x.begin(),x.end()

#define INF (int)1e9
#define LLINF (long long)1e18
#define MOD (int)(1e9+7)
#define MOD9 (int)998244353
#define PI 3.141592653589
#define PB push_back
#define F first
#define S second

#define YESNO(T) if(T){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(T) if(T){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(T) if(T){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define Yes(T) {cout<<"Yes"<<endl; if(T) return 0;}
#define No(T) {cout <<"No"<<endl; if(T) return 0;}
#define YES(T) {cout<<"YES"<<endl; if(T) return 0;}
#define NO(T) {cout <<"NO"<<endl; if(T) return 0;}

#define Graph vector<vector<int> >
#define CostGraph vector<vector<pair<int,ll> > >
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define VI vector<int>
#define VL vector<ll>
#define VVI vector<vector<int> >
#define VVL vector<vector<ll> >
#define VPII vector<pair<int,int> >
#define VPLL vector<pair<ll,ll> >

#define DDD fixed<<setprecision(10)
#define PAD setfill('0')<<right<<setw(8)

template <class T>
inline bool chmin(T &a, T b) {
  if(a > b){ a = b; return true;}
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if(a < b){a = b; return true;}
  return false;
}
struct input{
  int n;
  input() {}
  input(int n_) : n(n_){};
  template <class T>
  operator T(){
    T ret;
    std::cin >> ret;
    return ret;
  }
  template <class T>
  operator std::vector<T>() {
    std::vector<T> ret(n);
    REP(i,n) std::cin >> ret[i];
    return ret;
  }
};
template <class T>
inline void printVec(std::vector<T> v){
  REP(i,v.size()){
    if(i) std::cout << " ";
    std::cout << v[i];
  } std::cout << std::endl;
}

using namespace std;
#line 2 "data-structure/weighted-unionfind.hpp"
template<class T>
struct WeightedUnionFind{
  vector<int> parent;
  vector<int> rank;
  vector<T> diffWeight;

  WeightedUnionFind(int n, T unity) {
    init(n, unity);
  }

  void init(int n, T unity) {
    parent.resize(n);
    rank.resize(n);
    diffWeight.resize(n);
    for(int i = 0; i < n; ++i){
      parent[i] = i;
      rank[i] = 0;
      diffWeight[i] = unity;
    }
  }

  int getRoot(int x) {
    if(parent[x] == x) return x;
    int r = getRoot(parent[x]);
    diffWeight[x] += diffWeight[parent[x]];
    return parent[x] = r;
  }

  T getWeight(int x){
    getRoot(x);
    return diffWeight[x];
  }

  bool isSame(int x, int y) {
    return getRoot(x) == getRoot(y);
  }

  bool merge(int x, int y, T w) {
    w += getWeight(x);
    w -= getWeight(y);
    x = getRoot(x);
    y = getRoot(y);
    if(x == y) return false;
    if(rank[x] < rank[y]) {
      swap(x, y);
      w = -w;
    }
    if(rank[x] == rank[y]) ++rank[x];
    parent[y] = x;
    diffWeight[y] = w;
    return true;
  }

  T getDiff(int x, int y){
    return getWeight(y) - getWeight(x);
  }

  int getSize(int x){
    return -parent[getRoot(x)];
  }
};
#line 5 "verify/AOJ-DSL_1_B.test.cpp"

int main(){
  int n, q;
  cin >> n >> q;
  WeightedUnionFind wuf(n, 0);
  REP(i,q){
    int t;
    cin >> t;
    if(t == 0){
      int x, y, z;
      cin >> x >> y >> z;

      wuf.merge(y, x, z);
    }else{
      int x, y;
      cin >> x >> y;
      if(wuf.isSame(x, y)){
        cout << wuf.getDiff(y, x) << endl;
      }else{
        cout << "?" << endl;
      }
    }
  }
}