Submission #1605357


Source Code Expand

s = list(input())
n = len(s)

# 1階から各階、n階から各階に移動するときの合計回数
# それぞれ1回で移動できる
ans = 2 * (n - 1)
for i in range(1, n - 1):
    if s[i] == 'U':
        #上
        ans += n - i - 1
        #下
        ans += 2 * i
    else:
        #上
        ans += 2 * (n - i - 1)
        #下
        ans += i

print(ans)

Submission Info

Submission Time
Task B - Evilator
User ophelia
Language Python (3.4.3)
Score 400
Code Size 392 Byte
Status AC
Exec Time 63 ms
Memory 3956 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 12
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 57 ms 3956 KB
02.txt AC 57 ms 3956 KB
03.txt AC 60 ms 3956 KB
04.txt AC 63 ms 3956 KB
05.txt AC 56 ms 3956 KB
06.txt AC 55 ms 3956 KB
07.txt AC 55 ms 3956 KB
08.txt AC 55 ms 3956 KB
09.txt AC 17 ms 2940 KB
10.txt AC 17 ms 2940 KB
s1.txt AC 17 ms 2940 KB
s2.txt AC 17 ms 2940 KB