-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2d segment tree
182 lines (168 loc) · 4.39 KB
/
2d segment tree
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
//Only Allah can help me//
/*
Nahid Hossain
Jahangirnagar University
Roll:54
*/
#include<bits/stdc++.h>
#define ll long long int
#define db double
#define pf printf
#define sf scanf
#define ff first
#define ss second
#define clr clear()
#define sz size()
#define pb push_back
#define mk make_pair
#define pi acos(-1)
#define rev(v) reverse(v.begin(),v.end())
#define sor(v) sort(v.begin(),v.end())
#define inf 999999999999999999
#define mod 5000000
#define eq =
#define ull unsigned long long int
#define f(i,k,n) for(ll i=k;i<n;i++)
#define fr(i,n,k) for(i=n;i>=k;i--)
#define ent(a) scanf("%lld",&a)
#define ent2(a,b) scanf("%lld%lld",&a,&b)
#define ent3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)
#define mem(a) memset(a,0,sizeof(a))
#define vec(v,s) vector<ll>v[s]
#define arr(a,s) ll a[s];
//#define check(n,pos) (n&(1<<pos))
//#define set(n,pos) (n|(1<<pos))
//knight and king//
int dr[]= {2,2,-2,-2,1,-1,1,-1};
int dc[]= {1,-1,1,-1,2,2,-2,-2};
int dr1[]= {0,0,1,1,1,-1,-1,-1};
int dc1[]= {1,-1,1,0,-1,0,1,-1};
int dr2[]= {0,0,1,-1};
int dc2[]= {1,-1,0,0};
////////////////////////////
using namespace std;
#define ma 502
ll tree[ma*ma*4],tree1[ma*4*ma];
bool valid(ll qx1,ll qx2,ll qy1,ll qy2,ll nx1,ll nx2,ll ny1,ll ny2)
{
if(nx1>qx2||nx1>nx2)return false;
if(nx2<qx1||qy1>qy2)return false;
if(ny1>qy2)return false;
if(ny2<qy1)return false;
return true;
}
void update(ll qx1,ll qy1,ll nx1,ll nx2,ll ny1,ll ny2,ll node,ll val)
{
bool f=valid(qx1,qx1,qy1,qy1,nx1,nx2,ny1,ny2);
if(f==false)return;
if(nx1>=qx1&&nx2<=qx1&&ny1>=qy1&&ny2<=qy1)
{
tree[node]=val;
return;
}
ll p=(nx1+nx2)/2;
ll p1=(ny1+ny2)/2;
update(qx1,qy1,nx1,p,ny1,p1,node*4+1,val);
update(qx1,qy1,nx1,p,p1+1,ny2,node*4+2,val);
update(qx1,qy1,p+1,nx2,ny1,p1,node*4+3,val);
update(qx1,qy1,p+1,nx2,p1+1,ny2,node*4+4,val);
ll r1=tree[node*4+1];
ll r2=tree[node*4+2];
ll r3=tree[node*4+3];
ll r4=tree[node*4+4];
//cout<<r1<<" "<<r2<<" "<<r3<<" "<<r4<<endl;
tree[node]=max(r1,max(r2,max(r3,r4)));
//cout<<tree[node]<<endl;
return;
}
ll query(ll qx1,ll qx2,ll qy1,ll qy2,ll nx1,ll nx2,ll ny1,ll ny2,ll node)
{
if(valid(qx1,qx2,qy1,qy2,nx1,nx2,ny1,ny2)==false) return 0;
if(nx1>=qx1&&nx2<=qx2&&ny1>=qy1&&ny2<=qy2)
{
return tree[node];
}
ll p=(nx1+nx2)>>1;
ll p1=(ny1+ny2)>>1;
ll r1=query(qx1,qx2,qy1,qy2,nx1,p,ny1,p1,node*4+1);
ll r2=query(qx1,qx2,qy1,qy2,nx1,p,p1+1,ny2,node*4+2);
ll r3=query(qx1,qx2,qy1,qy2,p+1,nx2,ny1,p1,node*4+3);
ll r4=query(qx1,qx2,qy1,qy2,p+1,nx2,p1+1,ny2,node*4+4);
return max(r1,max(r2,max(r3,r4)));
}
void update1(ll qx1,ll qy1,ll nx1,ll nx2,ll ny1,ll ny2,ll node,ll val)
{
bool f=valid(qx1,qx1,qy1,qy1,nx1,nx2,ny1,ny2);
if(f==false)return;
if(nx1>=qx1&&nx2<=qx1&&ny1>=qy1&&ny2<=qy1)
{
tree1[node]=val;
return;
}
ll p=(nx1+nx2)/2;
ll p1=(ny1+ny2)/2;
update1(qx1,qy1,nx1,p,ny1,p1,node*4+1,val);
update1(qx1,qy1,nx1,p,p1+1,ny2,node*4+2,val);
update1(qx1,qy1,p+1,nx2,ny1,p1,node*4+3,val);
update1(qx1,qy1,p+1,nx2,p1+1,ny2,node*4+4,val);
ll r1=tree1[node*4+1];
ll r2=tree1[node*4+2];
ll r3=tree1[node*4+3];
ll r4=tree1[node*4+4];
//cout<<r1<<" "<<r2<<" "<<r3<<" "<<r4<<endl;
tree1[node]=min(r1,min(r2,min(r3,r4)));
//cout<<tree[node]<<endl;
return;
}
ll query1(ll qx1,ll qx2,ll qy1,ll qy2,ll nx1,ll nx2,ll ny1,ll ny2,ll node)
{
if(valid(qx1,qx2,qy1,qy2,nx1,nx2,ny1,ny2)==false) return 999999999999;
if(nx1>=qx1&&nx2<=qx2&&ny1>=qy1&&ny2<=qy2)
{
return tree1[node];
}
ll p=(nx1+nx2)>>1;
ll p1=(ny1+ny2)>>1;
ll r1=query1(qx1,qx2,qy1,qy2,nx1,p,ny1,p1,node*4+1);
ll r2=query1(qx1,qx2,qy1,qy2,nx1,p,p1+1,ny2,node*4+2);
ll r3=query1(qx1,qx2,qy1,qy2,p+1,nx2,ny1,p1,node*4+3);
ll r4=query1(qx1,qx2,qy1,qy2,p+1,nx2,p1+1,ny2,node*4+4);
return min(r1,min(r2,min(r3,r4)));
}
int main()
{
ll n;
ent(n);
ll a[n+5][n+5];
mem(tree);
f(i,0,ma*ma*4)tree1[i]=9999999999999;
f(i,1,n+1)
{
f(j,1,n+1)
{
ent(a[i][j]);
update(i,j,1,n,1,n,1,a[i][j]);
update1(i,j,1,n,1,n,1,a[i][j]);
}
}
ll q;
cin>>q;
while(q--)
{
char c;
ll x1,x2,y1,y2;
cin>>c;
if(c=='c')
{
ll v;
cin>>x1>>y1>>v;
update(x1,y1,1,n,1,n,1,v);
update1(x1,y1,1,n,1,n,1,v);
continue;
}
cin>>x1>>y1>>x2>>y2;
cout<<query(x1,x2,y1,y2,1,n,1,n,1)<<" ";
cout<<query1(x1,x2,y1,y2,1,n,1,n,1)<<endl;
}
return 0;
}