记录编号 |
84970 |
评测结果 |
AAW |
题目名称 |
烦人的幻灯片 |
最终得分 |
66 |
用户昵称 |
srt09 |
是否通过 |
未通过 |
代码语言 |
Pascal |
运行时间 |
0.003 s |
提交时间 |
2013-12-22 14:29:54 |
内存使用 |
0.17 MiB |
显示代码纯文本
var mp:array[1..52,1..52]of boolean;
a:array[0..26,1..4]of longint;
b:array[0..26,1..2]of longint;
c,e,f1,f2,g:array[1..52]of longint;
d:array[1..52]of boolean;
i,n,j,len,kk:longint;
fx:longint;
procedure se(k:longint);
var pt:longint;
lx:boolean;
begin
if (len<n*2) then
begin
if k<=n then
begin
for pt:=n+1 to n*2 do
if (mp[k,pt])and(d[pt]) then
begin
inc(len);c[len]:=pt;d[pt]:=false;
se(pt);
d[pt]:=true;c[len]:=0;dec(len);
end;
end
else for pt:=1 to n do
if (mp[k,pt])and(d[pt]) then
begin
inc(len);c[len]:=pt;d[pt]:=false;
se(pt);
d[pt]:=true;c[len]:=0;dec(len);
end;
end
else begin
lx:=true;
for pt:=1 to fx do
if(c[1]=f2[pt])and(c[n*2]=f1[pt]) then lx:=false;
if lx then begin inc(fx); f1[fx]:=c[1]; f2[fx]:=c[n*2]; end;
for pt:=1 to n*2 do g[pt]:=c[pt];
exit;
end;
end;
function inp(x,y:longint):boolean;
begin
inp:=false;
if (b[x,1]>a[y,1])and(b[x,1]<a[y,2])and
(b[x,2]>a[y,3])and(b[x,2]<a[y,4]) then inp:=true;
end;
begin
assign(input,'slides.in');reset(input);
assign(output,'slides.out');rewrite(output);
readln(n);
fillchar(mp,sizeof(mp),false);
for i:=1 to n do readln(a[i,1],a[i,2],a[i,3],a[i,4]);
for i:=1 to n do readln(b[i,1],b[i,2]);
for i:=1 to n do
for j:=1 to n do
if inp(i,j) then
begin
mp[i,j+n]:=true;
mp[j+n,i]:=true;
end;
fx:=0;
fillchar(d,sizeof(d),true);
for i:=1 to n do
begin
len:=1;
d[i]:=false;
c[1]:=i;
se(i);
d[i]:=true;
end;
fillchar(d,sizeof(d),true);
if fx<>1 then writeln('None')
else
begin
for i:=1 to n*2 do
c[i]:=g[i];
if c[1]>n then kk:=1
else kk:=0;
for i:=1 to n do
e[c[i*2-kk]]:=i*2-kk;
for i:=n+1 to n*2 do
if kk=1
then writeln(chr(i-n+ord(64)),' ',c[e[i]+1])
else writeln(chr(i-n+ord(64)),' ',c[e[i]-1]);
end;
close(input);
close(output);
end.