Submission #66738966

---

Source Code Expand

import sys
from collections import deque

input = sys.stdin.readline
print = sys.stdout.write


# sys.setrecursionlimit(10 ** 7)
# mod =  1_000_000_007
# MAX = 9_999_987_654_321_000_000
# dir4 = [[-1,0],[1,0],[0,-1],[0,1]]
# dir8 = [[-1,0],[-1,-1],[0,-1],[1,-1],[1,0],[1,1],[0,1],[-1,1]]


#Ctrl + shift + k 한줄 삭제


def solve():
  n,q = map(int,input().rstrip().split())
  arr= [(i+1) for i in range(n)]
  order = 0
  for _ in range(q):
    temp = list(map(int,input().rstrip().split()))
    if temp[0] == 1:
      p = temp[1]-1
      x = temp[2]
      arr[(order+p)%n] = x
    elif temp[0] == 2:
      p = temp[1]-1
      print("%d\n"%(arr[(order+p)%n]))
    elif temp[0] ==3:
      k = temp[1]
    
      order += k







if __name__ == '__main__':
  solve()

Submission Info

Judge Result