Submission #1569530

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define MP(a,b) make_pair(a,b)
typedef long long LL;
typedef pair<int, int> PI;
typedef vector<int> VI;
const LL MOD = 1000000007LL;

int main() {
	string S;
	cin >> S;
	LL ans = 0;
	REP(i,1,S.size()+1) {
		if (S[i-1] == 'U') {
			ans += (LL)(S.size() - i) + (i - 1) * 2;
		}
		else {
			ans += (LL)(S.size() - i) * 2 + (i - 1);
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result