NOIP2011

DAY1

铺地毯
(carpet.cpp/c/pas)

模拟

倒序离线处理

program carpet;
var
  l,w:array[0..10000,1..2] of longint;
  n,i,a,b,g,k,x,y:longint;
  flag:boolean;
begin
assign(input,'carpet.in');
reset(input);
assign(output,'carpet.out');
rewrite(output);
  readln(n);
  for i:=1 to n do
   begin
     readln(a,b,g,k);
     l[i,1]:=a;
     l[i,2]:=a+g;
     w[i,1]:=b;
     w[i,2]:=b+k;
   end;
  readln(x,y);
  flag:=true;
  for i:=n downto 1 do
   if (l[i,1]<=x)and(x<=l[i,1]) and (w[i,1]<=y)and(y<=w[i,2]) then
    begin writeln(i); flag:=false; break; end;
  if flag then writeln(-1);
close(input);
close(output);
end.

var
  n,i,g,k,x,y:longint;
  a,b,c,d:array[1..10000] of longint;
begin
assign(input,'carpet.in');
reset(input);
assign(output,'carpet.out');
rewrite(output);
  readln(n);
  for i:=1 to n do
   begin
     readln(a[i],b[i],g,k);
     c[i]:=a[i]+g;
     d[i]:=b[i]+k;
   end;
  readln(x,y);
  for i:=n downto 1 do
   if (x>=a[i]) and (x<=c[i]) and (y>=b[i]) and (y<=d[i])
    then begin writeln(i); close(input); close(output); halt; end;
  writeln(-1);
close(input);
close(output);
end.

program P620;
var
  x,y,n,a1,b1,i,j,s:longint;
  a,b,c,d:array[1..10000] of longint;
begin
assign(input,'carpet.in');
reset(input);
assign(output,'carpet.out');
rewrite(output);
  readln(n);
  for i:=1 to  n do
  begin
    readln(a[i],b[i],a1,b1);
    c[i]:=a[i]+a1;
    d[i]:=b[i]+b1;
  end;
  readln(x,y);
  s:=-1;
   for i:=1 to n do
    if (a[i]<=x)and(b[i]<=y)and(c[i]>=x)and(d[i]>=y) then s:=i;
   writeln(s);
end.