Submission #2234640

---

Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unordered_map>
#include<unordered_set>
#include<deque>
#include<cstdio>
using namespace std;
typedef long long int ll;
const int N = 1000000;
const int INF = 1 << 30;
#define rep(i,n) for(int i=(ll)0;i<(ll)n;++i)
#define ALL(x) x.begin(),x.end()
#define pp pair<ll,ll>
string YN(bool b) { return(b ? "YES" : "NO"); }
string yn(bool b) { return(b ? "Yes" : "No"); }
int main(){
	string s;
	cin >> s;
	ll ans = 0;
	int v[100000];
	rep(i, s.size()) {
		ans += s.size() - 1-i;
		if (s[i]=='D')ans += s.size() - 1 - i;
		ans += i;
		if (s[i] == 'U')ans += i;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result