time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Polycarp is a music editor at the radio station. He received a playlist for tomorrow, that can be represented as a sequence a1, a2, …, an, where ai is a band, which performs the i-th song. Polycarp likes bands with the numbers from 1 to m, but he doesn’t really like others.
We define as bj the number of songs the group j is going to perform tomorrow. Polycarp wants to change the playlist in such a way that the minimum among the numbers b1, b2, …, bm will be as large as possible.
Find this maximum possible value of the minimum among the bj (1 ≤ j ≤ m), and the minimum number of changes in the playlist Polycarp needs to make to achieve it. One change in the playlist is a replacement of the performer of the i-th song with any other group.
Input
The first line of the input contains two integers n and m (1 ≤ m ≤ n ≤ 2000).
The second line contains n integers a1, a2, …, an (1 ≤ ai ≤ 109), where ai is the performer of the i-th song.
Output
In the first line print two integers: the maximum possible value of the minimum among the bj (1 ≤ j ≤ m), where bj is the number of songs in the changed playlist performed by the j-th band, and the minimum number of changes in the playlist Polycarp needs to make.
In the second line print the changed playlist.
If there are multiple answers, print any of them.
Examples
input
4 2
1 2 3 2
output
2 1
1 2 1 2
input
7 3
1 3 2 2 2 2 1
output
2 1
1 3 3 2 2 2 1
input
4 4
1000000000 100 7 1000000000
output
1 4
1 2 3 4
Note
In the first sample, after Polycarp’s changes the first band performs two songs (b1 = 2), and the second band also performs two songs (b2 = 2). Thus, the minimum of these values equals to 2. It is impossible to achieve a higher minimum value by any changes in the playlist.
In the second sample, after Polycarp’s changes the first band performs two songs (b1 = 2), the second band performs three songs (b2 = 3), and the third band also performs two songs (b3 = 2). Thus, the best minimum value is 2.
【题解】
首先那个最小值的最大值肯定是n/m;
因为平均分才能使得最小的最大。
设k = n/m;
然后就是要维护出现次数的最小值大于等于k了；
具体的办法是把那些原序列出现次数大于k且数字本身小于等于m的数和那些数字本身大于m的数字加入到一个giver队列中。
表示这些数字都能转换成出现次数小于k的那些数字。以此来维护(1..m)权值范围内的数字出现次数的最小值大于等于k;
具体的操作看代码
#include <cstdio>
#include <queue>
using namespace std;
const int MAXN = 2999;
struct data1
{
int what;
int num;
int idx;
};
int n, m, a[MAXN], step = 0;
int dic[MAXN];
queue <data1> q, g;
bool emp[MAXN] = { 0 };
int main()
{
//freopen("F:\rush.txt", "r", stdin);
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
if (a[i] <= m)
dic[a[i]]++;
}
int k1;
k1 = n / m;
for (int i = 1; i <= m; i++)
if (dic[i] < k1)
{
data1 temp;
temp.what = i;
temp.num = dic[i];
q.push(temp);
}
for (int i = 1; i <= n; i++)
if (a[i] <= m)
{
if (dic[a[i]] > k1)
{
data1 temp;
temp.what = a[i];
temp.num = 1;
temp.idx = i;
g.push(temp);
}
}
else
{
data1 temp;
temp.what = a[i];
temp.num = 1;
temp.idx = i;
g.push(temp);
}
while (!q.empty())
{
data1 temp = q.front();
data1 giver = g.front();
if (giver.what <= m && emp[giver.what])//如果giver已经从大于k变成了k则emp[giver]会变成true,表示不能再用它转换了。
{
g.pop();
continue;
}
a[giver.idx] = temp.what;
step++;
if (giver.what <= m)
{
dic[giver.what]--;
if (dic[giver.what] == k1)//从大于k变成等于k则不能在用这个giver了
emp[giver.what] = true;
}
g.pop();
temp.num++;
if (temp.num == k1)
q.pop();
else
q.front().num = temp.num;
}
printf("%d %d
", k1, step);
for (int i = 1; i <= n - 1; i++)
printf("%d ", a[i]);
printf("%d
", a[n]);
return 0;
}