Submission #7613103

---

Source Code Expand

from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque



def main():
    tate_num, yoko_num, d = map(int, input(). split())
    data = list(map(int, input().split()))

    goal_data = [0 for i in range(tate_num + 1)]
    for i in range(1, tate_num + 1):
        now_tate = i
        for j in range(yoko_num):
            if data[j] == now_tate:
                now_tate += 1
            elif data[j] == now_tate - 1:
                now_tate -= 1
        goal_data[i] = now_tate

    for i in range(1, tate_num + 1):
        count = 0
        start = i
        now_tate = i
        while 1:
            now_tate = goal_data[now_tate]
            count += 1
            if now_tate == start:
                break
        amari = d % count
        for j in range(amari):
            now_tate = goal_data[now_tate]
        print(now_tate)







if __name__ == '__main__':
    main()

Submission Info

Judge Result