(0<=W,D<=1000)
(0<x0<W, 0<y0<D)
(0<x1<W, 0<y1<D)

if w and d are 0 then no x or y can be taken.

My algo is O(n). Reading and checking in one loop. With out stack, queue, array or recursion. It is really? Sorry, I don't speak English.

This is a stupid trick, since q = 0 is not considered positive. Hope it saves a few minutes of your life.

>>4
>>9 9 1 9

<<1

>>20
>>1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

<<378

>>7
>>1 2 3 4 5 6 7

<<11

In this problem we want to minimize the total time needed for all workers as if they run to the shelters one by one. I think this is illogical as in case of a bombardment all workers will run to the shelters simultaneously.

I think yes, but it's not clear from problem statement despite the name of this set.

Here is my code!!! Please help me!!! What my mistake?
Const stroka='friend';
TYpe lmas=array[1..5000]of string;
VAR n     :integer;
    fr    :array[1..100]of string;
    a,b,c :array[1..100]of lmas;
    d,g,h :array[0..100]of integer;
Procedure INIT;
var i,j,p :integer;
    ch    :char;
    s,s1  :string;
begin
  readln(n);
  for i:=1 to n do begin
    readln(fr[i]);
    readln(s); j:=0; s1:='';
    while s<>'</blog>' do begin
      s1:=copy(s,pos('<',s)+1,6);
      while s1=stroka do begin
        p:=pos('<',s);
        if stroka=s1 then begin
           delete(s,pos('<',s),8);
           if copy(s,p,pos('<',s)-p)<>fr[i] then begin inc(j); a[i,j]:=copy(s,p,pos('<',s)-p); end;
        end;
        s1:=copy(s,pos('<',s)+1,6);
      end;
      s1:='';
      for p:=length(s) downto 1 do
        if s[p]<>' ' then begin s1:=s[p]+s1; if s1='</blog>' then begin s:=''; break; end else if length(s1)>7 then break;  end;
      if s='' then break; readln(s);
    end;
    d[i]:=j;
  end;
end;
Function FRIEND(x,y:integer):integer;
var i   :integer;
begin
  FRIEND:=0;
  for i:=1 to n do
    if x<>i then if fr[i]=a[x,y] then begin FRIEND:=i; exit end;
end;
Function OK(x,y:integer):boolean;
var i,j   :integer;
begin
  i:=FRIEND(x,y); OK:=FALSE;
  for j:=1 to d[i] do
    if a[i,j]=fr[x] then begin OK:=TRUE; exit end;
end;
Procedure SORT(var s:lmas;n:integer);
var i,j :integer;
    k   :string;
begin
  for j:=1 to n-1 do
    for i:=1 to n-j do
      if s[i]>s[i+1] then begin k:=s[i]; s[i]:=s[i+1]; s[i+1]:=k; end;
end;
Procedure SOLVE;
var i,j,p :integer;
begin
  for i:=1 to n do
    for j:=1 to d[i] do begin
      p:=FRIEND(i,j);
      inc(g[p]); b[p,g[p]]:=fr[i];
    end;
  for i:=1 to n do
    for j:=1 to d[i] do
      if OK(i,j) then begin inc(h[i]); c[i,h[i]]:=a[i,j]; end;
  for i:=1 to n do SORT(a[i],d[i]);
  for i:=1 to n do SORT(b[i],g[i]);
  for i:=1 to n do SORT(c[i],h[i]);
end;
Procedure OUT;
var i,j   :integer;
begin
  for i:=1 to n do begin
    writeln(fr[i]);
    write('1: '); j:=1; while j<d[i] do begin write(a[i,j],', '); inc(j); end; if a[i,j]<>'' then writeln(a[i,j]) else writeln;
    write('2: '); j:=1; while j<g[i] do begin write(b[i,j],', '); inc(j); end; if b[i,j]<>'' then writeln(b[i,j]) else writeln;
    write('3: '); j:=1; while j<h[i] do begin write(c[i,j],', '); inc(j); end; if c[i,j]<>'' then writeln(c[i,j]) else writeln;
    writeln;
  end;
end;
BEGIN
  INIT;
  SOLVE;
  OUT;
END.

INPUT:
2
*22#
q#

OUTPUT:
q2

When I got "outpoot limit exceeded" at the first time, I add check when number of chars writed >100000 then programs must terminate. But that program got OLE again(
What reason? I really don't understand. Maybe bug in checker?

Can you tell me if the required "well" convex hull can have points not from the set M?

Thank you.

Well-formed convex hull of set M is minimal (relative to inclusion) set, containing M

Please look at the problem statement! I (and some other people at the webboard) think that in description of walls the words "...the pair of numbers M and N define..." should be changed to "...the pair of numbers N and M define..." - M and N should be swapped both in description of horisontal and vertical walls.
I also got WA at test 2 first. But when I swapped N and M - I got AC!

3 2
1 1
1 2
h
2 1

answer is "No solution"

Maybe there is a special case that is not mentioned in the problem or I didn't understand... Can you give some tests?

I watched all cases wich was here plus my own. THEY ARE ALL TRUE!
Please help me, give me some extra extra extra test, PLZ!!!

Edited by author 18.12.2007 10:29

If you crash on test3.............
Don't forgot that n may be 1 or 2.It is possible!

who can give your code to me ?
  if you used suffix arry or suffix tree
  The best  used c language


email: k13795263@126.com

what's wrong with site? , I can't open some pages...

for example this
http://acm.timus.ru/monitor.aspx?id=48

Aidin_n7@hotmail.com