Submission #2458230

---

Source Code Expand

#include <iostream>
#include <tuple>
#include <algorithm>
using namespace std;
typedef tuple<int, int, int> T;

int n, m, x0, a, p;
T t[1000000];

int Abs(int x) { if (x > 0) return x; return -x; }

int main() {
	int i, j;
	
	cin >> n >> m >> x0 >> a >> p;
	
	int x = x0;
	for (i = 0; i < n; i++) {
		for (j = 0; j < m; j++) {
			t[i * m + j] = T(x, i, j);
			x = (x + a) % p;
		};
	}
	sort(t, t + n * m);
	
	int ans = 0;
	for (i = 0; i < n; i++) {
		int col[1000];
		for (j = 0; j < m; j++) {
			col[j] = get<2>(t[i * m + j]);
			ans += Abs(i - get<1>(t[i * m + j]));
		}
		sort(col, col + m);
		for (j = 0; j < m; j++) {
			ans += Abs(col[j] - j);
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result