Submission #1655728

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vstring vector<string>
using namespace std;

#include<map>
#include<set>
#include<queue>

typedef long long ll;
typedef unsigned long long ull;

const int MAX_N = 1000000;
const int INFTY = (1 << 21); // 2097152
// const ll INFTY = (1LL << 60);
const ll MD = 1000000007LL;
// fprintf(stderr, "%d %lld \n", x, xll);


int H, W;
ll XX, A, P;
class Data{

public:

	int value, y, x;
	Data(int y, int x, int value) {
		this -> value = value;
		this -> y = y;
		this -> x = x;
	}

	bool operator < (const Data &d) const{
		return value < d.value;
	}
	bool operator >(const Data &d) const{
		return value > d.value;
	}
};

vector<Data> V;

int main() {
	cin >> H >> W;
	cin >> XX >> A >> P;

	if(A % P == 0){
		if(XX == (XX + A) % P){
			cout << 0 << endl; return 0;
		}
		else{
			cout << (H - 1) * 2 << endl; return 0;
		}
	}
	else{
		ll xx = XX;
		rep(y, H)
			rep(x, W){
				V.push_back(Data(y, x, xx));
				xx = (xx + A) % P;
			}

		sort(V.begin(), V.end());
        for(auto v: V){
            // fprintf(stderr, "%d %d %d\n", v.y, v.x, v.value);
        }

		ll ret = 0;
		rep(y, H){
			vint XS;
			rep(x, W){
				int i = y * W + x;
				XS.push_back(V[i].x);
				ret += abs(V[i].y - y);
			}
			sort(XS.begin(), XS.end());
			rep(x, W){
				ret += abs(XS[x] - x);
			}
		}

		cout << ret << endl;
	}


}

Submission Info

Judge Result