Submission #1310289

---

Source Code Expand

/*
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2331961#2
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2331969#2
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2331970#2
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2332101#2
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2333449#2
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2335101#2
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2335527#2
*/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <algorithm>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
#define rep(i,n)	for(int i=0;i<n;i++)
#define srep(i,a,n)	for(int i=a;i<n;i++)
#define REP(i,n)	for(int i=0;i<=n;i++)
#define SREP(i,a,n)	for(int i=a;i<=n;i++)
#define rrep(i,n)	for(int i=n-1;i>=0;i--)
#define all(a)	(a).begin(),(a).end()
#define mp(a,b)	make_pair(a,b)
#define mt	make_tuple
#define fst	first
#define scn second

const ll inf = (ll)1e18;
const ll mod = (ll)1e9 + 7;
const ld eps = 1e-9;

int main() {
	string s;	cin >> s;
	int n = s.size();
	int ret = 0;
	rep(i, n - 1)	ret += (s[i] == 'U' ? 1 : 2)*(n - i - 1);
	for (int i = n - 1; i > 0; i--)	ret += (s[i] == 'D' ? 1 : 2)*i;
	cout << ret << endl;
	return 0;
}

Submission Info

Judge Result