Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- どこの階にも止まるので、付いていない方の方向だけ2回かかる。
- */
- #define rep(i, n) for(int i = 0; i < (int)(n); i++)
- typedef long long ll;
- #include <bits/stdc++.h>
- using namespace std;
- int main() {
- ll n;
- string s;
- std::cin >> s;
- n = s.length();
- ll result = 0;
- for (int i = 0; i < n; i++) {
- // 左にi個、右にn-i-1個
- if(s[i] == 'U'){
- result += n-i-1;
- result += 2*(i);
- }else{
- result += 2*(n-i-1);
- result += i;
- }
- }
- std::cout << result << std::endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement