Submission #31065914

Source Code Expand

n = int(input())
s = input()
t = [0] * (n + 1)
for i in range(n):
    t[i + 1] = t[i]
    if s[i] == "E":
        t[i + 1] += 1
answer = n
for i in range(n):
    answer = min(answer, (i - t[i]) + (t[n] - t[i + 1]))
    # リーダーを i として
    # リーダーより西にいて東向きに変わらなければならないのは (i - t[i]) 人
    # リーダーより東にいて西向きに変わらなければならないのは (t[n] - t[i + 1]) 人
print(answer)

Submission Info

Submission Time
Task C - Attention
User Pro_ktmr
Language PyPy3 (7.3.0)
Score 300
Code Size 488 Byte
Status AC
Exec Time 76 ms
Memory 80620 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 26
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt
Case Name Status Exec Time Memory
sample_01.txt AC 62 ms 61892 KiB
sample_02.txt AC 49 ms 61944 KiB
sample_03.txt AC 51 ms 61628 KiB
subtask_1_01.txt AC 66 ms 73676 KiB
subtask_1_02.txt AC 55 ms 66024 KiB
subtask_1_03.txt AC 66 ms 76168 KiB
subtask_1_04.txt AC 66 ms 75504 KiB
subtask_1_05.txt AC 56 ms 67836 KiB
subtask_1_06.txt AC 65 ms 73284 KiB
subtask_1_07.txt AC 71 ms 80200 KiB
subtask_1_08.txt AC 73 ms 79480 KiB
subtask_1_09.txt AC 66 ms 71412 KiB
subtask_1_10.txt AC 70 ms 74420 KiB
subtask_1_11.txt AC 67 ms 74892 KiB
subtask_1_12.txt AC 69 ms 74940 KiB
subtask_1_13.txt AC 64 ms 73432 KiB
subtask_1_14.txt AC 66 ms 74600 KiB
subtask_1_15.txt AC 76 ms 80620 KiB
subtask_1_16.txt AC 62 ms 73784 KiB
subtask_1_17.txt AC 66 ms 74036 KiB
subtask_1_18.txt AC 63 ms 74032 KiB
subtask_1_19.txt AC 71 ms 80024 KiB
subtask_1_20.txt AC 74 ms 80004 KiB