zoukankan      html  css  js  c++  java
  • cf 8B

    B. Obsession with Robots
    time limit per test
    2 seconds
    memory limit per test
    64 megabytes
    input
    standard input
    output
    standard output

    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).

    Sample test(s)
    input
    LLUUUR
    output
    OK
    input
    RRUULLDD
    output
    BUG
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<cstdlib>
    #include<algorithm>
    using namespace std;
    string s;
    int a[410][410];
    int main()
    {
          cin>>s;
          int x=200,y=200;
          for(int i=0;i<s.length();i++)
          {
                a[x][y]=1;
                if(s[i]=='U') x--;
                if(s[i]=='L') y--;
                if(s[i]=='D') x++;
                if(s[i]=='R') y++;
                if(a[x-1][y]+a[x][y-1]+a[x+1][y]+a[x][y]+a[x][y+1]>1)
                {
                      printf("BUG
    ");
                      return 0;
                }
          }
          printf("OK
    ");
          return 0;
    }
    

      

  • 相关阅读:
    项目知识
    设计师如何为 Android 应用标注尺寸
    Android开发注意事项
    线程的同步和异步
    复习:IPC机制
    简单的Mvp设计
    泛型
    RxBus的使用
    LinearLayout遇到的问题——利用LinearLayout做横向滑动冲突
    Google搜索技巧、使用Google的其它专业搜索
  • 原文地址:https://www.cnblogs.com/a972290869/p/4222558.html
Copyright © 2011-2022 走看看