poj1573模拟
Robot Motion
Time Limit: 1000 MS Memory Limit: 10000 KB
64-bit integer IO format: %I64d , %I64u Java class name: Main
Description
A robot has been programmed to follow the instructions in its path.
Instructions for the next direction the robot is to move are laid down
in a grid. The possible instructions are
N north (up the page)
S south (down the page)
E east (to the right on the page)
W west (to the left on the page)
For example, suppose the robot starts on the north (top) side of
Grid 1 and starts south (down). The path the robot follows is shown. The
robot goes through 10 instructions in the grid before leaving the grid.
Compare what happens in Grid 2: the robot goes through 3
instructions only once, and then starts a loop through 8 instructions,
and never exits.
You are to write a program that determines how long it takes a robot to get out of the grid or how the robot loops around.
Input
navigate. The data for each is in the following form. On the first line
are three integers separated by blanks: the number of rows in the grid,
the number of columns in the grid, and the number of the column in which
the robot enters from the north. The possible entry columns are
numbered starting with one at the left. Then come the rows of the
direction instructions. Each grid will have at least one and at most 10
rows and columns of instructions. The lines of instructions contain only
the characters N, S, E, or W with no blanks. The end of input is
indicated by a row containing 0 0 0.
Output
output. Either the robot follows a certain number of instructions and
exits the grid on any one the four sides or else the robot follows the
instructions on a certain number of locations once, and then the
instructions on some number of locations repeatedly. The sample input
below corresponds to the two grids above and illustrates the two forms
of output. The word "step" is always immediately followed by "(s)"
whether or not the number before it is 1.
Sample Input
3 6 5
NEESWE
WWWESS
SNWWWW
4 5 1
SESWE
EESNW
NWEEN
EWSEN
0 0 0
Sample Output
10 step(s) to exit
3 step(s) before a loop of 8 step(s)
#include<iostream>
#include <string.h> using namespace std; int main(void)
{
int row,col,entry;
char grid[][]; //在规定大小的grid外部至少再定义一圈"门槛"以判断Robot是否离开了grid (最大grid为10x10) for(;;)
{
memset(grid,'O',sizeof(grid)); // 'O' 为大写字母O,意为 Out /*Input*/ int i,j; cin>>row>>col>>entry;
if(!(row && col && entry))break; for(i=;i<=row;i++)
for(j=;j<=col;j++)
cin>>grid[i][j]; /*Judge Robot get out of the grid or starts a loop in the grid*/ int flag[][]={}; //标记Robot经过某点的次数,当有一点为2则说明Robot陷入了以该点为loop起始点的循环
int count;
int r=;
int c=entry;
for(count=;;count++)
{
flag[r][c]++; //注意顺序,先标记,再位移
if(grid[r][c]=='N') // ↑
r--;
else if(grid[r][c]=='S') // ↓
r++;
else if(grid[r][c]=='W') // ←
c--;
else if(grid[r][c]=='E') // →
c++;
else if(grid[r][c]=='O') // Out
{
cout<<count<<" step(s) to exit"<<endl;
break;
} if(flag[r][c]==) //loop
{
row=r; //标记Robot循环起止点
col=c;
int flg=;
for(r=,c=entry,count=;;count++)
{
if(r==row && c==col && flg==) //注意顺序,先寻找循环点再位移(避免Robot刚进入grid就陷入了循环的情况)
{
cout<<count<<" step(s) before a loop of "; //输出进入循环前的步数
count=;
flg++;
}
if(r==row && c==col && count!= && flg==)
{
cout<<count<<" step(s)"<<endl; //输出循环步数
break;
}
if(grid[r][c]=='N') // ↑
r--;
else if(grid[r][c]=='S') // ↓
r++;
else if(grid[r][c]=='W') // ←
c--;
else if(grid[r][c]=='E') // →
c++;
}
break; //跳出count的for循环,不是跳出if(当然break也不能用于跳出if,这里的说明是为了避免误解)
}
}
}
return ;
}
题意:按照表格的提示走~~~
模拟模拟 太恶心啦
http://blog.csdn.net/lyy289065406/article/details/6645434
他的博客真心棒!!!!!
poj1573模拟的更多相关文章
- poj1573 模拟
Robot Motion Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11270 Accepted: 5487 Des ...
- POJ1573(Robot Motion)--简单模拟+简单dfs
题目在这里 题意 : 问你按照图中所给的提示走,多少步能走出来??? 其实只要根据这个提示走下去就行了.模拟每一步就OK,因为下一步的操作和上一步一样,所以简单dfs.如果出现loop状态,只要记忆每 ...
- poj1573&&hdu1035 Robot Motion(模拟)
转载请注明出处:http://blog.csdn.net/u012860063? viewmode=contents 题目链接: HDU:pid=1035">http://acm.hd ...
- POJ-1573 Robot Motion模拟
题目链接: https://vjudge.net/problem/POJ-1573 题目大意: 有一个N*M的区域,机器人从第一行的第几列进入,该区域全部由'N' , 'S' , 'W' , 'E' ...
- POJ1573 Robot Motion(模拟)
题目链接. 分析: 很简单的一道题, #include <iostream> #include <cstring> #include <cstdio> #inclu ...
- App开发:模拟服务器数据接口 - MockApi
为了方便app开发过程中,不受服务器接口的限制,便于客户端功能的快速测试,可以在客户端实现一个模拟服务器数据接口的MockApi模块.本篇文章就尝试为使用gradle的android项目设计实现Moc ...
- 故障重现, JAVA进程内存不够时突然挂掉模拟
背景,服务器上的一个JAVA服务进程突然挂掉,查看产生了崩溃日志,如下: # Set larger code cache with -XX:ReservedCodeCacheSize= # This ...
- Python 爬虫模拟登陆知乎
在之前写过一篇使用python爬虫爬取电影天堂资源的博客,重点是如何解析页面和提高爬虫的效率.由于电影天堂上的资源获取权限是所有人都一样的,所以不需要进行登录验证操作,写完那篇文章后又花了些时间研究了 ...
- HTML 事件(四) 模拟事件操作
本篇主要介绍HTML DOM中事件的模拟操作. 其他事件文章 1. HTML 事件(一) 事件的介绍 2. HTML 事件(二) 事件的注册与注销 3. HTML 事件(三) 事件流与事件委托 4. ...
随机推荐
- BZOJ4033或洛谷3177 [HAOI2015]树上染色
BZOJ原题链接 洛谷原题链接 很明显的树形\(DP\). 因为记录每个点的贡献很难,所以我们可以统计每条边的贡献. 对于每一条边,设边一侧的黑点有\(B_x\)个,白点有\(W_x\),另一侧黑点有 ...
- UISwitch开关控件属性介绍以及获取开关状态并做出响应
(1)UISwitch的大小也是固定的,不随我们frame设置的大小改变:也是裁剪成圆角的,设置背景就露马脚发现背景是矩形. (2)UISwitch的背景图片设置无效,即我们只能设置颜色,不能用图片当 ...
- vim删除单词
参考资料: https://blog.csdn.net/grey_csdn/article/details/72355735 混迹于Windows.Linux以及Mac,选择加强自己的VIM水平应该不 ...
- RabbitVCS - Ubuntu VCS Graphical Client
Easy version control for Linux RabbitVCS is a set of graphical tools written to provide simple and s ...
- Struct配置
这里只是写到配置方法: 第一步:LoginAction: package com.inspur.actions; import javax.servlet.http.HttpServletReques ...
- mybatis学习五 log4j
1. log4j(log for java)由 apache 推出的开源免费日志处理的类库.2. 为什么需要日志: 2.1 在项目中编写 System.out.println();输出到控制台,当项 ...
- 20155312 2016-2017-2 《Java程序设计》第八周学习总结
20155312 2016-2017-2 <Java程序设计>第八周学习总结 课堂内容总结 学习模式 游乐园模式-荒野求生模式 学习方法 以代码为中心->遇到不会的类和方法(参数等) ...
- spoj 7258 SUBLEX(求第k大字串
其实对sam的拓扑排序我似懂非懂但是会用一点了. /** @xigua */ #include <stdio.h> #include <cmath> #include < ...
- JPA错误
2016-11-141.2016-10-31: hibernate用注解 一对多 报Could not determine type for错误 原因: 接下来继续解决第二个问题:怎么又与集合打交道 ...
- Codeforces Round #543 (Div. 2) D 双指针 + 模拟
https://codeforces.com/contest/1121/problem/D 题意 给你一个m(<=5e5)个数的序列,选择删除某些数,使得剩下的数按每组k个数以此分成n组(n*k ...