CF 598D. Igor In the Museum【DFS】
来源:互联网 发布:淘宝图片空间怎么清空 编辑:程序博客网 时间:2024/05/17 08:41
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int dirx[] = {-1, 0, 1, 0};int diry[] = {0, 1, 0, -1};const int M = 1010;char map[M][M];int vis[M][M], ans[M*M];int n, m, num, id;void dfs(int x, int y){vis[x][y] = id;for(int i = 0; i < 4; ++i){int dx = x+dirx[i];int dy = y+diry[i];if(dx > 0 && dx <= n && dx > 0 && dy <= m && !vis[dx][dy]){if(map[dx][dy] == '*') num++;else dfs(dx, dy);}}}int main(){int t;scanf("%d%d%d", &n,&m,&t);int i, j, k;for(i = 1; i <= n; ++i) scanf("%s", map[i]+1);id = 0;memset(vis, 0, sizeof(vis));for(i = 1; i <= n; ++i){for(j = 1; j <= m; ++j){if(map[i][j] == '.' && !vis[i][j]){num = 0, ++id, dfs(i, j), ans[id] = num;}}}while(t--){int a, b;scanf("%d%d", &a, &b);printf("%d\n", ans[vis[a][b]]);}return 0;}
0 0
- CF 598D. Igor In the Museum【DFS】
- D. Igor In the Museum(简单DFS)
- Codeforces 598D Igor In the Museum 【DFS】
- Codeforces 598D Igor In the Museum (dfs)
- Codeforces 598D Igor In the Museum (DFS)
- CodeForces 598D-Igor In the Museum【DFS】
- CodeForces 598D Igor In the Museum【dfs】
- CodeForces 598D Igor In the Museum【dfs】
- CodeForces 598 D. Igor In the Museum(dfs)
- Codeforces 598D:Igor In the Museum
- codeforces 598D - Igor In the Museum
- CodeForces - 598D Igor In the Museum
- Educational Codeforces Round 1 D.Igor In the Museum(DFS)
- codeforces_598D. Igor In the Museum(dfs)
- CodeForces 598D Igor In the Museum 暴力
- Codeforces 598D Igor In the Museum(概率DP)
- Codeforces 598D Igor In the Museum(bfs)
- Codeforces 598D Igor In the Museum 离线处理+bfs
- 、给一组字符串,需要你输出最小长度的字符串与最大长度的字符串,如果有相同最小(大)长度的,就按照给的顺序挨个输出。
- mysql表数据导出
- HUST-OJ-1669
- FZU 2197 最小花费(思维题目)
- Makefile语法分析
- CF 598D. Igor In the Museum【DFS】
- 白话经典算法系列之一 冒泡排序的三种实现(转)
- OpenCV 自带例程总结
- 第一篇博客 hexo学习笔记
- JAVA学习笔记01
- poi读写excel 2007
- 字符串三种截取方法iOS
- 盘点Android应用开发中曾经很流行但是已经过时或即将过时的技术
- 基础3