USACO 2.1.1&&POJ 1164(dfs)

最新推荐文章于 2022-01-24 20:38:49 发布

Tongqi_Liu

最新推荐文章于 2022-01-24 20:38:49 发布

阅读量488

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM/ICPC 图论

本文链接：https://blog.youkuaiyun.com/fipped/article/details/22741653

ACM/ICPC 同时被 2 个专栏收录

198 篇文章

订阅专栏

图论

93 篇文章

订阅专栏

本文介绍了一种算法，用于计算城堡地图中的房间数量及最大房间面积。算法通过解析地图描述，采用深度优先搜索（DFS）策略来识别独立房间，并统计总面积。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The Castle

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 5557		Accepted: 3129

Description

     1   2   3   4   5   6   7  
   #############################
 1 #   |   #   |   #   |   |   #
   #####---#####---#---#####---#
 2 #   #   |   #   #   #   #   #
   #---#####---#####---#####---#
 3 #   |   |   #   #   #   #   #
   #---#########---#####---#---#
 4 #   #   |   |   |   |   #   #
   #############################
(Figure 1)

#  = Wall   
|  = No wall
-  = No wall

Figure 1 shows the map of a castle.Write a program that calculates
1. how many rooms the castle has
2. how big the largest room is
The castle is divided into m * n (m<=50, n<=50) square modules. Each such module can have between zero and four walls.

Input

Your program is to read from standard input. The first line contains the number of modules in the north-south direction and the number of modules in the east-west direction. In the following lines each module is described by a number (0 <= p <= 15). This number is the sum of: 1 (= wall to the west), 2 (= wall to the north), 4 (= wall to the east), 8 (= wall to the south). Inner walls are defined twice; a wall to the south in module 1,1 is also indicated as a wall to the north in module 2,1. The castle always has at least two rooms.

Output

Your program is to write to standard output: First the number of rooms, then the area of the largest room (counted in modules).

Sample Input

4
7
11 6 11 6 3 10 6
7 9 6 13 5 15 5
1 10 12 7 13 7 5
13 11 10 8 10 12 13

Sample Output

5
9

#include <iostream> #include <stdio.h> #include <queue> #include <math.h> #include <string.h> #include <algorithm> using namespace std; int map[55][55]; int vis[55][55]; int area = 0,ans = 0; int col,row; void dfs(int i,int j) { if(i<1||j<1||i>row||j>col) return ; if(vis[i][j]) return ; else { vis[i][j] = 1; ++ans; if(map[i][j]%2 == 0) // 1 2 4 8 西边肯定没墙 { if(j >= 2) dfs(i,j-1); } map[i][j] /= 2; if(map[i][j]%2 == 0) // 0 1 2 4 北边肯定没墙 { if(i >= 2) dfs(i-1,j); } map[i][j] /= 2; if(map[i][j]%2 == 0) // 0 0 1 2 东边肯定没墙 { if(j <= col-1) dfs(i,j+1); } map[i][j] /= 2; if(map[i][j]%2 == 0) // 0 0 0 1 南边肯定没墙 { if(i <= row-1) dfs(i+1,j); } } } int main() { // freopen("castle.in","r",stdin); // freopen("castle.out","w",stdout); while(~scanf("%d%d",&row,&col)) { memset(map,0,sizeof(map)); int i,j; for(i=1 ;i <= row ; i++) for(j=1 ;j <= col ; j++) scanf("%d",&map[i][j]); ans = 0; int count = 0; memset(vis,0,sizeof(vis)); for(i=1 ;i <= row ; i++) for(j=1 ;j <= col ; j++) { ans = 0; dfs(i,j); vis[i][j]=0; if(ans > area) area = ans; if(ans) ++count; } cout<<count<<endl; cout<<area<<endl; } return 0; }