Submission #25345063

---

Source Code Expand

#include "bits/stdc++.h"

#define int long long

using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
struct UnionFind {
	vector<int>par, vsize, esize;
	UnionFind(int sz_) : par(sz_), vsize(sz_, 1), esize(sz_, 0) {
		for (int i = 0; i < sz_; i++)par[i] = i;
	}
	void init(int sz_) {
		par.resize(sz_);
		vsize.resize(sz_, 1);
		esize.resize(sz_, 0);
		for (int i = 0; i < sz_; i++)par[i] = i;
	}
	int root(int x) {
		if (par[x] == x)return x;
		else return par[x] = root(par[x]);
	}
	bool merge(int x, int y) {
		x = root(x), y = root(y);
		if (x == y) {
			esize[x]++;
			return false;
		}
		if (vsize[x] < vsize[y])swap(x, y);
		vsize[x] += vsize[y];
		esize[x] += esize[y] + 1;
		par[y] = x;
		return true;
	}
	bool issame(int x, int y) {
		return root(x) == root(y);
	}
	int vs(int x) {
		return vsize[root(x)];
	}
	int es(int x) {
		return esize[root(x)];
	}
};
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int N, Q; cin >> N >> Q;
	UnionFind uf(N);
	vector<int>T(Q), X(Q), Y(Q), V(Q);
	vector<int>t(N);
	for (int i = 0; i < Q; i++) {
		cin >> T[i] >> X[i] >> Y[i] >> V[i];
		X[i]--; Y[i]--;
		if (T[i] == 0) {
			t[X[i]] = V[i];
		}
	}
	vector<int>res(N + 1, 0);
	for (int i = 0; i < N; i++) {
		res[i + 1] = t[i] - res[i];
	}
	for (int i = 0; i < Q; i++) {
		if (T[i] == 0)uf.merge(X[i], Y[i]);
		else {
			if (!uf.issame(X[i], Y[i])) {
				cout << "Ambiguous" << endl;
			}
			else {
				if (X[i] % 2 == Y[i] % 2) {
					cout << V[i] + (res[Y[i]] - res[X[i]]) << endl;
				}
				else {
					cout << (res[X[i]] + res[Y[i]]) - V[i] << endl;
				}
			}
		}
	}
	
	return 0;
}

Submission Info

Judge Result