Phoenix loves beautiful arrays. An array is beautiful if all its subarrays of length k have the same sum. A subarray of an array is any sequence of consecutive elements.
Phoenix currently has an array a of length n. He wants to insert some number of integers, possibly zero, into his array such that it becomes beautiful. The inserted integers must be between 1 and n inclusive. Integers may be inserted anywhere (even before the first or after the last element), and he is not trying to minimize the number of inserted integers.
Input
The input consists of multiple test cases. The first line contains an integer t (1≤t≤50) — the number of test cases.
The first line of each test case contains two integers n and k (1≤k≤n≤100).
The second line of each test case contains n space-separated integers (1≤ai≤n) — the array that Phoenix currently has. This array may or may not be already beautiful.
Output
For each test case, if it is impossible to create a beautiful array, print -1. Otherwise, print two lines.
The first line should contain the length of the beautiful array m (n≤m≤104). You don’t need to minimize m.
The second line should contain m space-separated integers (1≤bi≤n) — a beautiful array that Phoenix can obtain after inserting some, possibly zero, integers into his array a. You may print integers that weren’t originally in array a.
If there are multiple solutions, print any. It’s guaranteed that if we can make array a beautiful, we can always make it with resulting length no more than 104.
Example
input
4
4 2
1 2 2 1
4 3
1 2 2 1
3 2
1 2 3
4 4
4 3 4 2
output
5
1 2 1 2 1
4
1 2 2 1
-1
7
4 3 2 1 4 3 2
Note
In the first test case, we can make array a beautiful by inserting the integer 1 at index 3 (in between the two existing 2s). Now, all subarrays of length k=2 have the same sum 3. There exists many other possible solutions, for example:
2,1,2,1,2,1
1,2,1,2,1,2
In the second test case, the array is already beautiful: all subarrays of length k=3 have the same sum 5.
In the third test case, it can be shown that we cannot insert numbers to make array a beautiful.
In the fourth test case, the array b shown is beautiful and all subarrays of length k=4 have the same sum 10. There exist other solutions also.
题意
给你一个数组和一个 k,要求添加一些数使得长度为 k 的子数组的和相等。
思路
长度为 k 的子数组的和相等,想到以 k 为周期的数组。
1.若数组元素去重后的长度大于 k,此方案不成立输出 -1。
2.如果数组中不同的数字的数量小于 k 我们将添加一个数字,直到数字的数量为 k。我们可以把这个列表打印 n 次(最坏情况原数组有 n 个数相同,我们没办法删元素,所以直接全部打印,题目也没有要求最小)。
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
typedef long long ll;
int main()
{
int t; cin >> t;
while (t--)
{
set<int> s;
int n, k; cin >> n >> k;
for (int i = 0; i < n; i++)
{
int x; cin >> x;
s.insert(x);
}
if (s.size() > k) cout << -1;
else
{
cout << n * k << endl;
for (int i = 0; i < n; i++)
{
for (auto u : s) cout << u << ' ';
for (int j = 0; j < k - s.size(); j++) cout << 1 << ' ';
}
}
cout << endl;
}
return 0;
}