Submission #2234740

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <utility>
#include <functional>
#include <deque>
#include <cctype>
#include <stack>
#include <bitset>

using ll = long long;
typedef unsigned long long ull;
typedef std::pair<ll, ll>P;

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}
ll lcm(ll a, ll b) {
	ll g = gcd(a, b);
	return a / g * b;
}

const ll mod = 1000000007;
const ll INF = 1 << 30;
const ll INF2 = 9000000000000000000LL;
bool fl = true;
int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };
std::string abc = "abcdefghijklmnopqrstuvwxyz";
struct edge { ll to, cost; };
struct edge1 { ll from, to, cost; };
double pai = 3.141592653589793;
std::vector<P>v[100010];

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

Submission Info

Judge Result