标签：605 Walking sequence move Robot robot cell Mp instructions

链接：

https://codeforces.com/contest/1272/problem/B

题意：

Recently you have bought a snow walking robot and brought it home. Suppose your home is a cell (0,0) on an infinite grid.

You also have the sequence of instructions of this robot. It is written as the string s consisting of characters 'L', 'R', 'U' and 'D'. If the robot is in the cell (x,y) right now, he can move to one of the adjacent cells (depending on the current instruction).

If the current instruction is 'L', then the robot can move to the left to (x−1,y);
if the current instruction is 'R', then the robot can move to the right to (x+1,y);
if the current instruction is 'U', then the robot can move to the top to (x,y+1);
if the current instruction is 'D', then the robot can move to the bottom to (x,y−1).
You've noticed the warning on the last page of the manual: if the robot visits some cell (except (0,0)) twice then it breaks.

So the sequence of instructions is valid if the robot starts in the cell (0,0), performs the given instructions, visits no cell other than (0,0) two or more times and ends the path in the cell (0,0). Also cell (0,0) should be visited at most two times: at the beginning and at the end (if the path is empty then it is visited only once). For example, the following sequences of instructions are considered valid: "UD", "RL", "UUURULLDDDDLDDRRUU", and the following are considered invalid: "U" (the endpoint is not (0,0)) and "UUDD" (the cell (0,1) is visited twice).

The initial sequence of instructions, however, might be not valid. You don't want your robot to break so you decided to reprogram it in the following way: you will remove some (possibly, all or none) instructions from the initial sequence of instructions, then rearrange the remaining instructions as you wish and turn on your robot to move.

Your task is to remove as few instructions from the initial sequence as possible and rearrange the remaining ones so that the sequence is valid. Report the valid sequence of the maximum length you can obtain.

Note that you can choose any order of remaining instructions (you don't need to minimize the number of swaps or any other similar metric).

You have to answer q independent test cases.

思路：

从原点出去，再回来，往右边走的布数等同于往左边走的步数，上下同理。

代码：

#include<bits/stdc++.h>
using namespace std;

char s[100010];

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        cin >> s;
        map<char, int> Mp;
        int len = strlen(s);
        for (int i = 0;i < len;i++)
            Mp[s[i]]++;
        if (Mp['U'] == 0 || Mp['D'] == 0)
        {
            if (Mp['L'] > 0 && Mp['R'] > 0)
                cout << 2 << endl << "LR" << endl;
            else
                puts("0");
        }
        else if (Mp['L'] == 0 || Mp['R'] == 0)
        {
            if (Mp['U'] > 0 && Mp['D'] > 0)
                cout << 2 << endl << "UD" << endl;
            else
                puts("0");
        }
        else
        {
            int row = min(Mp['L'], Mp['R']);
            int col = min(Mp['U'], Mp['D']);
            cout << 2*(row+col) << endl;
            for (int i = 1;i <= row;i++)
                cout << "L";
            for (int i = 1;i <= col;i++)
                cout << "U";
            for (int i = 1;i <= row;i++)
                cout << "R";
            for (int i = 1;i <= col;i++)
                cout << "D";
            cout << endl;
        }
    }

    return 0;
}

标签：605,Walking,sequence,move,Robot,robot,cell,Mp,instructions
来源： https://www.cnblogs.com/YDDDD/p/12046662.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。