Submission #2572082

Source Code Expand

N = int(raw_input())
S = raw_input()
l = [0] * N
r = [0] * N
w = 0
e = 0
for i in range(N-1):
  w += (1 if S[i]=="W" else 0)
  l[i+1] = w
  e += (1 if S[N-1-i]=="E" else 0)
  r[N-1-i-1] = e
ret = N
for i in range(N):
  ret = min(ret, l[i]+r[i])
print ret

Submission Info

Submission Time
Task C - Attention
User mcq
Language Python (2.7.6)
Score 300
Code Size 268 Byte
Status AC
Exec Time 260 ms
Memory 31576 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 10 ms 2568 KiB
sample_02.txt AC 10 ms 2568 KiB
sample_03.txt AC 10 ms 2568 KiB
subtask_1_01.txt AC 226 ms 27784 KiB
subtask_1_02.txt AC 49 ms 6276 KiB
subtask_1_03.txt AC 169 ms 21632 KiB
subtask_1_04.txt AC 158 ms 16384 KiB
subtask_1_05.txt AC 86 ms 9732 KiB
subtask_1_06.txt AC 245 ms 24192 KiB
subtask_1_07.txt AC 256 ms 31232 KiB
subtask_1_08.txt AC 233 ms 22912 KiB
subtask_1_09.txt AC 180 ms 18432 KiB
subtask_1_10.txt AC 259 ms 31488 KiB
subtask_1_11.txt AC 259 ms 31488 KiB
subtask_1_12.txt AC 260 ms 31488 KiB
subtask_1_13.txt AC 244 ms 24320 KiB
subtask_1_14.txt AC 256 ms 31576 KiB
subtask_1_15.txt AC 247 ms 24320 KiB
subtask_1_16.txt AC 246 ms 24320 KiB
subtask_1_17.txt AC 253 ms 29784 KiB
subtask_1_18.txt AC 256 ms 31576 KiB
subtask_1_19.txt AC 250 ms 27776 KiB
subtask_1_20.txt AC 252 ms 29784 KiB