dfs-Marcus, help!-uva10452
2014-10-02 13:49
225 查看
简单的dfs,比模板还简单,题意是一个人从@出发,依次通过IEHOVA到达“#”,要求输出他走的方法。规定只能向前“forth”,向左“left”,向右“right”。
#include <iostream> #include <cstdio> using namespace std; int m,n; char str[1000][1000]; int times; char way[10]={'I','E','H','O','V','A','#'}; int dir[4][2]={{-1,0},{0,1},{0,-1}}; void dfs(int x,int y) { for(int i=0;i<3;i++){ int dx=x+dir[i][0]; int dy=y+dir[i][1]; if(dx>=0 &&dx<m &&dy>=0 && dy<n && str[dx][dy]== way[times]){ times++; if(i==0){ printf("forth"); } else if(i==1){ printf("right"); } else if(i==2){ printf("left"); } if(str[dx][dy]=='#'){ printf("\n"); break; } else{ printf(" "); dfs(dx,dy); } } } } int main() { int T; scanf("%d",&T); while(T--){ times=0; int x,y; scanf("%d%d",&m,&n); for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ scanf(" %c",&str[i][j]); if(str[i][j]=='@'){ x=i,y=j; } } } dfs(x,y); } return 0; }
相关文章推荐
- UVA 10452 Marcus, help!( DFS )
- UVa 10452 - Marcus
- uva 10452 Marcus
- uva 10452 Marcus
- UVa 10452 - Marcus
- UVA 10452 Marcus
- UVa, 10452 Marcus
- uva 1267 Network(DFS)
- uva 301 Transportation 铁路公司的阳谋 纯dfs暴力
- UVA-6.4.1-油田-572-DFS
- 【巧妙算法系列】【UVA 11384】 Help is needed for Dexter 正整数序列
- 指南第一章 例题10 UVA 11384 Help is needed for Dexter(递归求解)
- UVa 11853 - Paintball <图论+DFS>
- uva 11384 - Help is needed for Dexter
- UVA 11384 - Help is needed for Dexter
- 【割点 && dfs】UVALive - 7456 Least Crucial Node
- Uva140 Bandwidth 【dfs回溯+剪枝】【例题7-6】
- Uva725 Division【dfs枚举】【例题7-1】
- UVa-657 The die is cast(dfs嵌套)
- UVA11384—Help is needed for Dexter