1863C.md (2634B)
1 Source: https://codeforces.com/problemset/problem/1863/C 2 3 C. MEX Repetition 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 You are given an array $a_1,a_2,\ldots, a_n$ of pairwise distinct integers from $0$ to $n$. Consider the following operation: 22 23 * consecutively for each $i$ from $1$ to $n$ in this order, replace $a_i$ with $\operatorname{MEX}(a_1, a_2, \ldots, a_n)$. 24 25 Here $\operatorname{MEX}$ of a collection of integers $c_1, c_2, \ldots, c_m$ is defined as the smallest non-negative integer $x$ which does not occur in the collection $c$. For example, $\operatorname{MEX}(0, 2, 2, 1, 4) = 3$ and $\operatorname{MEX}(1, 2) = 0$. 26 27 Print the array after applying $k$ such operations. 28 29 Input 30 31 Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^5$). The description of the test cases follows. 32 33 The first line of each test case contains two integers $n$ and $k$ ($1\le n\le 10^5$, $1\le k\le 10^9$). 34 35 The second line contains $n$ pairwise distinct integers $a_1,a_2,\ldots, a_n$ ($0\le a_i\le n$) representing the elements of the array before applying the operations. 36 37 It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$. 38 39 Output 40 41 For each test case, print all $n$ elements of the array after applying $k$ operations. 42 43 Example 44 45 Input 46 47 ``` 48 5 49 50 1 2 51 52 1 53 54 3 1 55 56 0 1 3 57 58 2 2 59 60 0 2 61 62 5 5 63 64 1 2 3 4 5 65 66 10 100 67 68 5 3 0 4 2 1 6 9 10 8 69 ``` 70 71 Output 72 73 ``` 74 1 75 2 0 1 76 2 1 77 2 3 4 5 0 78 7 5 3 0 4 2 1 6 9 10 79 ``` 80 81 Note 82 83 In the first test case, here is the entire process: 84 85 1. On the first operation, the array changes from $[1]$ to $[0]$, since $\operatorname{MEX}(1) = 0$. 86 2. On the second operation, the array changes from $[0]$ to $[1]$, since $\operatorname{MEX}(0) = 1$. 87 88 Thus, the array becomes $[1]$ after two operations. 89 90 In the second test case, the array changes as follows during one operation: $[{\mkern3mu\underline{\mkern-3mu {\bf 0}\mkern-3mu}\mkern3mu}, 1, 3] \rightarrow [2, {\mkern3mu\underline{\mkern-3mu {\bf 1}\mkern-3mu}\mkern3mu}, 3] \rightarrow [2, 0, {\mkern3mu\underline{\mkern-3mu {\bf 3}\mkern-3mu}\mkern3mu}] \rightarrow [2, 0, 1]$. 91 92 In the third test case, the array changes as follows during one operation: $[{\mkern3mu\underline{\mkern-3mu {\bf 0}\mkern-3mu}\mkern3mu}, 2] \rightarrow [1, {\mkern3mu\underline{\mkern-3mu {\bf 2}\mkern-3mu}\mkern3mu}] \rightarrow [1, 0]$. And during the second operation: $[{\mkern3mu\underline{\mkern-3mu {\bf 1}\mkern-3mu}\mkern3mu}, 0] \rightarrow [2, {\mkern3mu\underline{\mkern-3mu {\bf 0}\mkern-3mu}\mkern3mu}] \rightarrow [2, 1]$.