8565: Constructive Problems Never Die

链接：https://ac.nowcoder.com/acm/contest/33192/C
来源：牛客网
Grammy has a sequence A of length n.

Please find a permutation P such that Pi≠Ai for all i.

There are multiple test cases.
The first line contains a single integer $T$ (1≤T≤1000001 \leq T \leq 100\,0001≤T≤100000), denoting the number of test cases.
For each test case:
The first line contains a single integer $n$ ($1\le n\le 100000$).
The second line contains $n$ integers A1,A2,…,AnA_1,A_2,\dots,A_nA1,A2,…,An (1≤Ai≤n1 \leq A_i \leq n1≤Ai≤n).
It is guaranteed that the sum of $n$ does not exceed $500000$.

For each test case:
If the permutation does not exist, output “NO” in one line.
Otherwise output “YES” in the first line, then output $n$ integers in the second line, denoting the permutation P1,P2,…,PnP_1,P_2,\dots,P_nP1,P2,…,Pn.

3
3
3 3 3
3
3 2 1
6
1 1 4 5 1 4

NO
YES
1 3 2
YES
4 5 1 2 3 6