The Castle
来源:互联网 发布:flexikey软件如何卸载 编辑:程序博客网 时间:2024/05/19 23:25
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
4711 6 11 6 3 10 67 9 6 13 5 15 51 10 12 7 13 7 513 11 10 8 10 12 13
Sample Output
59
#include<iostream>using namespace std;int a[1001][1001],p[1001][1001],d,i,j,maxm,ans,n,m;void dfs(int x,int y){p[x][y]=1;d++;if(a[x][y]>=8) a[x][y]-=8;else if(p[x+1][y]==0)dfs(x+1,y);if(a[x][y]>=4) a[x][y]-=4;else if(p[x][y+1]==0)dfs(x,y+1);if(a[x][y]>=2) a[x][y]-=2;else if(p[x-1][y]==0)dfs(x-1,y);if(a[x][y]>=1) a[x][y]-=1;else if(p[x][y-1]==0)dfs(x,y-1);}int main(){cin>>n>>m;for(i=1;i<=n;i++) for(j=1;j<=m;j++) cin>>a[i][j];for(i=1;i<=n;i++) for(j=1;j<=m;j++) if(p[i][j]==0){ d=0; dfs(i,j); ans++; if(d>maxm)maxm=d;}cout<<ans<<endl<<maxm;return 0;}
dfs搞定,只要连在一起就算一个房间,一个深搜连时限都不用管
0 1
- The Castle
- The Castle
- the castle
- The Castle
- The Castle
- The Castle
- The Castle
- The Castle
- USACO 2.1 The Castle (castle)
- USACO2.1.1 The Castle (castle)
- USACO2.1.1 The Castle (castle)
- 【图论】【USACO】The Castle
- 2.1.2 The Castle
- Section 2.1 The Castle
- 2.1The Castle
- usaco-the castle
- 【染色】The Castle 城堡
- 深搜:The Castle
- 泰勒公式的推导过程(日期推算星期)
- An error occurred while installing sqlite3 (1.3.11), and Bundler cannot continue
- GCD使用 串行并行队列 与 同步异步执行的各种组合 及要点分析
- UINavigationBar透明设置
- oracle笔记
- The Castle
- 旋转矩阵和旋转向量
- 想知道站点是否被惩罚?这些数据赶紧研究!
- 将n位2进制字符串转换为10进制字符串的办法(不直接转化成整数)
- UIWebView - 3
- 大话设计模式学习笔记
- 成员函数
- Dom4j 解析XML实例
- 图片标记