二维离散化,作图后容易理解,记录离散后各个x与y原来对应的长度
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 205;
bool vis[maxn*2][maxn*2];
int x[maxn], y[maxn], tx[maxn], ty[maxn];
int h[maxn], w[maxn];
int n, m;
map<int, int> mx, my;
int r, c, k;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {-1, 1, 0, 0};
int compress(int *arr, int *len, map<int, int> &Map) {
sort(arr, arr + k + 2);
//printf("arr: "); for(int i = 0; i < k; ++i) printf("%d", arr[i]); cout << endl;
int newk = unique(arr, arr + k + 2) - arr;
//printf("newarr: "); for(int i = 0; i < newk; ++i) printf("%d", arr[i]); cout << endl;
int sz = 0;
for(int i = 1; i < newk; ++i) {
if(arr[i] != arr[i-1]+1) len[++sz] = arr[i] - arr[i-1] - 1;
if(i != newk - 1) {
len[++sz] = 1;
Map[arr[i]] = sz;
}
}
return sz;
}
bool inside(int i, int j) { return 1 <= i && i <= n && 1 <= j && j <= m; }
ll bfs(int i, int j) {
ll ret = 0;
queue<pair<int, int> > q;
q.push(make_pair(i, j));
ret = (ll)h[i]*w[j];
vis[i][j] = true;
while(q.size()) {
int ii = q.front().first, jj = q.front().second;
q.pop();
for(int k = 0; k < 4; ++k) {
int ni = ii + dx[k], nj = jj + dy[k];
if(inside(ni, nj) && !vis[ni][nj]) {
vis[ni][nj] = true;
q.push(make_pair(ni, nj));
ret += (ll)h[ni]*w[nj];
}
}
}
return ret;
}
void debug() {
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
if(vis[i][j]) putchar('*');
else putchar('.');
}
cout << endl;
}
}
int main() {
//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
int t, kase = 1;
scanf("%d", &t);
while(t--) {
memset(vis, 0, sizeof(vis));
mx.clear();
my.clear();
printf("Case #%d:\n", kase++);
scanf("%d%d", &r, &c);
scanf("%d", &k);
for(int i = 0; i < k; ++i) {
scanf("%d%d", &x[i], &y[i]);
}
memcpy(tx, x, k*sizeof(int));
memcpy(ty, y, k*sizeof(int));
tx[k] = ty[k] = 0, tx[k + 1] = r + 1, ty[k + 1] = c + 1;
n = compress(tx, h, mx);
m = compress(ty, w, my);
for(int i = 0; i < k; ++i) {
vis[mx[x[i]]][my[y[i]]] = true;
}
//debug();
vector<ll> ans;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(!vis[i][j]) ans.push_back(bfs(i, j));
}
}
sort(ans.begin(), ans.end());
printf("%d\n", ans.size());
for(int i = 0; i < ans.size(); ++i) {
if(i) putchar(' ');
printf("%lld", ans[i]);
}
puts("");
}
return 0;
}