The Worm Turns
来源:互联网 发布:南瑞科技 知乎 编辑:程序博客网 时间:2024/05/17 08:46
Description
We'll simulate a very simplified version here. The game will be played on a 50 x 50 board, numbered so that the square at the upper left is numbered (1, 1). The worm is initially a string of 20 connected squares. Connected squares are adjacent horizontally or vertically. The worm starts stretched out horizontally in positions (25, 11) through (25, 30), with the head of the worm at (25, 30). The worm can move either East (E), West (W), North (N) or South (S), but will never move back on itself. So, in the initial position, a W move is not possible. Thus the only two squares occupied by the worm that change in any move are its head and tail. Note that the head of the worm can move to the square just vacated by the worm's tail.
You will be given a series of moves and will simulate the moves until either the worm runs into itself, the worm runs off the board, or the worm successfully negotiates its list of moves. In the first two cases you should ignore the remaining moves in the list.
Input
There will be multiple problems instances. The input for each problem instance will be on two lines. The first line is an integer n (<100) indicating the number of moves to follow. (A value of n = 0 indicates end of input.) The next line contains n characters (either E, W, N or S), with no spaces separating the letters, indicating the sequence of moves.
Output
Generate one line of output for each problem instance. The output line should be one of the follow three:
The worm ran into itself on move m.
The worm ran off the board on move m.
The worm successfully made all m moves.
Where m is for you to determine and the first move is move 1.
Sample Input
18
NWWWWWWWWWWSESSSWS
20
SSSWWNENNNNNWWWWSSSS
30
EEEEEEEEEEEEEEEEEEEEEEEEEEEEEE
13
SWWWWWWWWWNEE
0
Sample Output
The worm successfully made all 18 moves.
The worm ran into itself on move 9.
The worm ran off the board on move 21.
The worm successfully made all 13 moves.
先贴代码,有时间再写思路
#include<iostream>#include<cstdio>#include<string>#include<cstring>using namespace std;int n,map[51][51],step,body[21][2];int end = 0;int judge(int n,int m){if(m==0){if(n > 0){if(body[(end+19)%20][0]-1<1) return 0;if(map[body[(end+19)%20][0] - 1][body[(end+19)%20][1]]==1) return -1;} else {if(body[(end+19)%20][0]+1>50) return 0;if(map[body[(end+19)%20][0]+1][body[(end+19)%20][1]]==1) return -1;}}else {if(m > 0){if(body[(end+19)%20][1] - 1<1) return 0;if(map[body[(end+19)%20][0]][body[(end+19)%20][1]-1]==1) return -1;}else {if(body[(end+19)%20][1]+1>50) return 0;if(map[body[(end+19)%20][0]][body[(end+19)%20][1]+1]==1) return -1; } }return 1;}int go(string s){for(int i=0;i<20;i++) {body[i][0] = 25;body[i][1] = i+11;//cout<<body[i][0] << " "<<body[i][1]<<endl;}for(int i=0;i<n;i++){if(s[i]=='N') {map[body[end][0]][body[end][1]] = 0;if(judge(1,0)>0){int start = (end+19)%20;map[body[start][0]-1][body[start][1]] = 1;body[end][0] = body[start][0] - 1;body[end][1] = body[start][1];end = (end+1)%20;step++;}else return judge(1,0);}else if(s[i] == 'S'){map[body[end][0]][body[end][1]] = 0;if(judge(-1,0)>0){int start = (end+19)%20;map[body[start][0]+1][body[start][1]] = 1;body[end][0] = body[start][0]+1;body[end][1] = body[start][1];end = (end+1)%20;step++;}else return judge(-1,0);}else if(s[i] == 'W'){map[body[end][0]][body[end][1]] = 0;if(judge(0,1)>0){int start = (end+19)%20;map[body[start][0]][body[start][1] - 1] = 1;body[end][0] = body[start][0];body[end][1] = body[start][1] - 1;end = (end+1)%20;step++;}else return judge(0,1);}else if(s[i] == 'E'){map[body[end][0]][body[end][1]] = 0;if(judge(0,-1)>0){int start = (end+19)%20;map[body[start][0]][body[start][1]+1] = 1;body[end][0] = body[start][0];body[end][1] = body[start][1] + 1;end = (end+1)%20;step++;}else return judge(0,-1);}}return 1;}int main(){string s;while(cin >> n,n){cin >> s; step = 0;end = 0;memset(map,0,sizeof(map));for(int i=11;i<=30;i++)map[25][i] = 1;int ans = go(s);if(ans>0) printf("The worm successfully made all %d moves.\n",n);else if(ans<0) printf("The worm ran into itself on move %d.\n",step+1);else printf("The worm ran off the board on move %d.\n",step+1);}return 0;}
- zoj1056 The Worm Turns
- The Worm Turns
- 1056The Worm Turns
- ZOJ1056 The Worm Turns
- The Worm Turns
- The Worm Turns
- ZOJ1056 The Worm Turns
- THE WORM TURNS
- ZOJ-1056-The Worm Turns
- fjnu 1823 The Worm Turns
- zoj 1056 The Worm Turns
- 【DFS】 hdu2782 The Worm Turns
- hdu 2782 The Worm Turns
- ZOJ Problem Set - 1056 The Worm Turns
- CodeForces Gym 100646G The Worm Turns
- HDU2782 The Worm Turns(DFS水)
- HDU 2782 The Worm Turns (DFS)
- toj1191 The Worm Turns(模拟的经典题目)
- 使用npm uninstall卸载express无效
- activity进出场动画以及动画失效问题
- 编译android源码7---android 源码目录结构
- 遍历注册表得到所有USB驱动
- java项目中发送邮件的整体流程
- The Worm Turns
- Latex数学符号使用大全
- %2d、%2u输出格式含义
- 多项式的加法和乘法算术运算的C++实现
- 逃跑的拉尔夫(将深搜进行到底!!!)
- 独木舟上的旅行
- Leetcode87. Scramble String
- diff: /Podfile.lock: No such file or directory
- C语言结构体占用空间内存大小解析