ZZULIoj 1908 小火山的围棋梦想

 1 #include<cstdio>
 2 #include<string.h>
 3 int dx[4]={-1,1,0,0};
 4 int dy[4]={0,0,-1,1};
 5 char map[30][30];
 6 int flag[30][30];
 7 int n,m,good;
 8 struct stu
 9 {
10     int x,y;
11 }key[1000];
12 void f(int xx,int yy)
13 {    
14     int nx,ny,i,j;
15     if(xx==0 || xx == n-1 || yy == 0 || yy == m-1)        //判断是否是外围的点 
16     {
17         good=1;
18     }
19     for(i = 0 ; i < 4 ; i++)
20     {
21         nx=xx+dx[i];
22         ny=yy+dy[i];
23         if(nx >= 0 && ny >= 0 && nx < n && ny < m && flag[nx][ny] == 0 && map[nx][ny] == ‘.‘)
24         {
25             flag[nx][ny]=1;
26             f(nx,ny);
27         }        
28     }
29 }
30 int main()
31 {
32     int t,s=0;
33     
34     scanf("%d",&t);
35     
36     while(t--)
37     {
38         int i,j,k;
39         
40         int num=0;
41         
42         scanf("%d %d",&n,&m);
43         
44         memset(map,‘.‘,sizeof(map));
45         
46         for(i = 0 ; i < n ; i++)
47         {
48             scanf("%s",map[i]);
49             for(j = 0 ; j < m ; j++)
50             {
51                 if(map[i][j] == ‘.‘)
52                 {
53                     key[++num].x=i;
54                     key[num].y=j;
55                 }
56                 
57             }
58         }    
59         for(i = 1 ; i <= num ; i++)
60         {
61             memset(flag,0,sizeof(flag));            //每次都要清零 
62             
63             good=0;
64             
65             flag[key[i].x][key[i].y]=1;
66             
67             if(map[key[i].x][key[i].y] == ‘.‘)
68             
69             f(key[i].x,key[i].y);
70                 
71             if(good == 0)                            //good=0说明没有最外围的点 
72             {
73                 for(k = 0 ; k < n ; k++)
74                 {
75                     for(j = 0 ; j < m ; j++)
76                     {
77                         if(flag[k][j] == 1)
78                             map[k][j]=‘*‘;
79                     }
80                 }
81             }
82         } 
83         printf("Case %d:\n",++s);
84         
85         for(i = 0 ; i < n ; i++)
86         {
87             for(j = 0 ; j < m ; j++)
88             {
89                 printf("%c",map[i][j]);
90             }
91             
92             printf("\n");
93         }
94     }
95 }