#include "seats.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Pi acos(-1);
#define mod 1e9+7
#define inf 1e18
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
const int NN = 1e4+5;
int a[NN][NN], n, m;
pii ch[2] = {{1, 0}, {0, 1}}, used[NN];
int uu[NN][NN];
int check(){
int cnt = 0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
memset(uu, 0, sizeof uu);
queue<pair<pii, pii>> qq;
qq.push({{a[i][j], a[i][j]}, {i, j}});
//cout<<i<<" "<<j<<endl;
if(a[i][j] == 0) cnt++;
while(!qq.empty()){
pii mm = qq.front().ff;
pii xy = qq.front().ss;
qq.pop();
//cout<<mm.ff<<" "<<mm.ss<<" "<<xy.ff<<" "<<xy.ss<<" "<<cnt<<endl;
for(int i=0;i<2;i++){
pii tmp = xy;
pii tt = mm;
tmp.ff += ch[i].ff, tmp.ss += ch[i].ss;
if(tmp.ff >= n || tmp.ss >= m) continue; // || uu[tmp.ff][tmp.ss]) continue;
//uu[tmp.ff][tmp.ss] = 1;
umin(tt.ff, a[tmp.ff][tmp.ss]);
umax(tt.ss, a[tmp.ff][tmp.ss]);
if(tt.ff == 0 && tt.ss == (tmp.ff - i+1)*(tmp.ss - j+1) -1) cnt++;
qq.push({tt, tmp});
}
}
}
}
return cnt;
}
int swap_seats(int aa, int b) {
swap(a[used[aa].ff][used[aa].ss], a[used[b].ff][used[b].ss]);
return check();
}
void give_initial_chart(int H, int W, vector<int> R, vector<int> C) {
n = H, m = W;
for(int i=0;i<sz(R);i++) a[R[i]][C[i]] = i, used[i] = {R[i], C[i]};
}
/*
2 3 2
0 0
1 0
1 1
0 1
0 2
1 2
0 5
0 5
*/
