#include "seats.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 1e6 + 12;

pair<int, int> t[maxn * 4];
int p[maxn];
int r[maxn], c[maxn];
vector<int> a[maxn];
int n, m;

pair<int, int> operator + (pair<int, int> x, pair<int, int> y) {
    if(x.first == y.first) {
        return {x.first, x.second + y.second};
    }
    return min(x, y);
}

void build(int v, int tl, int tr) {
    if(tl == tr) {
        t[v] = {0, 1};
        return;
    }

    int mid = (tl + tr) >> 1;
    build(v * 2, tl, mid);
    build(v * 2 + 1, mid + 1, tr);
    t[v] = t[v * 2] + t[v * 2 + 1];
}

void push(int v, int tl, int tr) {
    if(tl > tr) return;
    t[v * 2].first += p[v];
    t[v * 2 + 1].first += p[v];
    p[v * 2] += p[v], p[v * 2 + 1] += p[v];
    p[v] = 0;
}

void upd(int v, int tl, int tr, int l, int r, int x) {
    push(v, tl, tr);
    if(tl > r || l > tr) return;
    if(tl >= l && tr <= r) {
        t[v].first += x;
        p[v] += x;
        return;
    }
    int mid = (tl + tr) / 2;
    upd(v * 2, tl, mid, l, r, x);
    upd(v * 2 + 1, mid + 1, tr, l, r, x);
    t[v] = t[v * 2] + t[v * 2 + 1];
}

void upd(int i, int j, int x) {
    vector<int> v = {a[i][j], a[i + 1][j], a[i][j + 1], a[i + 1][j + 1]};
    sort(v.begin(), v.end());
    upd(1, 1, n * m, v[0], v[1] - 1, x);
    upd(1, 1, n * m, v[2], v[3] - 1, 10 * x);
}

void update(int i, int j, int x) {
    for(int l = i - 1; l <= i; l++) {
        for(int r = j - 1; r <= j; r++) {
            upd(l, r, x);
        }
    }
}

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
    n = H, m = W;
    for(int i = 0; i <= n + 1; i++) {
        a[i] = vector<int> (m + 2, 0);
        for(int j = 0; j <= m + 1; j++) {
            if(!i || i > n || !j || j > m) {
                a[i][j] = 1e9;
            }
        }
    }

    build(1, 1, n * m);

    for(int i = 1; i <= n * m; i++) {
        r[i] = R[i - 1] + 1, c[i] = C[i - 1] + 1;
        a[r[i]][c[i]] = i;
    }

    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= m; j++) {
            upd(i, j, 1);
        }
    }
}

int swap_seats(int i, int j) {
    i++, j++;
    update(r[i], c[i], -1);
    update(r[j], c[j], -1);
    swap(r[i], r[j]);
    swap(c[i], c[j]);
    a[r[i]][c[i]] = i, a[r[j]][c[j]] = j;
    update(r[i], c[i], 1);
    update(r[j], c[j], 1);
    return t[1].second;
}