Submission #11248885

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define MAX 100000
void inarray(int a[], int n){
    for(int i = 0; i < n; i++) cin >> a[i];
}

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

Submission Info

Judge Result