Codeforces Round #335 (Div. 2) B. Testing Robots (模拟)

最新推荐文章于 2016-11-05 02:25:03 发布

AnICoo1

最新推荐文章于 2016-11-05 02:25:03 发布

阅读量471

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/helloiamclh/article/details/50429288

版权

水题专栏收录该内容

104 篇文章 0 订阅

订阅专栏

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 (x₀, y₀) 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.

Input

The first line of the input contains four integers x, y, x₀, y₀ (1 ≤ x, y ≤ 500, 1 ≤ x₀ ≤ x, 1 ≤ y₀ ≤ 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'.

Output

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.

Sample test(s)

input

3 4 2 2
UURDRDRL

output

1 1 0 1 1 1 1 0 6

input

2 2 2 2
ULD

output

1 1 1 1

Note

In the first sample, if we exclude the probable impact of the mines, the robot's route will look like that: $\text{[math]}$ .

题意：n*m的地图，给定起点，然后给你行走的方向，然后让你输出路径，和最后没有走过的地方，如果之前走过了输出0，没有走过输出1，最后一步不算

思路：暴力模拟一下就行了

总结：这道题刚开始没看懂，写了一下样例都对不上，然后一个单词一个单词翻译，总算看懂了，英语是硬伤。。。

ac代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 200010
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
using namespace std;
int v[510][510];
char s[MAXN];
int fab(int x)
{
	return x>0?x:-x;
}
int main()
{
	int n,m,i,x,y;
	while(scanf("%d%d%d%d",&n,&m,&x,&y)!=EOF)
	{
		scanf("%s",s);
		mem(v);
		int len=strlen(s);
		int k=1;
		int cnt=1;
		v[x][y]=1;
		printf("1 ");
		for(i=0;i<len-1;i++)
		{
			int a=x,b=y;
			if(s[i]=='U')
			{
				x--;
				if(x<1)
				x++;
			}
			else if(s[i]=='D')
			{
				x++;
				if(x>n)
				x--;
			}
			else if(s[i]=='R')
			{
				y++;
				if(y>m)
				y--;
			}
			else
			{
				y--;
				if(y<1)
				y++;
			}
			if(!v[x][y])
			{
				v[x][y]=1;
				printf("1 ");
				cnt++;
			}
			else
			printf("0 ");
		}
		printf("%d\n",n*m-cnt);
	}
	return 0;
}