考虑如果是一条直线能用线段树非常容易的维护,
但是现在是一个矩形…
考虑在直线能否联通的情况下实际是维护左右端点连通性
扩展到矩形,思考可以得到,现在维护6个变量能达到相同效果
用
lu
l
u
代表左上,
ld
l
d
代表左下,
ru
r
u
代表右上,
rd
r
d
代表右下
那么现在就是维护
lu−ld lu−ru lu−rd ld−ru ld−rd ru−rd
l
u
−
l
d
l
u
−
r
u
l
u
−
r
d
l
d
−
r
u
l
d
−
r
d
r
u
−
r
d
考虑到两个矩形合并的时候还得知道这两个矩形是否相连,那么再开两个变量表示上下是否分别相连即可
线段树可以很轻松的更新维护合并
考虑查询 需要仔细考虑各种情况,为了方便,我把y分别考虑了一遍…
具体见代码
c++代码如下:
#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x ; i <= y; ++ i)
#define repd(i,x,y) for(register int i = x ; i >= y; -- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T&x)
{
char c;int sign = 1;x = 0;
do { c = getchar(); if(c == '-') sign = -1;}while(!isdigit(c));
do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
x *= sign;
}
const int N = 1e5+500;
struct str { bool a[9]; bool&operator[](int x) { return a[x]; } };
struct Segment_tree
{
str val[N << 2];
void build(int id,int l,int r)
{
if(l == r)
{
val[id][7] = val[id][8] = 1;
return;
}
int mid = l + r>> 1;
build(id<<1,l,mid);
build(id<<1|1,mid+1,r);
}
inline str solve(str a,str b)
{
str x;
x[1] = a[1]; x[2] = a[2];
x[3] = (a[3])|(a[7]&a[8]&b[1]&b[3]&b[2]);
x[4] = (a[4]&b[2]&b[8])|(a[7]&b[1]&b[4]);
x[5] = (a[5]&b[1]&b[7])|(a[8]&b[2]&b[5]);
x[6] = (b[6])|(b[7]&b[1]&a[6]&b[2]&b[8]);
x[7] = (a[7]&b[1]&b[7])|(a[4]&b[2]&b[5]);
x[8] = (a[8]&b[2]&b[8])|(a[5]&b[1]&b[4]);
return x;
}
void update(int id,int l,int r,int pos,int op,bool k)
{
if(l == r)
{
if(op == 3)
{
val[id][3] = val[id][4] =
val[id][5] = val[id][6] = k;
}
else val[id][op] = k;
return ;
}
int mid = l + r>> 1;
if(pos <= mid) update(id<<1,l,mid,pos,op,k);
else update(id<<1|1,mid+1,r,pos,op,k);
val[id] = solve(val[id<<1],val[id<<1|1]);
}
str selcet(int id,int l,int r,int L,int R)
{
if(l == L && r == R) return val[id];
int mid = l + r >> 1;
if ( L > mid ) return selcet(id<<1|1,mid+1,r,L,R);
if ( R <= mid) return selcet(id<<1,l,mid,L,R);
return solve(selcet(id<<1,l,mid,L,mid),selcet(id<<1|1,mid+1,r,mid+1,R));
}
}seg;
char s[124];
int main()
{
int x1,y1,x2,y2,n;
read(n);
seg.build(1,1,n);
while(true)
{
scanf("%s",s);
if(s[0] == 'E') break;
read(y1), read(x1), read(y2), read(x2);
if(s[0] == 'O')
{
if(x1 > x2) swap(x1,x2);
if(y1 > y2) swap(y1,y2);
if(x1 < x2) seg.update(1,1,n,x2,y1,1);
if(y1 < y2) seg.update(1,1,n,x1,3,1);
}
else if(s[0] == 'C')
{
if(x1 > x2) swap(x1,x2);
if(y1 > y2) swap(y1,y2);
if(x1 < x2) seg.update(1,1,n,x2,y1,0);
if(y1 < y2) seg.update(1,1,n,x1,3,0);
}
else
{
if(x1 > x2) swap(x1,x2),swap(y1,y2);
str a = seg.selcet(1,1,n,1,x1);
str b = seg.selcet(1,1,n,x1,x2);
str c = seg.selcet(1,1,n,x2,n);
if(y1 == 1 && y2 == 1)
puts((b[7]|(a[6]&b[5])|(b[4]&c[3])|(a[6]&b[8]&c[3])) ? "Y" : "N");
if(y1 == 1 && y2 == 2)
puts((b[4]|(a[6]&b[8])|(b[7]&c[3])|(a[6]&b[5]&c[3])) ? "Y" : "N");
if(y1 == 2 && y2 == 1)
puts((b[5]|(a[6]&b[7])|(b[8]&c[3])|(a[6]&b[4]&c[3])) ? "Y" : "N");
if(y1 == 2 && y2 == 2)
puts((b[8]|(a[6]&b[4])|(b[5]&c[3])|(a[6]&b[7]&c[3])) ? "Y" : "N");
}
}
return 0;
}