Submission #3749781

---

Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstring>
using namespace std ;
typedef long long ll ;
# define rep (i , n ) for ( int i =0; i < n ; i++)
# define _sort(arg) sort(begin(arg), end(arg))

int main()
{
	cin.tie(NULL);
	ios::sync_with_stdio(false);

	string S;
	cin >> S;
	
	int layer = S.size();
	ll total = 2 * (layer-1);

	for (int i = 1; i < layer - 1; i++)
	{
		if (S[i] == 'U')
		{
			total += layer - (i+1);

			total += i*2;
			
		}
		else if (S[i] == 'D')
		{
			total += i;
			
			total += 2 * (layer - i - 1);
			
		}

	}

	cout << total << endl;

	return 0;
}

Submission Info

Judge Result