Submission #338734

Source Code Expand

S = raw_input()
S_list = list(S)
N = int(raw_input())
hai = []

for i in xrange(N):
    hai.append(map(int, raw_input().split()))

for i in xrange(N):
    if hai[i][0] == 1:
        S_list[:hai[i][1]] = S_list[hai[i][1]-1::-1]
    else:
        S_list[hai[i][0] - 1:hai[i][1]] = S_list[hai[i][1]-1:hai[i][0]-2:-1]

print "".join(S_list)

Submission Info

Submission Time
Task B - 文字列の反転
User san46
Language Python (2.7.3)
Score 100
Code Size 352 Byte
Status AC
Exec Time 59 ms
Memory 3520 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 55 ms 3484 KiB
subtask0-sample02.txt AC 55 ms 3496 KiB
subtask1-01.txt AC 55 ms 3492 KiB
subtask1-02.txt AC 55 ms 3488 KiB
subtask1-03.txt AC 55 ms 3488 KiB
subtask1-04.txt AC 57 ms 3496 KiB
subtask1-05.txt AC 57 ms 3488 KiB
subtask1-06.txt AC 58 ms 3492 KiB
subtask1-07.txt AC 59 ms 3488 KiB
subtask1-08.txt AC 56 ms 3484 KiB
subtask1-09.txt AC 58 ms 3488 KiB
subtask1-10.txt AC 59 ms 3520 KiB
subtask1-11.txt AC 59 ms 3520 KiB
subtask1-12.txt AC 55 ms 3484 KiB
subtask1-13.txt AC 55 ms 3484 KiB
subtask1-14.txt AC 58 ms 3492 KiB
subtask1-15.txt AC 59 ms 3484 KiB