mmrz's library

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

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

:heavy_check_mark: verify/aoj/dsl/1_A.test.cpp

Depends on

Code

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

#include "./../../../template/template.hpp"
#include "./../../../data_structure/union_find.hpp"

void mmrz::solve(){
	int n, q;
	int com, x, y;
	cin >> n >> q;
	union_find uf(n);
	while(q--){
		cin >> com >> x >> y;
		if(com == 0)uf.unite(x, y);
		else cout << uf.is_same(x, y) << '\n';
	}
}
#line 1 "verify/aoj/dsl/1_A.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/1/DSL_1_A"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "data_structure/union_find.hpp"

#line 5 "data_structure/union_find.hpp"

struct union_find {
	std::vector<int> v;
	int g_size;
	int n;

	union_find(size_t size) : v(size, -1), g_size(size), n(size) {}

	int root(int x){
		assert(x < n);
		return (v[x] < 0 ? x : v[x] = root(v[x]));
	}

	bool is_root(int x){
		assert(x < n);
		return root(x) == x;
	}

	bool unite(int x, int y){
		assert(x < n && y < n);
		x = root(x);
		y = root(y);
		if(x != y){
			if(v[x] > v[y])std::swap(x, y);
			v[x] += v[y];
			v[y] = x;
			g_size--;
			return true;
		}
		return false;
	}

	bool is_same(int x,int y){
		assert(x < n && y < n);
		return root(x) == root(y);
	}

	int get_size(int x){
		assert(x < n);
		x = root(x);
		return -v[x];
	}

	int groups_size(){
		return g_size;
	}

	std::vector<std::vector<int>> groups(){
		std::vector<std::vector<int>> member(n);
		for(int i = 0;i < n;i++){
			member[root(i)].push_back(i);
		}

		std::vector<std::vector<int>> ret;
		for(int i = 0;i < n;i++){
			if(member[i].empty())continue;
			ret.push_back(member[i]);
		}
		return ret;
	}
};
#line 5 "verify/aoj/dsl/1_A.test.cpp"

void mmrz::solve(){
	int n, q;
	int com, x, y;
	cin >> n >> q;
	union_find uf(n);
	while(q--){
		cin >> com >> x >> y;
		if(com == 0)uf.unite(x, y);
		else cout << uf.is_same(x, y) << '\n';
	}
}
Back to top page