1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
// PA2025, @mjm, r4b-zbi

#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <functional>
using namespace std;
using lol = long long;
inline int nextInt() { int n; scanf("%d", &n); return n; }
bool needSwap;
int line;
inline void mySwap(int& a, int& b) { int t = a; a = b; b = t; }
lol nextPos() {
	int r = nextInt();
	int c = nextInt();
	if (needSwap) mySwap(r, c);
	lol res = r;
	res *= line;
	return res + c;
}

const int prime[] = { 200201 };

struct Item {
	lol value;
	int pos;
	int ver;
};
const int SIZE = 1 << 25;
const lol MASK = SIZE - 1;
const lol ZERO = 0;
Item item[SIZE];

int findIdx(lol val) {
	int idx = val & MASK;
	for (int i = idx; i < SIZE; ++i) {
		if (item[i].value == val) return i;
		if (item[i].value == ZERO) return i;
	}
	for (int i = 0; i < idx; ++i) {
		if (item[i].value == val) return i;
		if (item[i].value == ZERO) return i;
	}
	return -1;
}

const int N = 75000 * 2 + 99;
int n;
lol all[N];
lol delta[4];
int step;

int getPickCount() {
	++step;
	queue<lol> q;
	for (int i = 1; i <= n; ++i) {
		lol v = all[i];
		int idx = findIdx(v);

		int idx1 = findIdx(v - line);
		bool empty1 = item[idx1].value == ZERO || item[idx1].pos == 0;
		int idx2 = findIdx(v + line);
		bool empty2 = item[idx2].value == ZERO || item[idx2].pos == 0;

		if (empty1 && empty2) {
			q.push(v);
			item[idx].ver = step;
			continue;
		}

		int idx3 = findIdx(v - 1);
		bool empty3 = item[idx3].value == ZERO || item[idx3].pos == 0;
		int idx4 = findIdx(v + 1);
		bool empty4 = item[idx4].value == ZERO || item[idx4].pos == 0;

		if (empty3 && empty4) {
			q.push(v);
			item[idx].ver = step;
		}
	}

	int res = 0;
	while (!q.empty()) {
		++res;
		lol v = q.front();
		q.pop();

		for (int i = 0; i < 4; ++i) {
			lol vv = v + delta[i];
			int idx2 = findIdx(vv);
			if (item[idx2].value == ZERO) continue;
			if (item[idx2].pos == 0) continue;
			if (item[idx2].ver == step) continue;
			lol vvv = vv + delta[i];
			int idx3 = findIdx(vvv);
			bool empty3 = false;
			if (item[idx3].value == 0)
				empty3 = true;
			else if (item[idx3].pos == 0)
				empty3 = true;
			else if (item[idx3].ver == step)
				empty3 = true;
			if (empty3) {
				q.push(vv);
				item[idx2].ver = step;
			}
		}
	}
	return res;
}

int main() {
	int h = nextInt();
	int w = nextInt();
	needSwap = h < w;
	for (int i = 0; line < w + 4; ++i)
		line = prime[i];
	delta[0] = -line;
	delta[1] = -1;
	delta[2] = 1;
	delta[3] = line;

	int k = nextInt();
	int q = nextInt();

	n = 0;
	for (int i = 0; i < k; ++i) {
		lol v = nextPos();
		int idx = findIdx(v);
		item[idx].value = v;
		++n;
		item[idx].pos = n;
		all[n] = v;
	}

	int res = getPickCount();
	printf("%d\n", res);

	for (int i = 0; i < q; ++i) {
		lol v = nextPos();
		int idx = findIdx(v);
		while (true) {
			if (item[idx].value == ZERO || item[idx].pos == 0) {
				item[idx].value = v;
				++n;
				item[idx].pos = n;
				all[n] = v;
				break;
			}
			int p = item[idx].pos;
			item[idx].pos = 0;
			if (p == n) {
				--n;
				break;
			}
			lol vv = all[n];
			all[p] = vv;
			int idx2 = findIdx(vv);
			item[idx2].pos = p;
			--n;
			break;
		}
		res = getPickCount();
		printf("%d\n", res);
	}

	return 0;
}