#include <bits/stdc++.h>
#include "seats.h"
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
const int MAX_N = 1e6 + 5;
int r[MAX_N], c[MAX_N];
int n;
int ans = 0;
bitset<MAX_N> good;
int min_r[MAX_N], max_r[MAX_N], min_c[MAX_N], max_c[MAX_N];
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
n = H * W;
for (int i = 0; i < n; i++) r[i] = R[i], c[i] = C[i];
min_r[0] = MAX_N, max_r[0] = 0;
min_c[0] = MAX_N, max_c[0] = 0;
for (int i = 0; i < n; i++) {
if (i) {
min_r[i] = min_r[i - 1], max_r[i] = max_r[i - 1];
min_c[i] = min_c[i - 1], max_c[i] = max_c[i - 1];
}
chkmin(min_r[i], r[i]);
chkmax(max_r[i], r[i]);
chkmin(min_c[i], c[i]);
chkmax(max_c[i], c[i]);
good[i] = (max_r[i] - min_r[i] + 1) * (max_c[i] - min_c[i] + 1) == i + 1;
ans += good[i];
}
}
int swap_seats(int a, int b) {
if (a > b) swap(a, b);
swap(r[a], r[b]);
swap(c[a], c[b]);
min_r[a] = MAX_N, max_r[a] = 0;
min_c[a] = MAX_N, max_c[a] = 0;
for (int i = a; i < b; i++) {
ans -= good[i];
if (i) {
min_r[i] = min_r[i - 1], max_r[i] = max_r[i - 1];
min_c[i] = min_c[i - 1], max_c[i] = max_c[i - 1];
}
chkmin(min_r[i], r[i]);
chkmax(max_r[i], r[i]);
chkmin(min_c[i], c[i]);
chkmax(max_c[i], c[i]);
good[i] = (max_r[i] - min_r[i] + 1) * (max_c[i] - min_c[i] + 1) == i + 1;
ans += good[i];
}
return ans;
}
//2 3 2
//0 0
//1 0
//1 1
//0 1
//0 2
//1 2
//
//0 5
//0 5
