Restoring Permutation CodeForces

You are given a sequence b1,b2,…,bn. Find the lexicographically minimal permutation a1,a2,…,a2n such that bi=min(a2i−1,a2i), or determine that it is impossible.

Input
Each test contains one or more test cases. The first line contains the number of test cases t (1≤t≤100).

The first line of each test case consists of one integer n — the number of elements in the sequence b (1≤n≤100).

The second line of each test case consists of n different integers b1,…,bn — elements of the sequence b (1≤bi≤2n).

It is guaranteed that the sum of n by all test cases doesn’t exceed 100.

Output
For each test case, if there is no appropriate permutation, print one number −1.

Otherwise, print 2n integers a1,…,a2n — required lexicographically minimal permutation of numbers from 1 to 2n.

Example
Input
5
1
1
2
4 1
3
4 1 3
4
2 3 4 5
5
1 5 7 2 8
Output
1 2
-1
4 5 1 2 3 6
-1
1 3 5 6 7 9 2 4 8 10
思路：这是我做过最水的C题。二分寻找符合条件的最小值就可以了。如果找不到，那么就不对。
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;const int maxx=5e2+100;
vector<int> a,b,c;
int vis[maxx];
int n;inline void init()
{a.clear();b.clear();c.clear();memset(vis,0,sizeof(vis));
}
int main()
{int t,x,y;scanf("%d",&t);while(t--){scanf("%d",&n);init();for(int i=1;i<=n;i++) scanf("%d",&x),vis[x]=1,a.push_back(x);for(int i=1;i<=2*n;i++) if(!vis[i]) b.push_back(i);int flag=1;for(int i=0;i<n;i++){x=a[i];y=lower_bound(b.begin(),b.end(),x)-b.begin();if(y==b.size()){flag=0;break;}c.push_back(x);c.push_back(b[y]);b.erase(b.begin()+y);}if(flag==0) cout<<"-1"<<endl;else for(int i=0;i<2*n;i++) cout<<c[i]<<" ";cout<<endl;}return 0;
}

努力加油a啊，(^o)/~

Restoring Permutation CodeForces - 1315C（思维）相关推荐

codeforces - 1315C - 思维题
原题链接:https://codeforces.com/problemset/problem/1315/C 翻译: 这是一个猜谜游戏,你需要猜中一个序列,谜题是一个序列,我们设为b,长度为n.你需要根 ...
Levko and Permutation CodeForces - 361B 思维数论
题意对一个长度,最大值为n的排列构造出其恰好有k个GCD(i,a[i])>1 的排列 n<=1e5; 分析由于每个大于1的数与自己的gcd必然>1 所以构造大于1的gcd可以用 ...
Restoring the Permutation CodeForces - 1506E
题目链接:E. Restoring the Permutation 题解:按字典序最小的简单一点,字典序大的较为复杂,找出字典序最大的可以通过栈,如果当前的a[i]值和a[i-1]值不相等,说明b[i ...
CodeForces 798D 思维,贪心
CodeForces 798D 题意:长度为 n的两个数组 a[]和 b[],要找出 k ( k<=n/2+1 )个下标,使得在两个数组中这 k个数的和乘上 2 要大于所有数的和. tags: ...
C. Restoring Permutation
链接:https://codeforces.ml/contest/1315/problem/C You are given a sequence b1,b2,-,bnb1,b2,-,bn. Find ...
Minimize the Permutation CodeForces - 1256(贪心)
题意: q次询问,每次询问给你长度为n的排列,然后你每次可以选择一个位置i和i+1的数字进行交换.但是每个位置只能交换一次,问你反转若干次后,这个排列最小是多少? 题目: You are given ...
B. Restoring Painting CodeForces - 675B
原题链接位于CodeForceshttps://codeforces.com/problemset/problem/675/B 翻译小 V 在玩填数游戏,游戏在 3×3 的正方形中进行. 9 个格 ...
Balanced Substring CodeForces - 873B (思维+前缀和)
Balanced Substring CodeForces - 873B You are given a string s consisting only of characters 0 and 1. ...
Blue-Red Permutation 贪心，思维
题意 : 给一序列以及序列对应每个位置的颜色,R颜色对应可以增加若干,B反之,问是否能将序列变化为1-n所有数有且仅有1个思路 : 每个数可以得到一个变化范围区间,那么得到了n个区间,区间只存左右端 ...

Restoring Permutation CodeForces - 1315C（思维）

Restoring Permutation CodeForces - 1315C（思维）相关推荐

最新文章

热门文章