Submission #3477078

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
//#pragma GCC optimize ("-O3") 
#ifdef YANG33
#include "mydebug.hpp"
#else
#define DD(x) 
#endif
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  2018/10/24  Problem: ARC 035 D / Link: http://arc035.contest.atcoder.jp/tasks/arc035_d  ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----

頂点倍化UFをやればよい

----解説ここまで---- */

struct UnionFind {
	vector<int> data;
	UnionFind(int n) { data.assign(n, -1); }
	bool unionSet(int x, int y) {
		x = root(x); y = root(y);
		if (x != y) {
			if (data[y] < data[x]) swap(x, y);
			data[x] += data[y]; data[y] = x;
		}
		return x != y;
	}
	bool same(int x, int y) { return root(x) == root(y); }
	int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
	int size(int x) { return -data[root(x)]; }
};

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	int N, Q; cin >> N >> Q;
	UnionFind uf(2 * N);
	FOR(i, 0, Q) {
		int w, x, y, z; cin >> w >> x >> y >> z;
		x--, y--;
		if (w == 1) {
			if (z % 2 == 1) {
				uf.unionSet(x, y + N);
				uf.unionSet(y, x + N);
			}
			else {
				uf.unionSet(x, y);
				uf.unionSet(y + N, x + N);
			}
		}
		else {
			if (uf.same(x, y)) {
				cout << "YES" << endl;
			}
			else {
				cout << "NO" << endl;
			}
		}
		//DD(de(w,z,y,z,uf));
	}

	return 0;
}

Submission Info

Judge Result