representatives numbered from 1 to n participate in the occasion. Every representative I is alloted an alternate worker bi, to which worker I needs to make another year gift. Every representative is relegated to precisely another worker, and no one is appointed to themselves
Computer science. Correct answer will be upvoted else downvoted. Code and output screenshot.
representatives numbered from 1 to n participate in the occasion. Every representative I is alloted an alternate worker bi, to which worker I needs to make another year gift. Every representative is relegated to precisely another worker, and no one is appointed to themselves (yet two representatives might be doled out to one another). Officially, all bi should be unmistakable integers among 1 and n, and for any I, bi≠i should hold.
The task is typically created arbitrarily. This year, as an analysis, all occasion members have been asked who they wish to make a gift to. Every worker I has said that they wish to make a gift to representative computer based intelligence.
Track down a legitimate task b that amplifies the number of satisfied wishes of the workers.
Input
Each test contains different experiments. The principal line contains the number of experiments t (1≤t≤105). Depiction of the experiments follows.
Each experiment comprises of two lines. The main line contains a solitary integer n (2≤n≤2⋅105) — the number of members of the occasion.
The subsequent line contains n integers a1,a2,… ,an (1≤
It is ensured that the amount of n over all experiments doesn't surpass 2⋅105.
Output
For each experiment, print two lines.
In the main line, print a solitary integer k (0≤k≤n) — the number of satisfied wishes in your task.
In the subsequent line, print n particular integers b1,b2,… ,bn (1≤bi≤n; bi≠i) — the numbers of workers appointed to representatives 1,2,… ,n.
Step by step
Solved in 3 steps with 1 images
