Memory and Trident

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

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */int main(int argc, char *argv[]) {char s[100010];scanf("%s",&s);int i;int count[4];count[0]=0;count[1]=0;count[2]=0;count[3]=0;for(i=0;i<strlen(s);i++){switch(s[i]){case 'U':count[0]++;break;case 'D':count[1]++;break;case 'R':count[2]++;break;case 'L':count[3]++;break;}}if((count[0]+count[1]+count[3]+count[2])%2!=0)printf("-1\n");else{printf("%d\n",(abs(count[0]-count[1])+abs(count[3]-count[2]))/2);   }return 0;
}

Memory and Trident相关推荐

T - Memory and Trident CodeForces - 712B( 注意：* ++ = 的优先级
题意:有四种命令:U代表上移一个单位,D代表下移一个单位,R代表右移一个单位,L代表左移一个单位. 现在给出一串命令,问怎样修改命令中的任意一条命令,使得命令结束后重新返回原点,并且修改的步数最少. ...
Codeforces Round #370 (Div. 2)
A - Memory and Crow 这题我没看题意,看了样例猜了一下就AC了,题目好像还挺复杂的. #include<bits/stdc++.h> using namespace st ...
ECJTUACM16 Winter vacation training #4 题解源码
https://vjudge.net/contest/149692#overview 这周一VJ比赛,题解&源码已完成! A.................................. ...
2016区域赛前冲刺训练
UPD 2016.10.23 shift-and (2题) Codeforces 训练现在已经完成了: 191 [Codeforces Round #377] (6/6) Div 2 A Buy a ...
Storm源码分析之四： Trident源码分析
Storm源码分析之四: Trident源码分析 @(STORM)[storm] Storm源码分析之四 Trident源码分析一概述 0小结 1简介 2关键类 1Spout的创建 2spout的消 ...
java操作storm_Storm Trident
Trident是Storm的延伸.像Storm一样,Trident也是由Twitter开发的.开发Trident的主要原因是在Storm之上提供高级抽象以及有状态流处理和低延迟分布式查询. Tride ...
Cache Memory技术示例
Cache Memory技术示例为什么需要cache?如何判断一个数据在cache中是否命中?cache的种类有哪些,区别是什么? 为什么需要cache memory 先思考第一个问题:程序是如何运 ...
TensorFlow XLA优化与Memory
TensorFlow XLA优化与Memory XLA概述 XLA(加速线性代数)是用于优化TensorFlow计算的线性代数的域特定编译器.结果是在服务器与移动平台上的速度,内存使用率与可移植性得到 ...
Cache 与Memory架构及数据交互
Cache 与Memory架构及数据交互

Memory and Trident

Memory and Trident相关推荐

最新文章

热门文章