CodeForces 510B Fox And Two Dots(判断环的存在性,DFS一类题)
来源:互联网 发布:软件修改器 编辑:程序博客网 时间:2024/05/16 04:38
http://codeforces.com/problemset/problem/510/B
Fox Ciel is playing a mobile puzzle game called "Two Dots". The basic levels are played on a board of size n × m cells, like this:
Each cell contains a dot that has some color. We will use different uppercase Latin characters to express different colors.
The key of this game is to find a cycle that contain dots of same color. Consider 4 blue dots on the picture forming a circle as an example. Formally, we call a sequence of dots d1, d2, ..., dk a cycle if and only if it meets the following condition:
- These k dots are different: if i ≠ j then di is different from dj.
- k is at least 4.
- All dots belong to the same color.
- For all 1 ≤ i ≤ k - 1: di and di + 1 are adjacent. Also, dk and d1 should also be adjacent. Cells x and y are called adjacent if they share an edge.
Determine if there exists a cycle on the field.
The first line contains two integers n and m (2 ≤ n, m ≤ 50): the number of rows and columns of the board.
Then n lines follow, each line contains a string consisting of m characters, expressing colors of dots in each line. Each character is an uppercase Latin letter.
Output "Yes" if there exists a cycle, and "No" otherwise.
3 4AAAAABCAAAAA
Yes
3 4AAAAABCAAADA
No
4 4YYYRBYBYBBBYBBBY
Yes
7 6AAAAABABBBABABAAABABABBBABAAABABBBABAAAAAB
Yes
2 13ABCDEFGHIJKLMNOPQRSTUVWXYZ
No
In first sample test all 'A' form a cycle.
In second sample there is no such cycle.
The third sample is displayed on the picture above ('Y' = Yellow, 'B' = Blue, 'R' = Red).
题意:
判断给定的地图中是否存在相同字母组成的环。
思路:
在 DFS 的回溯过程中,如果存在遍历时的情况是上一次已经遍历的,就存在这样的环,
难点在于怎么样去标记已经遍历的坐标,除了引入访问标记数组之外,还引入一个变量,
参考代码。
Code:
#include<cstdio>#include<cstring>const int MYDD=1103;int n,m;char now,map[64][64];int vis[64][64];int dx[]= {-1,1,0,0};int dy[]= {0,0,-1,1};bool DFS(int y,int x,int dd) {vis[y][x]=dd;for(int j=0; j<4; j++) {int gx=x+dx[j];int gy=y+dy[j];if(gx>=0&&gx<m&&gy>=0&&gy<n&&map[gy][gx]==now) {if(vis[gy][gx]==-1) {if(DFS(gy,gx,dd+1))return true;// 找到上一次 DFS 访问的坐标// 即一个坐标被访问了两次} else if(vis[gy][gx]!=dd-1)return true;}}return false;}int main() {scanf("%d%d",&n,&m);for(int j=0; j<n; j++)scanf("%s",map[j]);memset(vis,-1,sizeof(vis));//坐标初始化没有访问for(int j=0; j<n; j++) {for(int k=0; k<m; k++) {now=map[j][k];if(vis[j][k]==-1)if(DFS(j,k,0)) {puts("Yes");return 0;}}}puts("No");return 0;}/* By:Shyazhut */
- CodeForces 510B Fox And Two Dots(判断环的存在性,DFS一类题)
- CodeForces 510 B. Fox And Two Dots(DFS)
- CodeForces 510B Fox And Two Dots(DFS)
- CodeForces 510B Fox And Two Dots (DFS)
- 【Codeforces】-510B-Fox And Two Dots(dfs)
- DFS CodeForces 510B (Fox And Two Dots)
- 【CodeForces 510B】 Fox And Two Dots (dfs+bfs)
- codeforces B. Fox And Two Dots (dfs)
- Codeforces 510B Fox And Two Dots DFS
- codeforces-510B-Fox And Two Dots【DFS】
- CodeForces 510B Fox And Two Dots(深搜DFS)
- CodeForces 510B Fox And Two Dots
- 【CodeForces 510B】Fox And Two Dots
- Codeforces 510B. Fox And Two Dots
- codeforces 510b Fox And Two Dots
- Codeforces 510B:Fox And Two Dots(DFS变形+技巧)
- codeforces 510.B Fox And Two Dots (DFS好题)
- 【CodeForces】510B - Fox And Two Dots(bfs)
- 2016.08.15【初中部 NOIP提高组 】模拟赛C题目
- 科技论文写作
- Hive学习笔记 --- Hive的数据类型
- 2567. 【NOIP2011模拟9.17】电话时间 (StandardIO)
- 设计模式-适配器模式
- CodeForces 510B Fox And Two Dots(判断环的存在性,DFS一类题)
- GreenDao 3.X之注解
- Arithmetic problem | 二进制表示
- 嵌入式开发28天(线程)
- HTML <pre>标签
- js调用百度地图接口绘制任意多边形并获取每个点的经纬度
- 一点小感悟
- CListCtrl控件的标题栏添加checkbox
- 2016CCPC网络赛赛后总结——回顾与反思