Submission #75815709

Source Code Expand

import sys
input = sys.stdin.readline

for _ in range(int(input())):
    n = int(input())
    s = input().rstrip()
    s = s[-2]+s[-1]+s+s[0]+s[1]
    
    L = [0]*n
    for i in range(n):
        if s[i] == s[i+1] or s[i+1] == s[i+3] or s[i+3] == s[i+4]:
            L[i] = 1
    for i in range(n):
        if L[i] == 0: L[i] = 2
    print(*L)

Submission Info

Submission Time
Task J - DETOX
User Cenix820
Language Python (PyPy 3.11-v7.3.20)
Score 100
Code Size 358 Byte
Status AC
Exec Time 251 ms
Memory 118292 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 1
AC × 26
Set Name Test Cases
Sample 00-sample-001.txt
All 00-sample-001.txt, 01-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt, 01-018.txt, 01-019.txt, 01-020.txt, 01-021.txt, 01-022.txt, 01-023.txt, 01-024.txt, 01-025.txt, 01-026.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 46 ms 79484 KiB
01-002.txt AC 251 ms 111148 KiB
01-003.txt AC 215 ms 110336 KiB
01-004.txt AC 227 ms 110248 KiB
01-005.txt AC 224 ms 110540 KiB
01-006.txt AC 226 ms 110472 KiB
01-007.txt AC 222 ms 110356 KiB
01-008.txt AC 213 ms 111000 KiB
01-009.txt AC 218 ms 110892 KiB
01-010.txt AC 217 ms 110480 KiB
01-011.txt AC 214 ms 110660 KiB
01-012.txt AC 214 ms 111492 KiB
01-013.txt AC 217 ms 117848 KiB
01-014.txt AC 217 ms 117844 KiB
01-015.txt AC 215 ms 117720 KiB
01-016.txt AC 218 ms 117912 KiB
01-017.txt AC 218 ms 117824 KiB
01-018.txt AC 215 ms 118268 KiB
01-019.txt AC 217 ms 117744 KiB
01-020.txt AC 218 ms 117840 KiB
01-021.txt AC 219 ms 118172 KiB
01-022.txt AC 216 ms 117848 KiB
01-023.txt AC 216 ms 118128 KiB
01-024.txt AC 215 ms 118272 KiB
01-025.txt AC 217 ms 118292 KiB
01-026.txt AC 237 ms 112596 KiB