-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathd.cpp
75 lines (70 loc) · 2.08 KB
/
d.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T; cin >> T;
while(T--){
int N; cin >> N;
int a[N];
int mex[N+1];
fill(mex, mex+N+1, 0);
for(int i = 0; i < N; i++){
cin >> a[i];
mex[a[i]]++;
}
bool good = true;
vi idxs;
while(good){
good = false;
for(int i = 1; i < N; i++){
if(a[i] < a[i-1]){
good = true;
}
}
if(!good){
break;
}
int nmex;
bool good = false;
for(nmex = 0; nmex < N; nmex++){
if(mex[nmex] == 0){
good = true;
mex[a[nmex]]--;
a[nmex] = nmex;
mex[nmex]++;
idxs.push_back(nmex);
break;
}
}
if(!good){
for(int i = 0; i < N; i++){
if(a[i] != i){
mex[N]++;
mex[a[i]]--;
a[i] = N;
idxs.push_back(i);
break;
}
}
}
//for(int i : mex) cout << i << " ";
//cout << endl;
}
cout << idxs.size() << endl;
for(int i : idxs) cout << i+1 << " ";
cout << endl;
}
return 0;
}