Codeforces 8B. Obsession with Robots

The whole world got obsessed with robots,and to keep pace with the progress, great Berland’s programmer Draude decided to build his own robot. He was working hard at the robot. He taught it to walk the shortest path from one point to another, to record all its movements, but like in many Draude’s programs, there was a bug — the robot didn’t always walk the shortest path. Fortunately, the robot recorded its own movements correctly. Now Draude wants to find out when his robot functions wrong. Heh, if Draude only remembered the map of the field, where he tested the robot, he would easily say if the robot walked in the right direction or not. But the field map was lost never to be found, that’s why he asks you to find out if there exist at least one map, where the path recorded by the robot is the shortest.

The map is an infinite checkered field, where each square is either empty, or contains an obstruction. It is also known that the robot never tries to run into the obstruction. By the recorded robot’s movements find out if there exist at least one such map, that it is possible to choose for the robot a starting square (the starting square should be empty) such that when the robot moves from this square its movements coincide with the recorded ones (the robot doesn’t run into anything, moving along empty squares only), and the path from the starting square to the end one is the shortest.

In one movement the robot can move into the square (providing there are no obstrutions in this square) that has common sides with the square the robot is currently in.

Input
The first line of the input file contains the recording of the robot’s movements. This recording is a non-empty string, consisting of uppercase Latin letters L, R, U and D, standing for movements left, right, up and down respectively. The length of the string does not exceed 100.

Output
In the first line output the only word OK (if the above described map exists), or BUG (if such a map does not exist).

Examples
inputCopy
LLUUUR
outputCopy
OK
inputCopy
RRUULLDD
outputCopy
BUG

题意：
给出一些走路的方向。要求你构造一个地图，某些点能走，某些点不能走。要求确定起点并按照给定方向能走到终点，且为这个地图对应到终点的最短距离。

思路：
不妨起点(0,0)，那么就得到了能走到的所有点，于是就将能走到的点当做合法位置，其他所有位置当做不可走位置。之后就要算按照这些可行点，起点到终点的最短距离是否为步数长度。

这只要满足每一步的点只到过一次，且只与上一次的点共享了边界。（或者直接将所有走过的点当做合法点跑一遍bfs也可）

#include<cstdio>
#include<math.h>
#include<algorithm>
#include<map>
#include<cstring>
#include<queue>
using namespace std;
char s[105];
int dirx[] = {0,0,0,1,-1};
int diry[] = {0,1,-1,0,0};
map<pair<int,int>,int>mp;
int main() {
    scanf("%s",s + 1);
    int n = strlen(s + 1);
    int x = 0,y = 0;
    mp[{x,y}] = 1;
    for(int i = 1;i <= n;i++) {
        if(s[i] == 'L') {
            x--;
        } else if(s[i] == 'R') {
            x++;
        } else if(s[i] == 'D') {
            y--;
        } else if(s[i] == 'U'){
            y++;
        }
        int flag = 0;
        for(int i = 1;i <= 4;i++) {
            int dx = dirx[i] + x;
            int dy = diry[i] + y;
            if(mp[{dx,dy}]) {
                flag++;
            }
        }
        if(flag >= 2 || mp[{x,y}]) {
            printf("BUG\n");
            return 0;
        }
        mp[{x,y}] = 1;
    }
//    printf("%d %d\n",x,y);

    printf("OK\n");
    return 0;
}