Submission #2470480

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#include <set>
#include <random>
#include <sstream>
#include <stack>
#include <deque>

using namespace std;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;

int main() {
    int N, M;
    int x0, a, p;
    cin >> N >> M;
    cin >> x0 >> a >> p;
    int x = x0;
    vector<vi> G(N);
    vi list;
    rep(i,N) rep(j,M) {
        if (i == 0 && j == 0) {
            G[0].push_back(x0);
            list.push_back(x0);
        } else {
            x = (x + a) % p;
            G[i].push_back(x);
            list.push_back(x);
        }
    }
    sort(list.begin(), list.end());

    ll ans = 0;
    vector<vi> s(N);
    rep(i,N) s[i].resize(M, 0);
    rep(i,N) rep(j,M) {
        auto it = lower_bound(list.begin(), list.end(), G[i][j]);
        int pos = (it - list.begin()) / M;
        ans += abs(i - pos);
        s[pos][j]++;
    }
    rep(i,N) {
        vi t;
        rep(j,M) {
            rep(k,s[i][j])
                t.push_back(j);
        }
        sort(t.begin(), t.end());
        rep(j,t.size()) {
            ans += abs(j - t[j]);
        }
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result