BZOJ 1018

program bzoj1018;
type
  node=array [..] of boolean;
  pair=array [..] of boolean;
var
  tot,c,i,j,k,x1,y1,x2,y2:longint;
  ans:boolean;
  ch:char;
  x,y,z:node;
  left,right:array [..] of longint;
  stu:array [..] of node;
  had:array [..]of pair;

procedure swap(var a,b:longint);
begin
    if a=b then exit;
    a:=a xor b;
    b:=a xor b;
    a:=a xor b;
end;

procedure build(s,e,now:longint);
var    mid:longint;
begin
    if s=e then
        begin
            stu[now][]:=true;
            stu[now][]:=true;
            exit;
        end;
    mid:=(s+e) >>;
    inc(tot);
    left[now]:=tot;
    build(s,mid,tot);
    inc(tot);
    right[now]:=tot;
    build(mid+,e,tot);
end;

function update(a,b:node;had:pair):node;
var i,j,k:longint;
    now:node;
begin
  fillchar(now,sizeof(now),false);
  if had[] and a[] and b[] then now[]:=true;
  if had[] and a[] and b[] then now[]:=true;
  if had[] and a[] and b[] then now[]:=true;
  if had[] and a[] and b[] then now[]:=true;
  if had[] and a[] and b[] then now[]:=true;
  if had[] and a[] and b[] then now[]:=true;
  if had[] and a[] and b[] then now[]:=true;
  if had[] and a[] and b[] then now[]:=true;
  if a[] then now[]:=true;
  if a[] and a[] and had[] and had[] and b[] then now[]:=true;
  if b[] then now[]:=true;
  if b[] and b[] and had[] and had[] and a[] then now[]:=true;
  exit(now);
end;

procedure insertl(w:boolean;x,l,r,now:longint);
var mid:longint;
begin
  if l=r then
    begin
      if w then
        fillchar(stu[now],sizeof(stu[now]),true)
           else
        begin
          fillchar(stu[now],sizeof(stu[now]),false);
          stu[now][]:=true;
          stu[now][]:=true;
        end;
      exit;
    end;
  mid:=(l+r)>>;
  if x<=mid then insertl(w,x,l,mid,left[now])
            else insertl(w,x,mid+,r,right[now]);
  stu[now]:=update(stu[left[now]],stu[right[now]],had[now]);
end;

procedure insertr(w:boolean;x,y,l,r,now:longint);
var mid:longint;
begin
  mid:=(l+r)>>;
  if x=mid then
    begin
      had[now][y]:=w;
      stu[now]:=update(stu[left[now]],stu[right[now]],had[now]);
      exit;
    end;
  if x<=mid then insertr(w,x,y,l,mid,left[now])
            else insertr(w,x,y,mid+,r,right[now]);
  stu[now]:=update(stu[left[now]],stu[right[now]],had[now]);
end;

function find(x1,x2,l,r,now:longint):node;
var temp:node;
    mid:longint;
begin
  if(x1=l)and(x2=r) then exit(stu[now]);
  mid:=(l+r)>>;
  if x2<=mid then exit(find(x1,x2,l,mid,left[now]))
             else
  if x1>mid then exit(find(x1,x2,mid+,r,right[now]))
            else exit(
                      update(find(x1,mid,l,mid,left[now]),
                             find(mid+,x2,mid+,r,right[now]),
                             had[now])
                     );
end;

procedure main;
begin
  readln(c);
  build(,c,);
  repeat
    read(ch);
    case ch of
      'E':break;
      'O':begin
            read(ch,ch,ch,y1,x1,y2,x2);
            dec(y1);
            dec(y2);
            if x1=x2 then insertl(true,x1,,c,)
                     else
            if x1<x2 then insertr(true,x1,y1,,c,)
                     else insertr(true,x2,y1,,c,);
          end;
      'C':begin
            read(ch,ch,ch,ch,y1,x1,y2,x2);
            dec(y1);
            dec(y2);
            if x1=x2 then insertl(false,x1,,c,)
                     else
            if x1<x2 then insertr(false,x1,y1,,c,)
                     else insertr(false,x2,y1,,c,);
          end;
      'A':begin
            read(ch,ch,y1,x1,y2,x2);
            dec(y1);
            dec(y2);
            if x1>x2 then
              begin
                swap(x1,x2);
                swap(y1,y2);
              end;
            x:=find(,x1,,c,);
            y:=find(x1,x2,,c,);
            z:=find(x2,c,,c,);
            ans:=false;
            ans:=ans or y[y1*+y2];
            ans:=ans or(x[] and y[(-y1)*+y2]);
            ans:=ans or(z[] and y[y1*+-y2]);
            ans:=ans or(x[] and z[] and y[(-y1)*+-y2]);
            if ans then writeln('Y')
                   else writeln('N');
          end;
    end;
  until false;
end;

begin
  main;
end.

BZOJ1018