-
Notifications
You must be signed in to change notification settings - Fork 25
/
segment_tree.cpp
193 lines (174 loc) · 4.5 KB
/
segment_tree.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
/* Author: Praveen Kulkarni (eigenvalue)
* Created: 2018-12-13 10:46
* Copyright (C) 2018 pkulkarni <[email protected]>
*/
#include <numeric>
#include <iomanip>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <fstream>
#include <sstream>
#include <array>
#include <bitset>
#include <deque>
#include <forward_list>
#include <functional>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
#define endl '\n'
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
return os << "(" << P.first << "," << P.second << ")";
}
template<class T> ostream &operator<<(ostream& os, vector<T> V) {
os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class K, class X> ostream &operator<<(ostream& os, map<K,X> V) {
os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail...T) {
cerr << " " << H;
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
using vvi = vector<vi>;
using vvii = vector<vii>;
class dsu {
vector<int32_t> p;
vector<int32_t> rank;
public:
dsu(int n_): p(n_), rank(n_) {
iota(p.begin(), p.end(), 0);
}
inline int32_t findset(int32_t x) {
if(x != p[x]) {
p[x] = findset(p[x]);
}
return p[x];
};
inline bool unite(int x, int y) {
x = findset(x);
y = findset(y);
if(x == y) return false;
if(rank[x] > rank[y]) {
p[x] = y;
} else {
p[y] = x;
}
return true;
}
};
struct SegmentTree {
private:
const int n;
const int root = 1;
vector<int32_t> t;
vector<bool> lazy;
dsu &dsu_;
inline int32_t pull(int32_t a, int32_t b) {
return (a > -1 and b > -1 and dsu_.findset(a) == dsu_.findset(b))
? dsu_.findset(a)
: -1;
}
void build(int p, int ll, int rr) {
if(ll == rr) { // build the leaf nodes here
t[p] = ll;
return;
}
int mid = (ll + rr) / 2;
build(2*p, ll, mid);
build(2*p+1, mid+1, rr);
t[p] = pull(t[2*p], t[2*p+1]);
}
void push(int p, int ll, int rr) {
if(ll == rr or lazy[p] == false) return;
int mid = (ll + rr) / 2;
modify(p<<1, ll, mid, ll, rr, t[p]); // modify with the data item
modify(p<<1|1, mid+1, rr, ll, rr, t[p]); // modify with the data item
t[p] = pull(t[p<<1], t[p<<1|1]);
lazy[p] = false;
}
int32_t get(int p, int ll, int rr, int ql, int qr) {
push(p, ll, rr);
int32_t &cur = t[p];
if(ql <= ll and rr <= qr) {
return cur;
}
int mid = (ll + rr) / 2;
if(qr <= mid) return get(2*p, ll, mid, ql, qr);
if(mid < ql) return get(2*p+1, mid+1, rr, ql, qr);
return pull(get(2*p, ll, mid, ql, qr), get(2*p+1, mid+1, rr, ql, qr));
}
void modify(int p, int ll, int rr, int ql, int qr, int val) {
if(qr < ll or rr < ql) return;
int32_t &cur = t[p];
push(p, ll, rr);
if(ql <= ll and rr <= qr and cur > -1) {
// apply the update value to the cur node
dsu_.findset(cur);
dsu_.unite(cur, val);
// lazy[p] = true; (should uncomment if you need lazy propogation)
return;
}
int mid = (ll + rr) / 2;
modify(2*p, ll, mid, ql, qr, val);
modify(2*p+1, mid+1, rr, ql, qr, val);
cur = pull(t[2*p], t[2*p+1]);
}
public:
// default constructor
SegmentTree(int n_, dsu &dsu_): n(n_), t(4 * n), lazy(4 * n, false), dsu_(dsu_) {
build(1, 0, n-1);
}
int32_t get(int ql, int qr) {
return get(1, 0, n - 1, ql, qr);
}
void modify(int ql, int qr, int val) {
modify(1, 0, n - 1, ql, qr, val);
}
};
int32_t main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, q; cin >> n >> q;
dsu dsu_(n);
SegmentTree st(n, dsu_);
for(int i = 0; i < q; ++i) {
int type; cin >> type;
int x, y; cin >> x >> y;
x--, y--;
if(type == 1) {
int32_t s1 = st.get(x, x);
int32_t s2 = st.get(y, y);
dsu_.unite(s1, s2);
}
else if(type == 2) {
int32_t s1 = st.get(x, x);
st.modify(x, y, s1);
}
else if(type == 3) {
int32_t s1 = st.get(x, x);
int32_t s2 = st.get(y, y);
cout << ((dsu_.findset(s1) == dsu_.findset(s2)) ? "YES" : "NO") << endl;
}
}
}