-
Notifications
You must be signed in to change notification settings - Fork 0
/
MARBLE.cpp
219 lines (211 loc) · 6.95 KB
/
MARBLE.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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
// PREPARING ACM.ICPC 2018
// MARBLE - CODED BY ICNHOUKDSIIH
// CONTACT ME: https://icnhoukdsiih.blogspot.com/
//--------------------------------------------------
#include <stdio.h>
#define maxn 50000 //Gioi han kich thuoc ma tran
typedef long long ll;
typedef struct Element //Dinh nghia mot nut tron IT
{
ll Min, Max; //GTLN, GTNN trong nut dang xet
bool childupdate; //Kiem tra hai nut con da duoc cap nhat chua
} E;
//Left, Right, Top, Bottom la 4 IT dung de tim GTLN, GTNN cua cac doan trong moi nut ung voi bien trai, phai, tren va duoi
E Left[4*maxn+1],Right[4*maxn+1], Top[4*maxn+1], Bottom[4*maxn+1];
ll n,k,q;
//Khoi tao 1 IT
void init(E *a, ll value)
{
for (ll i=1;i<=4*n;i++)
{
a[i].Max=value;
a[i].Min=value;
a[i].childupdate=true;
}
}
//Cap nhat GTLN cua moi o trong doan [l..r] cua IT a
void updatemax(ll current, ll Front, ll Rear, ll l, ll r, ll value, E *a)
{
if (Front>r || Rear<l || a[current].Min>=value) return;
if (Front>=l && Rear<=r && a[current].Max<=value)
{
a[current].Max=value;
a[current].Min=value;
//Danh dau 2 nut con chua duoc cap nhat va return
a[current].childupdate=false;
return;
}
if (Front<Rear)
{
ll Mid=(Front+Rear)/2;
//Neu hai nut con chua cap nhat thong tin tu nut cha thi cap nhat
if (a[current].childupdate==false)
{
a[current*2].Max=a[current].Max;
a[current*2].Min=a[current].Min;
a[current*2].childupdate=false;
a[current*2+1].Max=a[current].Max;
a[current*2+1].Min=a[current].Min;
a[current*2+1].childupdate=false;
a[current].childupdate=true;
}
//Cap nhat lai hai nut con va cap nhat nut cha tu hai nut con
updatemax(current*2,Front,Mid,l,r,value,a);
updatemax(current*2+1,Mid+1,Rear,l,r,value,a);
a[current].Max=a[current*2].Max>a[current*2+1].Max?a[current*2].Max:a[current*2+1].Max;
a[current].Min=a[current*2].Min<a[current*2+1].Min?a[current*2].Min:a[current*2+1].Min;
}
}
//Cap nhat GTNN moi o trong doan [l..r] cua IT a
void updatemin(ll current, ll Front, ll Rear, ll l, ll r, ll value, E *a)
{
if (Front>r || Rear<l || a[current].Max<=value) return;
if (Front>=l && Rear<=r && a[current].Min>=value)
{
a[current].Max=value;
a[current].Min=value;
//Danh dau 2 nut con chua duoc cap nhat va return
a[current].childupdate=false;
return;
}
if (Front<Rear)
{
ll Mid=(Front+Rear)/2;
//Neu nut con chua cap nhat tu cha thi cap nhat
if (a[current].childupdate==false)
{
a[current*2].Max=a[current].Max;
a[current*2].Min=a[current].Min;
a[current*2].childupdate=false;
a[current*2+1].Max=a[current].Max;
a[current*2+1].Min=a[current].Min;
a[current*2+1].childupdate=false;
a[current].childupdate=true;
}
//Cap nhat thong tin nut con va nut cha cap nhat lai tu nut con
updatemin(current*2,Front,Mid,l,r,value,a);
updatemin(current*2+1,Mid+1,Rear,l,r,value,a);
a[current].Max=a[current*2].Max>a[current*2+1].Max?a[current*2].Max:a[current*2+1].Max;
a[current].Min=a[current*2].Min<a[current*2+1].Min?a[current*2].Min:a[current*2+1].Min;
}
}
//Tim o gan bien nhat tai vi tri pos
ll Find(ll current, ll Front, ll Rear, ll pos, E *a)
{
if (Front==Rear) return a[current].Max;
ll Mid=(Front+Rear)/2;
//Neu nut con chua cap nhat tu cha thi tien hanh cap nhat
if (a[current].childupdate==false)
{
a[current*2].Max=a[current].Max;
a[current*2].Min=a[current].Min;
a[current*2].childupdate=false;
a[current*2+1].Max=a[current].Max;
a[current*2+1].Min=a[current].Min;
a[current*2+1].childupdate=false;
a[current].childupdate=true;
}
if (Mid>=pos) return Find(current*2,Front,Mid,pos,a);
return Find(current*2+1,Mid+1,Rear,pos,a);
}
int main()
{
//Doc thong tin du lieu vao
scanf("%lld%lld%lld",&n,&k,&q);
init(Left,n+1);
init(Top,n+1);
init(Right,0);
init(Bottom,0);
//Doc thong tin k o ban dau va cap nhat cac cay
for (int i=0;i<k;i++)
{
ll u,v;
scanf("%lld%lld",&u,&v);
updatemin(1,1,n,u,u,v,Left);
updatemax(1,1,n,u,u,v,Right);
updatemin(1,1,n,v,v,u,Top);
updatemax(1,1,n,v,v,u,Bottom);
}
//Doc cac truy van va xu ly truy van tuong ung
for (int i=0;i<q;i++)
{
char c='.';
ll D,u,v,res=0,pos; //res la ket qua can tim
do scanf("%c",&c); while ((c>='A' && c<='Z')==false);
scanf("%lld%lld%lld",&D,&u,&v);
switch (c)
{
case 'L':
{
pos=Find(1,1,n,u,Left);
if (pos!=n+1)
{
ll head=pos-D>0?pos-D:1;
res=(pos-1+head)*(pos-head)/2;
updatemin(1,1,n,u,u,head,Left);
if (head<pos)
{
updatemin(1,1,n,head,pos-1,u,Top);
updatemax(1,1,n,head,pos-1,u,Bottom);
}
}
else res=D*n;
break;
}
case 'R':
{
pos=Find(1,1,n,u,Right);
if (pos!=0)
{
ll tail=pos+D<=n?pos+D:n;
res=(n-pos+n-tail+1)*(tail-pos)/2;
updatemax(1,1,n,u,u,tail,Right);
if (pos<tail)
{
updatemin(1,1,n,pos+1,tail,u,Top);
updatemax(1,1,n,pos+1,tail,u,Bottom);
}
}
else res=D*n;
break;
}
case 'T':
{
pos=Find(1,1,n,v,Top);
if (pos!=n+1)
{
ll head=pos-D>0?pos-D:1;
res=(pos-1+head)*(pos-head)/2;
updatemin(1,1,n,v,v,head,Top);
if (head<pos)
{
updatemin(1,1,n,head,pos-1,v,Left);
updatemax(1,1,n,head,pos-1,v,Right);
}
}
else res=D*n;
break;
}
case 'B':
{
pos=Find(1,1,n,v,Bottom);
if (pos!=0)
{
ll tail=pos+D<=n?pos+D:n;
res=(n-pos+n-tail+1)*(tail-pos)/2;
updatemax(1,1,n,v,v,tail,Bottom);
if (pos<tail)
{
updatemin(1,1,n,pos+1,tail,v,Left);
updatemax(1,1,n,pos+1,tail,v,Right);
}
}
else res=D*n;
break;
}
default:break;
}
printf("%lld\n",res);
}
return 0;
}