3406: [Usaco2009 Oct]Invasion of the Milkweed 乳草的入侵

3406: [Usaco2009 Oct]Invasion of the Milkweed 乳草的入侵

Time Limit: 3 Sec  Memory Limit: 128 MB
Submit: 87  Solved: 49
[Submit][Status][Discuss]

Description

Input

  第1行：4个由空格隔开的整数X，K Mx，My.

    第2到第Y+1行：每行由X个字符描述草地．

Output

    一个单独的整数表示最后一个不是大石块的格子被乳草占领的星期数

Sample Input

4 3 1 1
....
..*.
.**.

Sample Output

4

HINT

 

Source

Gold

题解：题目本身很水，一道灌水法，BFS秒杀

但还是WA了一下，表示题目描述简直坑爹不解释，注意看清题目描述再下手（还有OI经常很良心的让你就算题目理解错了也能过样例TT）

/**************************************************************
    Problem: 3406
    User: HansBug
    Language: Pascal
    Result: Accepted
    Time:20 ms
    Memory:444 kb
****************************************************************/
 
const dir:array[1..8,1..2] of longint=((1,0),(-1,0),(0,1),(0,-1),(1,1),(-1,-1),(-1,1),(1,-1));
var
   i,j,k,l,m,n,x,y,x0,y0,f,r:longint;
   a:array[0..101,0..101] of longint;
   d:array[0..15000,1..3] of longint;
   ch:char;
begin
     readln(m,n,y,x);x:=n+1-x;
     for i:=0 to n+1 do
         begin
              a[i,m+1]:=1;
              a[i,0]:=1;
         end;
     for i:=0 to m+1 do
         begin
              a[n+1,i]:=1;
              a[0,i]:=1;
         end;
     for i:=1 to n do
         for j:=1 to m do
             begin
                  read(ch);
                  if ch='.' then a[i,j]:=0 else a[i,j]:=1;
                  if j=m then readln;
             end;
     d[1,1]:=x;d[1,2]:=y;d[1,3]:=0;f:=1;r:=2;
     while f<r do
           begin
                for i:=1 to 8 do
                    begin
                         x0:=d[f,1]+dir[i,1];
                         y0:=d[f,2]+dir[i,2];
                         if a[x0,y0]=0 then
                            begin
                                 d[r,1]:=x0;
                                 d[r,2]:=y0;
                                 d[r,3]:=d[f,3]+1;
                                 inc(r);a[x0,y0]:=1;
                            end;
                    end;
                inc(f);
           end;
     writeln(d[f-1,3]);
     readln;
end.