#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
int H, W;
vector<int> R, C;
int ans = 1;
vector<int> lor, hir, loc, hic;
struct seg {
int lr, hr, lc, hc;
} tree[4000000];
seg merge(seg a, seg b) {
return {min(a.lr, b.lr), max(a.hr, b.hr), min(a.lc, b.lc), max(a.hc, b.hc)};
}
seg query(int l, int r, int cur, int lo, int hi) {
if (l == lo && r == hi) {
return tree[cur];
}
int lmid = (lo + hi) / 2, rmid = lmid + 1;
if (r <= lmid) {
return query(l, r, cur << 1 | 0, lo, lmid);
} else if(l >= rmid) {
return query(l, r, cur << 1 | 1, rmid, hi);
} else {
return merge(query(l, lmid, cur << 1 | 0, lo, lmid),
query(rmid, r, cur << 1 | 1, rmid, hi));
}
}
void update(int pos, pair<int, int> val, int cur, int lo, int hi) {
if (lo == hi) {
tree[cur] = {val.first, val.first, val.second, val.second};
} else {
int lmid = (lo + hi) / 2, rmid = lmid + 1;
if (pos <= lmid) {
update(pos, val, cur << 1 | 0, lo, lmid);
} else {
update(pos, val, cur << 1 | 1, rmid, hi);
}
tree[cur] = merge(tree[cur << 1 | 0],
tree[cur << 1 | 1]);
}
}
void give_initial_chart(int HH, int WW, vector<int> RR, vector<int> CC) {
H = HH, W = WW, R = RR, C = CC;
if (H <= 1000 && W <= 1000) {
for (int i = 0; i < H * W; i++) {
update(i + 1, {R[i], C[i]}, 1, 1, H * W);
}
} else {
lor.resize(H * W), hir.resize(H * W);
loc.resize(H * W), hic.resize(H * W);
lor[0] = hir[0] = R[0];
loc[0] = hic[0] = C[0];
for (int i = 1; i < H * W; i++) {
lor[i] = min(lor[i - 1], R[i]);
hir[i] = max(hir[i - 1], R[i]);
loc[i] = min(loc[i - 1], C[i]);
hic[i] = max(hic[i - 1], C[i]);
if ((hir[i] - lor[i] + 1) * (hic[i] - loc[i] + 1) == i + 1) {
ans++;
}
}
}
}
int swap_seats(int a, int b) {
if (b < a) {
swap(a, b);
}
swap(R[a], R[b]);
swap(C[a], C[b]);
if (H <= 1000 && W <= 1000) {
update(a + 1, {R[a], C[a]}, 1, 1, H * W);
update(b + 1, {R[b], C[b]}, 1, 1, H * W);
int ans = 0, sz = 1;
while (sz <= H * W) {
seg s = query(1, sz, 1, 1, H * W);
int box = (s.hr - s.lr + 1) * (s.hc - s.lc + 1);
if (box == sz) {
ans++, sz++;
} else {
sz = box;
}
}
return ans;
} else {
for (int i = a; i <= min(H * W - 1, b + 1); i++) {
if ((hir[i] - lor[i] + 1) * (hic[i] - loc[i] + 1) == i + 1) {
ans--;
}
if (i == 0) {
lor[i] = hir[i] = R[i];
loc[i] = hic[i] = C[i];
} else {
lor[i] = min(lor[i - 1], R[i]);
hir[i] = max(hir[i - 1], R[i]);
loc[i] = min(loc[i - 1], C[i]);
hic[i] = max(hic[i - 1], C[i]);
}
if ((hir[i] - lor[i] + 1) * (hic[i] - loc[i] + 1) == i + 1) {
ans++;
}
}
return ans;
}
}
