题意: 现有一个初始数组a,可对其每个数进行一次下列两种操作之一(x的初始值为0)
- ai += x, x ++
- x ++
以使数组变成目标数组(每个数都是k的倍数)
思路:
- 计算没个数的目标次数 t = k - a[i] % k,若t为正整数,记录t出现的次数,若t为0则可以直接忽略(说明a[i]已经是k的倍数)
- 假设t的数组为1,2,3,4,5那么需要重复的次数ans就为其出现次数最多中的maxx(即5);
- 若t的数组为1,2,2,2,4的话,那么除了取其maxx(即2)外,另外两个2还需取两次循环,对ans贡献2 * k次
- 所以ans = maxx + (maxs - 1)* k + 1。
代码实现:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <cstring>
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int t, n, k;
map<int, int> mp;
signed main()
{
IOS;
cin >> t;
while(t --){
cin >> n >> k;
int maxx = 0, maxs = 0; mp.clear();
while(n --){
int x; cin >> x;
x %= k;
if(x){
x = k - x;
mp[x] ++;
if(mp[x] > maxs){
maxx = x;
maxs = mp[x];
}
else if(mp[x] == maxs && x > maxx)
maxx = x;
}
}
if(!maxs) cout << 0 << endl;
else cout << maxx + (maxs - 1) * k + 1 << endl;
}
return 0;
}