Submission #2664764


Source Code Expand

import sys
from itertools import product
N = int(input())
s = [0 if c == "o" else 1 for c in input()]
ans =[0]*N
for a,b in product([0,1],[0,1]):
    ans[0:2]=[a,b]
    for i in range(2,N):
        ans[i]=(ans[i-2]+ans[i-1]+s[i-1])%2
    x=(ans[N-2]+ans[N-1]+s[N-1])%2
    y=(ans[N-1]+ans[0]+s[0])%2
    if x==ans[0] and y==ans[1]:
        num=['S' if k==0 else'W' for k in ans]
        print(''.join(num))
        sys.exit()
print(-1)

Submission Info

Submission Time
Task D - Menagerie
User okumura
Language Python (3.4.3)
Score 500
Code Size 450 Byte
Status AC
Exec Time 174 ms
Memory 5660 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 16
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt
All 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 17 ms 3064 KB
00_example_02.txt AC 17 ms 3064 KB
00_example_03.txt AC 17 ms 3064 KB
01.txt AC 101 ms 4788 KB
02.txt AC 41 ms 4308 KB
03.txt AC 21 ms 3064 KB
04.txt AC 17 ms 3064 KB
05.txt AC 128 ms 5412 KB
06.txt AC 63 ms 5500 KB
07.txt AC 37 ms 3444 KB
08.txt AC 32 ms 3572 KB
09.txt AC 19 ms 3188 KB
10.txt AC 46 ms 3316 KB
11.txt AC 172 ms 5660 KB
12.txt AC 174 ms 5660 KB
13.txt AC 139 ms 5660 KB