Codeforces Round 954 (Div. 3) -E. Beautiful Array

对数组a进行分组，将对k取模后余数相同的元素放到一组，同时组内从小到大排序

若组内元素为奇数个的组的个数>=2，必然无法通过若干次操作使得

计算每组内所需的最少次数，设组内元素个数为num

num为偶数时，依照从小到大的顺序两两一组进行合并（易证）

num为奇数时，需要考虑将哪个元素放在最中间，可以通过维护前缀和和后缀和，再遍历组内元素，找到所需的最小操作次数

code

struct P {
	int x, m;
};
bool comp(P a, P b) {
	if (a.m == b.m)
		return a.x < b.x;
	return a.m < b.m;
}
void solve() {
	int n, k;
	cin >> n >> k;
	int ans = 0;
	vector<P>a,b;
	map<int, int> mp;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		b.push_back({ x ,x % k });
		mp[x % k]++;
	}
	sort(b.begin(), b.end(),comp);
	for (int i = 0; i < n; i++) {
		if (i + 1 < n && b[i].x == b[i + 1].x){
			mp[b[i].m] -= 2;
			i++;
		}
		else
			a.push_back({ b[i].x,b[i].m });
	}
	int f = 0;
	for (auto u : mp) {
		if (u.second % 2 != 0)
			f++;
	}
	if (f >= 2) {
		cout << -1 << '\n';
		return;
	}
	int i = 0;
	for (auto u : mp) {
		int num = u.second;
		if (num % 2) {
			int mi = -1;
			vector<int> pre(num + 2,0), aft(num + 2,0);
			for (int j = i + 1; j < i + num; j += 2) 
				pre[j-i+1] = pre[j-i-1]+(a[j].x - a[j - 1].x) / k;
			for (int j = i + num-2; j >i; j -= 2)
				aft[j - i + 1] = aft[j - i + 3] + (a[j+1].x - a[j].x) / k;
			for (int j = i; j < i + num; j++) {
				if ((j - i) % 2)
					continue;
				if (mi == -1)
					mi = pre[j - i] + aft[j - i + 2];
				else
					mi = min(mi, pre[j - i] + aft[j - i + 2]);
			}
			ans += mi;
		}
		else {
			for (int j = i + 1; j < i + num; j += 2) 
				ans += (a[j].x - a[j - 1].x) / k;
		}
		i += num;
	}
	cout << ans << '\n';
}