zoukankan      html  css  js  c++  java
  • Codeforces Round #370 (Div. 2)B. Memory and Trident

    地址:http://codeforces.com/problemset/problem/712/B

    题目:

      

    B. Memory and Trident
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Memory is performing a walk on the two-dimensional plane, starting at the origin. He is given a string s with his directions for motion:

    • An 'L' indicates he should move one unit left.
    • An 'R' indicates he should move one unit right.
    • A 'U' indicates he should move one unit up.
    • A 'D' indicates he should move one unit down.

    But now Memory wants to end at the origin. To do this, he has a special trident. This trident can replace any character in s with any of 'L', 'R', 'U', or 'D'. However, because he doesn't want to wear out the trident, he wants to make the minimum number of edits possible. Please tell Memory what is the minimum number of changes he needs to make to produce a string that, when walked, will end at the origin, or if there is no such string.

    Input

    The first and only line contains the string s (1 ≤ |s| ≤ 100 000) — the instructions Memory is given.

    Output

    If there is a string satisfying the conditions, output a single integer — the minimum number of edits required. In case it's not possible to change the sequence in such a way that it will bring Memory to to the origin, output -1.

    Examples
    input
    RRU
    output
    -1
    input
    UDUR
    output
    1
    input
    RUUR
    output
    2
    Note

    In the first sample test, Memory is told to walk right, then right, then up. It is easy to see that it is impossible to edit these instructions to form a valid walk.

    In the second sample test, Memory is told to walk up, then down, then up, then right. One possible solution is to change s to "LDUR". This string uses 1 edit, which is the minimum possible. It also ends at the origin.

    思路:  x=abs(d[1]-d[3]);y=abs(d[2]-d[4]);

        ans+=min(y,x)+abs(y-x)/2;

    代码:

    #include <bits/stdc++.h>
    
    using namespace std;
    
    #define MP make_pair
    #define PB push_back
    typedef long long LL;
    typedef pair<int, int> PII;
    const double eps = 1e-8;
    const double pi = acos(-1.0);
    const int K = 1e6 + 7;
    
    char ss[K+1];
    int d[5];
    
    int main(void)
    {
        int len,x,y,ans=0;
        cin>>ss+1;
        len=strlen(ss+1);
        if(len&1)
        {
            printf("-1
    ");
            return 0;
        }
        for(int i=1;i<=len;i++)
        if(ss[i]=='U')
            d[1]++;
        else if(ss[i]=='R')
            d[2]++;
        else if(ss[i]=='D')
            d[3]++;
        else if(ss[i]=='L')
            d[4]++;
        x=abs(d[1]-d[3]);
        y=abs(d[2]-d[4]);
        ans+=min(y,x)+abs(y-x)/2;
        cout<<ans<<endl;
        return 0;
    }
  • 相关阅读:
    在eclipse中进行Struts2项目的配置
    通过Java反射来理解泛型的本质
    Java动态加载类在功能模块开发中的作用
    让正常网页呈现黑白色调的方法
    养生-五谷:花生
    汉语-词语:男人
    地理-地点:白浮图镇
    地理-地点:鸡黍镇
    烹饪:杂粮
    烹饪:五谷
  • 原文地址:https://www.cnblogs.com/weeping/p/5868068.html
Copyright © 2011-2022 走看看