NOIP2011

DAY1

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

模拟

倒序离线处理

 program carpet;
 var
   l,w:array[..,..] 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:= to n do
    begin
      readln(a,b,g,k);
      l[i,]:=a;
      l[i,]:=a+g;
      w[i,]:=b;
      w[i,]:=b+k;
    end;
   readln(x,y);
   flag:=true;
   for i:=n downto  do
    if (l[i,]<=x)and(x<=l[i,]) and (w[i,]<=y)and(y<=w[i,]) then
     begin writeln(i); flag:=false; break; end;
   if flag then writeln(-);
 close(input);
 close(output);
 end.

我今年的程序

 var
   n,i,g,k,x,y:longint;
   a,b,c,d:array[..] of longint;
 begin
 assign(input,'carpet.in');
 reset(input);
 assign(output,'carpet.out');
 rewrite(output);
   readln(n);
   for i:= 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  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(-);
 close(input);
 close(output);
 end.

 program P620;
 var
   x,y,n,a1,b1,i,j,s:longint;
   a,b,c,d:array[..] of longint;
 begin
 assign(input,'carpet.in');
 reset(input);
 assign(output,'carpet.out');
 rewrite(output);
   readln(n);
   for i:= 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:=-;
    for i:= 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.

我以前的程序