[DFS] Codeforces 510B:Fox And Two Dot
来源:互联网 发布:sql 获取exec 返回值 编辑:程序博客网 时间:2024/06/06 08:28
地址: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,成环,最终又得回到起点,但是有一种不行(从第一个字母@搜到第二个字母@,而第二个字母@又搜到了第一个字母@,不成环,不符合题意)。那么这里我们多加两个参数,来记载当前节点的父节点(上一个字母),当你扫下一个方向时,扫到父节点,那么就跳过,扫下一个方向,如果你找到了你曾经走过的点,那么一定成环了。不回头查找
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; char a[55][55]; int vis[55][55]; int fx[4]={0,0,1,-1}; int fy[4]={1,-1,0,0}; int n,m,ans; void dfs(int x,int y,int prex,int prey )//fx,fy为父节点 即上一个查找点 { if(vis[x][y]) { ans=1; return ; } vis[x][y]=1; //每经过一个点 均标记为 1 直到下一个点为 1 即回路 int nx,ny; for(int i=0;i<4;i++) { nx=x+fx[i]; ny=y+fy[i]; if(nx==prex&&ny==prey)//遇到上一个点 因为不能回头 所以继续左右查找 continue; if(a[nx][ny]==a[x][y])//找到此点 以此点为初始点 继续查找 dfs(nx,ny,x,y); } } int main() { while(~scanf("%d %d",&n,&m)) { ans=0; memset(vis,0,sizeof(vis)); for(int i=0;i<n;i++) scanf("%s",a[i]); for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { if(!vis[i][j])//遍历没走过的点 dfs(i,j,i,j); if(ans) //找到环 跳出 break; } if(ans) //接着跳出 break; } //printf("%s\n",ans?"Yes":"No");//大佬的高级用法 if(ans) printf("Yes\n"); else printf("No\n"); } }
- [DFS] Codeforces 510B:Fox And Two Dot
- codeforces B. 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)
- 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)
- 【CodeForces 510B】 Fox And Two Dots (dfs+bfs)
- 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#290 B&&510 B Fox And Two Dots(简单dfs)
- codeforces#290 B&&510 B Fox And Two Dots (简单dfs)
- codeforces#290 B&&510 B Fox And Two Dots(简单dfs)
- 一行代码搞定n!末尾所含0的个数
- Java进阶(五十四)初识JAVA类加载机制
- MAC -安装了Homebrew实现搭建本地Nginx+RTMP 推流
- 【Java并发编程】并发集合
- 1092. To Buy or Not to Buy (20)
- [DFS] Codeforces 510B:Fox And Two Dot
- 寻找最大数(三)
- 自定义可折叠按钮
- Oil Deposits
- CF 833B The Bakery(dp+线段树)
- 【Python】【Caffe】一、生成prototxt文件《python调用caffe模块》
- 弱/水!!题
- 51nod 1057 N的阶乘
- navicat报错