【SHOI2008 堵塞的交通】线段树维护条状网格图的连通性

题意很简洁，这里就不复述了

这题其实是WC最短路的超级简化版，方法类似

大概就是用一个线段树维护一个区间的左端点到右端点的连通情况，这个信息显然是可以合并的

由于只有两层，所以我维护了如下几个信息

左上-左下

右上-右下

左上-右上

左上-右下

左下-右上

左下-右下

的连通性

修改的时候直接改就可以了，至于询问，由于我们维护的是仅在当前区间走的信息，而最终的路径可能跨区间，所以询问(l~r)时，不仅要求出(l~r)，还要询问(1~l)，(r~n)，讨论一下最终路线的3种情况更新答案即可

ps：速度很慢，代码量不错

program syj; const fx:array[1..2,1..3]of longint =((0,0,1),(0,0,-1)); fy:array[1..2,1..3]of longint =((1,-1,0),(1,-1,0)); bk:array[1..3]of longint =(2,1,3); maxn=100005; type arr=array[1..3,1..2]of boolean; var z,x,y,n,t,i,ii,jj,kk,x1,y1,x2,y2,p,xx,yy:longint; ch:char; b:array[false..true]of char; a:array[1..2,0..maxn,1..3]of boolean; f:array[0..maxn*3]of arr; aa,bb,cc:arr; tmp:boolean; gg:array[0..1]of arr; procedure update(var x,y,z:arr;m:longint); begin tmp:=a[1,m,1]and a[2,m,1]; x[3,1]:=y[3,1]or tmp and y[1,1]and y[2,2]and z[3,1]; x[3,2]:=z[3,2]or tmp and z[1,1]and z[2,2]and y[3,2]; for ii:=1 to 2 do for jj:=1 to 2 do begin x[ii,jj]:=false; for kk:=1 to 2 do x[ii,jj]:=x[ii,jj]or y[ii,kk]and a[kk,m,1]and z[kk,jj]; end; end; procedure update(i,l,r:longint); var m:longint; begin if l=r then begin f[i][3,1]:=a[1,l,3]; f[i][3,2]:=a[1,l,3]; f[i][1,2]:=a[1,l,3]; f[i][2,1]:=a[1,l,3]; end else begin m:=(l+r)>>1; if x<=m then update(i*2,l,m) else update(i*2+1,m+1,r); update(f[i],f[i*2],f[i*2+1],m); end; end; procedure change(x1,y1,x2,y2:longint;z:boolean); begin for i:=1 to 3 do if (x1+fx[x1,i]=x2)and(y1+fy[x1,i]=y2) then begin a[x1,y1,i]:=z; a[x2,y2,bk[i]]:=z; break; end; x:=y1; update(1,1,n); end; procedure ask(var g:arr;x,y:longint); var t:longint; procedure ask(i,l,r:longint); var m:longint; begin if (x<=l)and(r<=y) then begin if t=0 then gg[p]:=f[i] else update(gg[p],gg[1-p],f[i],t); t:=r;p:=1-p; end else begin m:=(l+r)>>1; if x<=m then ask(i*2,l,m); if y>m then ask(i*2+1,m+1,r); end; end; begin fillchar(gg,sizeof(gg),0); t:=0;p:=0; ask(1,1,n); g:=gg[1-p]; end; procedure build(i,l,r:longint); var m:longint; begin if l=r then begin f[i,1,1]:=true;f[i,2,2]:=true; end else begin m:=(l+r)>>1; build(i*2,l,m);build(i*2+1,m+1,r); end; end; begin assign(input,'traffic.in');reset(input); assign(output,'traffic.out');rewrite(output); b[true]:='Y';b[false]:='N'; readln(n); build(1,1,n); while true do begin read(ch); if ch='E' then break; if ch='O' then begin read(ch,ch,ch); readln(x1,y1,x2,y2); change(x1,y1,x2,y2,true) end else if ch='C' then begin read(ch,ch,ch,ch); readln(x1,y1,x2,y2); change(x1,y1,x2,y2,false); end else begin read(ch,ch); readln(x1,y1,x2,y2); if y1>y2 then begin z:=x1;x1:=x2;x2:=z; z:=y1;y1:=y2;y2:=z; end; ask(aa,y1,y2); ask(bb,1,y1); ask(cc,y2,n); tmp:=aa[x1,x2]or bb[3,2]and aa[3-x1,x2]or cc[3,1]and aa[x1,3-x2]or bb[3,2]and aa[3-x1,3-x2]and cc[3,1]; writeln(b[tmp]); end; end; close(input);close(output); end.