Submission #1521189

---

Source Code Expand

#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int N, M, a, md, x[1000009], p[1000009]; vector<int> g[1009];
int main() {
	cin >> N >> M >> x[0] >> a >> md;
	for (int i = 1; i < N * M; i++) x[i] = (x[i - 1] + a) % md, p[i] = i;
	sort(p, p + N * M, [](int i, int j) { return x[i] < x[j]; });
	long long ret = 0;
	for (int i = 0; i < N * M; i++) {
		ret += abs(p[i] / M - i / M);
		g[i / M].push_back(p[i] % M);
	}
	for (int i = 0; i < N; i++) {
		sort(g[i].begin(), g[i].end());
		for (int j = 0; j < M; j++) ret += abs(g[i][j] - j);
	}
	cout << ret << endl;
	return 0;
}

Submission Info

Judge Result