#include <bits/stdc++.h>
#include "seats.h"
using namespace std;
int H, W, ST[4000004];
int X[2][4000004], Y[2][4000004];
array<int, 4> P[4000004];
vector<int> R, C;
void update(int v, int l, int r, int p, int val, int t) {
if(l == r) {
X[t][v] = Y[t][v] = val;
return;
}
int md = (l + r) / 2;
if(p <= md) update(v * 2, l, md, p, val, t);
else update(v * 2 + 1, md + 1, r, p, val, t);
X[t][v] = min(X[t][v * 2], X[t][v * 2 + 1]);
Y[t][v] = max(Y[t][v * 2], Y[t][v * 2 + 1]);
}
pair<int, int> query(int v, int l, int r, int lo, int hi, int t) {
if(l > hi || r < lo) return {-1, -1};
if(l >= lo && r <= hi) return {X[t][v], Y[t][v]};
pair<int, int> A = query(v * 2, l, (l + r) / 2, lo, hi, t);
pair<int, int> B = query(v * 2 + 1, (l + r) / 2 + 1, r, lo, hi, t);
if(A.first == -1) return B;
if(B.first == -1) return A;
return {min(A.first, B.first), max(A.second, B.second)};
}
void update(int v, int l, int r, int p, int val) {
if(l == r) {
ST[v] = val;
return;
}
int md = (l + r) / 2;
if(p <= md) update(v * 2, l, (l + r) / 2, p, val);
else update(v * 2 + 1, (l + r) / 2 + 1, r, p, val);
ST[v] = ST[v * 2] + ST[v * 2 + 1];
}
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
::H = H; ::W = W;
for(auto u : R) ::R.push_back(u);
for(auto u : C) ::C.push_back(u);
int r1 = R[0], r2 = R[0];
int c1 = C[0], c2 = C[0];
for(int l = 0; l < H * W; l++) {
r1 = min(r1, R[l]); r2 = max(r2, R[l]);
c1 = min(c1, C[l]); c2 = max(c2, C[l]);
int cur = (r2 - r1 + 1) * (c2 - c1 + 1);
update(1, 0, H * W - 1, l, (cur == l + 1));
P[l] = {r1, r2, c1, c2};
if(max(H, W) <= 1000) {
update(1, 0, H * W - 1, l, R[l], 0);
update(1, 0, H * W - 1, l, C[l], 1);
}
}
}
int swap_seats(int A, int B) {
if(A > B) swap(A, B);
swap(R[A], R[B]); swap(C[A], C[B]);
if(max(H, W) <= 1000) {
update(1, 0, H * W - 1, A, R[A], 0);
update(1, 0, H * W - 1, A, C[A], 1);
update(1, 0, H * W - 1, B, R[B], 0);
update(1, 0, H * W - 1, B, C[B], 1);
int res = 0;
for(int l = 0; l < H * W; ) {
pair<int, int> U = query(1, 0, H * W - 1, 0, l, 0);
pair<int, int> V = query(1, 0, H * W - 1, 0, l, 1);
int cur = (U.second - U.first + 1) * (V.second - V.first + 1);
res += (cur == l + 1);
if(cur == l + 1) l += min(U.second - U.first + 1, V.second - V.first + 1);
else l = cur - 1;
}
return res;
}
int r1 = (A > 0 ? P[A - 1][0] : H * W), r2 = (A > 0 ? P[A - 1][1] : 0);
int c1 = (A > 0 ? P[A - 1][2] : H * W), c2 = (A > 0 ? P[A - 1][3] : 0);
for(int l = A; l <= B; l++) {
r1 = min(r1, R[l]); r2 = max(r2, R[l]);
c1 = min(c1, C[l]); c2 = max(c2, C[l]);
int cur = (r2 - r1 + 1) * (c2 - c1 + 1);
update(1, 0, H * W - 1, l, (cur == l + 1));
P[l] = {r1, r2, c1, c2};
}
return ST[1];
}
