146 lines
3.0 KiB
C++
146 lines
3.0 KiB
C++
/* Problem URL: https://codeforces.com/edu/course/2/lesson/7/2/practice/contest/289391/problem/C */
|
|
|
|
#include <bits/stdc++.h>
|
|
#include <ext/pb_ds/assoc_container.hpp>
|
|
#include <ext/pb_ds/tree_policy.hpp>
|
|
|
|
using namespace std;
|
|
using namespace __gnu_pbds;
|
|
|
|
template <class T, class comp = less<>>
|
|
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (int i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
int n, q;
|
|
cin >> n >> q;
|
|
|
|
vi dsui(n);
|
|
vi dsup(n);
|
|
rep(i, n) {
|
|
dsui[i] = i;
|
|
dsup[i] = i;
|
|
}
|
|
|
|
function<int(vi&, int)> find_p = [&](vi &dsu, int i) {
|
|
if (dsu[i] == i) {
|
|
return i;
|
|
}
|
|
return dsu[i] = find_p(dsu, dsu[i]);
|
|
};
|
|
|
|
auto join = [&](vi &dsu, int a, int b) {
|
|
a = find_p(dsu, a);
|
|
b = find_p(dsu, b);
|
|
if (a < b) {
|
|
swap(a, b);
|
|
}
|
|
|
|
dsu[b] = a;
|
|
};
|
|
|
|
while (q--) {
|
|
int op;
|
|
cin >> op;
|
|
|
|
if (op == 1) {
|
|
int a, b;
|
|
cin >> a >> b;
|
|
a--, b--;
|
|
|
|
join(dsui, a, b);
|
|
continue;
|
|
}
|
|
|
|
if (op == 2) {
|
|
int x, y;
|
|
cin >> x >> y;
|
|
x--, y--;
|
|
|
|
while (x = find_p(dsup, x), x < y) {
|
|
join(dsup, x, x + 1);
|
|
join(dsui, x, x + 1);
|
|
}
|
|
continue;
|
|
}
|
|
|
|
int a, b;
|
|
cin >> a >> b;
|
|
a--, b--;
|
|
|
|
if (find_p(dsui, a) == find_p(dsui, b) || find_p(dsup, a) == find_p(dsup, b)) {
|
|
cout << "YES\n";
|
|
} else {
|
|
cout << "NO\n";
|
|
}
|
|
}
|
|
}
|