Codeforces 598D Igor In the Museum (DFS)
2016-01-28 16:10
405 查看
题目:给定一个n*m的地图,有k次查询。每次查询,询问位置(x,y)的点连通块周围有多少个*
思路:k的范围有点大,如果对每一次查询都DFS一次的话肯定超时,所以输入地图后直接暴力先DFS每一个点连通块周围的*的数量记录下来,对每次询问直接输出即可
题目
Description
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable
cells are marked with '*'. Every two adjacent cells of different types (one empty and one impassable) are divided by a wall containing one picture.
At the beginning Igor is in some empty cell. At every moment he can move to any empty cell that share a side with the current one.
For several starting positions you should calculate the maximum number of pictures that Igor can see. Igor is able to see the picture only if he is in the cell adjacent to the wall with this picture. Igor have a lot of time, so he will examine every picture
he can see.
Input
First line of the input contains three integers n, m and k (3 ≤ n, m ≤ 1000, 1 ≤ k ≤ min(n·m, 100 000)) —
the museum dimensions and the number of starting positions to process.
Each of the next n lines contains m symbols '.', '*'
— the description of the museum. It is guaranteed that all border cells are impassable, so Igor can't go out from the museum.
Each of the last k lines contains two integers x and y (1 ≤ x ≤ n, 1 ≤ y ≤ m) —
the row and the column of one of Igor's starting positions respectively. Rows are numbered from top to bottom, columns — from left to right. It is guaranteed that all starting positions are empty cells.
Output
Print k integers — the maximum number of pictures, that Igor can see if he starts in corresponding position.
Sample Input
Input
Output
Input
Output
思路:k的范围有点大,如果对每一次查询都DFS一次的话肯定超时,所以输入地图后直接暴力先DFS每一个点连通块周围的*的数量记录下来,对每次询问直接输出即可
#include <cstdio> #include <queue> #include <cstring> #include <iostream> #include <cstdlib> #include <algorithm> #include <vector> #include <map> #include <string> #include <set> #include <ctime> #include <cmath> #include <cctype> using namespace std; #define maxn 1001 #define LL long long int cas=1,T; int dir[4][2] = {{1,0},{-1,0},{0,1},{0,-1}}; char mapp[maxn][maxn]; int vis[maxn][maxn]; int num[maxn*maxn]; int ans,id=0,m,n; void dfs(int x,int y) { int nx,ny; vis[x][y]=id; for (int i = 0;i<4;i++) { nx = x+dir[i][0]; ny = y+dir[i][1]; if (nx>0 && nx<=n && ny>0 && ny<=m && !vis[nx][ny]) { if (mapp[nx][ny] == '*') ans++; else dfs(nx,ny); } } } int main() { int k; scanf("%d%d%d",&n,&m,&k); for (int i = 1;i<=n;i++) scanf("%s",mapp[i]+1); memset(vis,0,sizeof(vis)); for (int i = 1;i<=n;i++) for (int j = 1;j<=m;j++) if (mapp[i][j] == '.' && !vis[i][j]) { ans = 0; id++; dfs(i,j); num[id]=ans; } while (k--) { int x,y; scanf("%d%d",&x,&y); printf("%d\n",num[vis[x][y]]); } //freopen("in","r",stdin); //scanf("%d",&T); //printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC); return 0; }
题目
Description
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable
cells are marked with '*'. Every two adjacent cells of different types (one empty and one impassable) are divided by a wall containing one picture.
At the beginning Igor is in some empty cell. At every moment he can move to any empty cell that share a side with the current one.
For several starting positions you should calculate the maximum number of pictures that Igor can see. Igor is able to see the picture only if he is in the cell adjacent to the wall with this picture. Igor have a lot of time, so he will examine every picture
he can see.
Input
First line of the input contains three integers n, m and k (3 ≤ n, m ≤ 1000, 1 ≤ k ≤ min(n·m, 100 000)) —
the museum dimensions and the number of starting positions to process.
Each of the next n lines contains m symbols '.', '*'
— the description of the museum. It is guaranteed that all border cells are impassable, so Igor can't go out from the museum.
Each of the last k lines contains two integers x and y (1 ≤ x ≤ n, 1 ≤ y ≤ m) —
the row and the column of one of Igor's starting positions respectively. Rows are numbered from top to bottom, columns — from left to right. It is guaranteed that all starting positions are empty cells.
Output
Print k integers — the maximum number of pictures, that Igor can see if he starts in corresponding position.
Sample Input
Input
5 6 3 ****** *..*.* ****** *....* ****** 2 2 2 5 4 3
Output
6 4 10
Input
4 4 1 **** *..* *.** **** 3 2
Output
8
相关文章推荐
- Django基础(一)
- Educational Codeforces Round 5 (D. Longest k-Good Segment)
- google map geocoder 地理位置编码的实例
- Dragon of Loowater(贪心)
- GoldenGate配置(二)之双向复制配置
- 集锦——浏览器每次访问自动更新网页,不用手工设置,附Google/firefox/Ie
- Visualizing Concurrency in Go--转
- MonogoDb的角色分类
- Django搭配Celery进行异步/定时任务(一)初步搭建
- GregorianCalendar 当前时间的昨天18点
- 香港谷歌google公司的福利待遇,惊艳到没???
- 设计模式—适配器模式(Go语言描述)
- 统计数据:Google排名高的是什么样的页面?
- Go学习 数组和切片
- Cassandra中Gossip具体实现方式
- cassandra 之 gossip实现
- 从HelloWorld来看Go语言的基本面貌
- Go语言代码自动更新服务器代码分享
- Google Design View 之间继承关系
- I.MX6 Goodix GT9xx touchscreen driver porting