{"problem":{"name":"Inverse of Permutation","description":{"content":"We will call a sequence of length $N$ where each of $1,2,\\dots,N$ occurs once as a permutation of length $N$.   Given a permutation of length $N$, $P = (p_1, p_2,\\dots,p_N)$, print a permutation of le","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc217_c"},"statements":[{"statement_type":"Markdown","content":"We will call a sequence of length $N$ where each of $1,2,\\dots,N$ occurs once as a permutation of length $N$.  \nGiven a permutation of length $N$, $P = (p_1, p_2,\\dots,p_N)$, print a permutation of length $N$, $Q = (q_1,\\dots,q_N)$, that satisfies the following condition.\n\n*   For every $i$ $(1 \\leq i \\leq N)$, the $p_i$\\-th element of $Q$ is $i$.\n\nIt can be proved that there exists a unique $Q$ that satisfies the condition.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $(p_1,p_2,\\dots,p_N)$ is a permutation of length $N$ (defined in Problem Statement).\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$p_1$ $p_2$ $\\dots$ $p_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc217_c","tags":[],"sample_group":[["3\n2 3 1","3 1 2\n\nThe permutation $Q=(3,1,2)$ satisfies the condition, as follows.\n\n*   For $i = 1$, we have $p_i = 2, q_2 = 1$.\n*   For $i = 2$, we have $p_i = 3, q_3 = 2$.\n*   For $i = 3$, we have $p_i = 1, q_1 = 3$."],["3\n1 2 3","1 2 3\n\nIf $p_i = i$ for every $i$ $(1 \\leq i \\leq N)$, we will have $P = Q$."],["5\n5 3 2 4 1","5 3 2 4 1"]],"created_at":"2026-03-03 11:01:14"}}