Codeforces Round #335 (Div. 2) 606B Testing Robots(模拟)
2 seconds
256 megabytes
standard input
standard output
The Cybernetics Failures (CF) organisation made a prototype of a bomb technician robot. To find the possible problems it was decided to carry out a series of tests. At the beginning of each test the robot prototype will be placed in cell (x0, y0) of
a rectangular squared field of size x × y, after that a mine will be installed into one of the squares of the field. It is
supposed to conduct exactly x·y tests, each time a mine is installed into a square that has never been used before. The starting
cell of the robot always remains the same.
After placing the objects on the field the robot will have to run a sequence of commands given by string s, consisting only of characters
'L', 'R', 'U',
'D'. These commands tell the robot to move one square to the left, to the right, up or down, or stay idle if moving in the given direction is impossible. As
soon as the robot fulfills all the sequence of commands, it will blow up due to a bug in the code. But if at some moment of time the robot is at the same square with the mine, it will also blow up, but not due to a bug in the code.
Moving to the left decreases coordinate y, and moving to the right increases it. Similarly, moving up decreases the x coordinate,
and moving down increases it.
The tests can go on for very long, so your task is to predict their results. For each k from 0 to length(s) your
task is to find in how many tests the robot will run exactly k commands before it blows up.
The first line of the input contains four integers x, y, x0, y0 (1 ≤ x, y ≤ 500, 1 ≤ x0 ≤ x, 1 ≤ y0 ≤ y) —
the sizes of the field and the starting coordinates of the robot. The coordinate axis X is directed downwards and axis Y is
directed to the right.
The second line contains a sequence of commands s, which should be fulfilled by the robot. It has length from 1 to 100 000 characters
and only consists of characters 'L', 'R', 'U',
'D'.
Print the sequence consisting of (length(s) + 1) numbers. On the k-th
position, starting with zero, print the number of tests where the robot will run exactly k commands before it blows up.
3 4 2 2
UURDRDRL
1 1 0 1 1 1 1 0 6
2 2 2 2
ULD
1 1 1 1
In the first sample, if we exclude the probable impact of the mines, the robot's route will look like that: .
题目链接:点击打开链接
给出地图长宽以及起点, 紧接着给出移动指示, 输出每一步的命令数.
越界或者已经訪问过输出0, 最后一步输出没有訪问过的个数, 其它情况输出1.
AC代码:
#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "queue"
#include "stack"
#include "cmath"
#include "utility"
#include "map"
#include "set"
#include "vector"
#include "list"
#include "string"
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 5;
int x, y, x3, y3, x2, y2;
bool vis[505][505];
char s[MAXN];
int main(int argc, char const *argv[])
{
scanf("%d%d%d%d", &x, &y, &x3, &y3);
scanf("%s", s);
int len = strlen(s);
x2 = x3, y2 = y3;
printf("1 ");
vis[x2][y2] = true;
for(int i = 0; i < len - 1; ++i) {
int ans;
if(s[i] == 'U') {
if(x2 - 1 < 1) ans = 0;
else if(vis[x2 - 1][y2]) {
ans = 0;
--x2;
}
else {
ans = 1;
vis[--x2][y2] = true;
}
}
else if(s[i] == 'D') {
if(x2 + 1 > x ) ans = 0;
else if(vis[x2 + 1][y2]) {
ans = 0;
++x2;
}
else {
ans = 1;
vis[++x2][y2] = true;
}
}
else if(s[i] == 'L') {
if(y2 - 1 < 1 ) ans = 0;
else if(vis[x2][y2 - 1]) {
ans = 0;
--y2;
}
else {
ans = 1;
vis[x2][--y2] = true;
}
}
else if(s[i] == 'R') {
if(y2 + 1 > y) ans = 0;
else if(vis[x2][y2 + 1]) {
ans = 0;
++y2;
}
else {
ans = 1;
vis[x2][++y2] = true;
}
}
printf("%d ", ans);
}
int num = 0;
for(int i = 1; i <= x; ++i)
for(int j = 1; j <= y; ++j)
if(!vis[i][j]) num++;
printf("%d\n", num);
return 0;
}
Codeforces Round #335 (Div. 2) 606B Testing Robots(模拟)的更多相关文章
- Codeforces Round #335 (Div. 2) B. Testing Robots 水题
B. Testing Robots Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://www.codeforces.com/contest/606 ...
- Codeforces Round #335 (Div. 2)B. Testing Robots解题报告
B. Testin ...
- Codeforces Round #335 (Div. 2) A. Magic Spheres 模拟
A. Magic Spheres Carl is a beginner magician. He has a blue, b violet and c orange magic spheres. ...
- Codeforces Round #368 (Div. 2) B. Bakery (模拟)
Bakery 题目链接: http://codeforces.com/contest/707/problem/B Description Masha wants to open her own bak ...
- Codeforces Round #335 (Div. 2)
水 A - Magic Spheres 这题也卡了很久很久,关键是“至少”,所以只要判断多出来的是否比需要的多就行了. #include <bits/stdc++.h> using nam ...
- Codeforces Round #335 (Div. 2) B
B. Testing Robots time limit per test 2 seconds memory limit per test 256 megabytes input standard i ...
- Codeforces Round #284 (Div. 2)A B C 模拟 数学
A. Watching a movie time limit per test 1 second memory limit per test 256 megabytes input standard ...
- Codeforces Round #285 (Div. 2) A B C 模拟 stl 拓扑排序
A. Contest time limit per test 1 second memory limit per test 256 megabytes input standard input out ...
- Codeforces Round #335 (Div. 1) C. Freelancer's Dreams 计算几何
C. Freelancer's Dreams Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://www.codeforces.com/contes ...
随机推荐
- 10,*args **kwargs 函数的命名空间。
用户传入到函数中的实参数量不定时,或者是为了以后拓展, 此时要用到动态参数*args,**kwargs(万能参数.) *args(接受的是所有的位置参数) 以元组的形式返回给函数调用者. **kwar ...
- Python 多级目录选择+一键正反排序
效果如图所示,可以根据条件来选择对象 cat pc.py #!/usr/bin/pythonfrom flask import Flask,render_template,request,redire ...
- WordPress登录框显示/隐藏输入的密码
直接让用户自行根据需要选择是全部隐藏输入的密码,还是全部显示输入的密码. 在全部显示密码框的内容时,用户输错的可能性就大大降低,这也是微软推荐的一种密码框处理方式.效果如下: 今天,我将给大家介绍,在 ...
- POJ 2157 Maze
Maze Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 3183 Accepted: 996 Description A ...
- jQuery中文文档
http://www.jquery123.com/ http://www.shifone.cc/
- 刷题总结——子串(NOIP2015提高组)
题目: 题目背景 NOIP2015 提高组 Day2 T2 题目描述 有两个仅包含小写英文字母的字符串 A 和 B .现在要从字符串 A 中取出 k 个互不重叠的非空子串,然后把这 k 个子串按照其在 ...
- Linux命令——top
top命令可以实时动态地查看系统的整体运行情况,是一个综合了多方信息监测系统性能和运行信息的实用工具.通过top命令所提供的互动式界面,用热键可以管理. 语法 top(选项) 选项 -b:以批处理模式 ...
- 淘金(bzoj 3131)
Description 小Z在玩一个叫做<淘金者>的游戏.游戏的世界是一个二维坐标.X轴.Y轴坐标范围均为1..N.初始的时候,所有的整数坐标点上均有一块金子,共N*N块. 一阵风吹 ...
- MysqL5.7在使用mysqldump命令备份数据库报错:mysqldump: [Warning] Using a password on the command line interface can be insecure.
在阿里云服务器增加一个shell脚本定时备份数据库脚本执行任务时,测试性的执行了备份命令,如下 [root@iZ2ze503xw2q1fftv5rhboZ mysql_bak]# /usr/local ...
- Resin Thread Dump
[2015/08/25 20:50:13.254] {ThreadLauncher2[ThreadPool[system]]-1} Thread Dump generated Tue Aug 25 2 ...