Submission #72574913

---

Source Code Expand

import sys,bisect
from heapq import heappop, heappush
from collections import deque, Counter, defaultdict
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353


N,Q = mi()
S = list(input())
id = 0
for _ in range(Q):
    t,x = mi()
    # x-=1
    if t==1:
        x-=1
        y = x+id
        S[y],S[y+1] = S[y+1],S[y]
    else:id+=x
print("".join(S[id:]))

Submission Info

Judge Result