Submission #2248907

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;

template<class T> void vin(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
}

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

Submission Info

Judge Result