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
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 101010
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;
void update(vll& fenwick, ll n, ll v) {
while(n < MAX_N) {
fenwick[n] += v;
n += n & -n;
}
}
ll query(vll& fenwick, ll n) {
ll res = 0;
while(n) {
res += fenwick[n];
n -= n & -n;
}
return res;
}
void solve(ll n, ll q) {
vll fenwick1(MAX_N, 0), fenwick2(MAX_N, 0);
vll X(MAX_N, 0), Y(MAX_N, 0);
while(q--) {
ll t, x1, y1, x2, y2;
cin>>t;
if(t == 1 or t == 2) cin>>x1>>y1;
else cin>>x1>>y1>>x2>>y2;
if(t == 1) {
if(++X[x1] == 1) update(fenwick1, x1, 1);
if(++Y[y1] == 1) update(fenwick2, y1, 1);
} else if(t == 2) {
if(--X[x1] == 0) update(fenwick1, x1, -1);
if(--Y[y1] == 0) update(fenwick2, y1, -1);
} else {
ll x = query(fenwick1, max(x1, x2)) - query(fenwick1, min(x1, x2) - 1);
ll y = query(fenwick2, max(y1, y2)) - query(fenwick2, min(y1, y2) - 1);
if(x == abs(x1-x2) + 1 or y == abs(y1-y2) + 1) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
for(ll i = 1; i <= tc; i++) {
ll n, q;
cin>>n>>q;
solve(n,q);
}
return 0;
}
|
