CodeForces - 322C Ciel and Robot

CodeForces - 322C Ciel and Robot

当时做的时候整麻烦了，讨论等不等于0讨论了一大堆，然后一看题解发现我忽视了叉乘这玩意，这玩意是可以无视被除数等不等为0来着。

Fox Ciel has a robot on a 2D plane. Initially it is located in (0, 0). Fox Ciel code a command to it. The command was represented by string s. Each character of s is one move operation. There are four move operations at all:

‘U’: go up, (x, y)  →  (x, y+1);
‘D’: go down, (x, y)  →  (x, y-1);
‘L’: go left, (x, y)  →  (x-1, y);
‘R’: go right, (x, y)  →  (x+1, y).
The robot will do the operations in s from left to right, and repeat it infinite times. Help Fox Ciel to determine if after some steps the robot will located in (a, b).

Input
The first line contains two integers a and b, ( - 109 ≤ a, b ≤ 109). The second line contains a string s (1 ≤ |s| ≤ 100, s only contains characters ‘U’, ‘D’, ‘L’, ‘R’) — the command.

Output
Print “Yes” if the robot will be located at (a, b), and “No” otherwise.

Examples
Input
2 2
RU
Output
Yes
Input
1 2
RU
Output
No
Input
-1 1000000000
LRRLU
Output
Yes
Input
0 0
D
Output
Yes
Note
In the first and second test case, command string is “RU”, so the robot will go right, then go up, then right, and then up and so on.

The locations of its moves are (0, 0)  →  (1, 0)  →  (1, 1)  →  (2, 1)  →  (2, 2)  →  …

So it can reach (2, 2) but not (1, 2).

#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstring>
#include <cctype>
#include <stack>
#include <queue>
#define N 1500
#define mod 1000000007
#define exp 1e-5
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
int main(){
	ll A,B,n,xx,yy,i,j,x,y;
	int flag,tx,ty;
	char str[N];
	while(scanf("%lld%lld",&A,&B)!=EOF){
		getchar();
		scanf("%s",str);
		n=strlen(str);
		xx=yy=0;
		flag=tx=ty=0;
		for(i=0;i<100000;i++){
			for(j=0;j<n;j++){
				if(tx==A&&ty==B){
					flag=1;
				}
				if(str[j]=='U')
					ty++;
				if(str[j]=='D')
					ty--;
				if(str[j]=='L')
					tx--;
				if(str[j]=='R')
					tx++;
				if(tx==A&&ty==B){
					flag=1;
				}
			}
		}
		for(i=0;i<n;i++){
			if(xx==A&&yy==B){
				flag=1;
			}
			if(str[i]=='U')
				yy++;
			if(str[i]=='D')
				yy--;
			if(str[i]=='L')
				xx--;
			if(str[i]=='R')
				xx++;
			if(xx==A&&yy==B){
				flag=1;
			}
		}
		if(flag==1){
			printf("Yes\n");
			continue;
		}
		if(xx==yy&&xx==0){
			printf("No\n");
			continue;
		}
		x=y=0;
		for(i=0;i<n;i++){
			if((A-x)*yy==(B-y)*xx){
				if(xx!=0&&(A-x)%xx==0){
					flag=1;
				}
				if(yy!=0&&(B-y)%yy==0){
					flag=1;
				}
			}
			if(str[i]=='U')
				y++;
			if(str[i]=='D')
				y--;
			if(str[i]=='L')
				x--;
			if(str[i]=='R')
				x++;
			if((A-x)*yy==(B-y)*xx){
				if(xx!=0&&(A-x)%xx==0){
					flag=1;
				}
				if(yy!=0&&(B-y)%yy==0){
					flag=1;
				}
			}
		}
		if(flag==1){
			printf("Yes\n");
		}
		else{
			printf("No\n");
		}
	}
	return 0;
}