Submission #7613218

---

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_kari = [i for i in range(tate_num + 1)]
    for i in range(yoko_num):
        ind = data[i]
        goal_data_kari[ind], goal_data_kari[ind + 1] = goal_data_kari[ind + 1], goal_data_kari[ind]

    goal_data = [0 for i in range(tate_num + 1)]
    for i in range(1, tate_num + 1):
        goal_data[goal_data_kari[i]] = i

    ans_list = [0 for i in range(tate_num + 1)]

    for i in range(1, tate_num + 1):
        if ans_list[i]:
            continue
        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]

        while ans_list[start] == 0:
            ans_list[start] = now_tate
            start = goal_data[start]
            now_tate = goal_data[now_tate]

    for i in range(1, tate_num + 1):
        print(ans_list[i])







if __name__ == '__main__':
    main()

Submission Info

Judge Result