Submission #1766267

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
using namespace std;

typedef long long ll;

string s;
ll ans;

int main() {
	cin >> s;
	for (int i = 0; i < s.length(); ++i) {
		if (s[i] == 'U') ans += i * 2 + (s.length() - i - 1);
		else ans += i + (s.length() - i - 1) * 2;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result