TYVJ P1035 棋盘覆盖

TYVJ P1035 棋盘覆盖

var fa:array [1..10000] of longint; g:array [1..10000,1..4] of boolean; v:array [0..101,0..101] of boolean; v2:array [-200..10200] of boolean; n,n2,m:longint; procedure init; var i,a,b:longint; begin readln(n,m); n2:=n; fillchar(v,sizeof(v),true); fillchar(g,sizeof(g),false); for i:=1 to m do begin readln(a,b); v[a,b]:=false; end; end; procedure built; var i,t1,t2:longint; begin for i:=1 to n*n do begin t1:=(i-1) div n+1; t2:=(i-1) mod n+1; if not v[t1,t2] then continue; if v[t1,t2-1] and (t2>1) then g[i,1]:=true; if v[t1,t2+1] and (t21) then g[i,3]:=true; if v[t1+1,t2] and (t1-1 then if i<>fa[fa[i]] then writeln('Error'); end;begin init; built; main;end.