Submission #11248718

---

Source Code Expand

#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
const int mod= 1e+9+7;

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

Submission Info

Judge Result