Submission #331348

Source Code Expand

str=input()
n=int(input())
data=[]
for i in range(n):
    data.append(list(map(int, input().split())))
for i in data:
    str = str[:i[0]-1] + str[i[0]-1:i[1]][::-1] + str[i[1]:]
print(str)

Submission Info

Submission Time
Task B - 文字列の反転
User jptomoy
Language Python (3.2.3)
Score 100
Code Size 198 Byte
Status AC
Exec Time 141 ms
Memory 8440 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 17
Set Name Test Cases
Sample subtask0-sample01.txt, subtask0-sample02.txt
All subtask0-sample01.txt, subtask0-sample02.txt, subtask1-01.txt, subtask1-02.txt, subtask1-03.txt, subtask1-04.txt, subtask1-05.txt, subtask1-06.txt, subtask1-07.txt, subtask1-08.txt, subtask1-09.txt, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt
Case Name Status Exec Time Memory
subtask0-sample01.txt AC 132 ms 8372 KiB
subtask0-sample02.txt AC 133 ms 8364 KiB
subtask1-01.txt AC 134 ms 8244 KiB
subtask1-02.txt AC 141 ms 8240 KiB
subtask1-03.txt AC 136 ms 8372 KiB
subtask1-04.txt AC 138 ms 8244 KiB
subtask1-05.txt AC 138 ms 8244 KiB
subtask1-06.txt AC 133 ms 8248 KiB
subtask1-07.txt AC 132 ms 8244 KiB
subtask1-08.txt AC 133 ms 8296 KiB
subtask1-09.txt AC 133 ms 8440 KiB
subtask1-10.txt AC 136 ms 8376 KiB
subtask1-11.txt AC 131 ms 8368 KiB
subtask1-12.txt AC 134 ms 8244 KiB
subtask1-13.txt AC 134 ms 8244 KiB
subtask1-14.txt AC 136 ms 8368 KiB
subtask1-15.txt AC 133 ms 8368 KiB