题意:给定一个R*C的矩阵和n个障碍点,求出矩阵中所有联通块的大小。
分析:给出的矩阵大小是10^9的,但是障碍点却只有200个,我们可以将矩阵压缩,因为有意义的边界值就200个,加上空白地方的位置我们就能压缩成一个最多400*400的矩阵了,然后dfs一下就行了。
代码:
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<vector>
#include<string>
#include<stdio.h>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=210;
const int M=50010;
const int mod=1000000007;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=1004535809;
const int INF=1000000010;
const ll MAX=1ll<<55;
const double eps=1e-5;
const double inf=~0u>>1;
const double pi=acos(-1.0);
typedef long double db;
typedef unsigned int uint;
typedef unsigned long long ull;
int k,x[N],y[N],r[2*N],c[2*N],h[2*N],l[2*N],ma[2*N][2*N];
ll ans[N*N];
void dfs(int a,int b) {
ans[k]+=(ll)h[a]*l[b];ma[a][b]=1;
if (a>1&&!ma[a-1][b]) dfs(a-1,b);
if (a<h[0]&&!ma[a+1][b]) dfs(a+1,b);
if (b>1&&!ma[a][b-1]) dfs(a,b-1);
if (b<l[0]&&!ma[a][b+1]) dfs(a,b+1);
}
int main()
{
int i,j,g,n,ca,T,X,Y;
scanf("%d", &T);
for (ca=1;ca<=T;ca++) {
scanf("%d%d", &X, &Y);
scanf("%d", &n);
g=2;r[1]=c[1]=0;
r[2]=X+1;c[2]=Y+1;
for (i=1;i<=n;i++) {
scanf("%d%d", &x[i], &y[i]);
g++;r[g]=x[i];c[g]=y[i];
}
sort(r+1,r+n+3);g=unique(r+1,r+n+3)-(r+1);
for (h[0]=0,i=2;i<=g;i++) {
if (r[i]>r[i-1]+1) h[++h[0]]=r[i]-r[i-1]-1;
if (i!=g) h[++h[0]]=1;
for (j=1;j<=n;j++)
if (x[j]==r[i]) x[j]=h[0];
}
sort(c+1,c+n+3);g=unique(c+1,c+n+3)-(c+1);
for (l[0]=0,i=2;i<=g;i++) {
if (c[i]>c[i-1]+1) l[++l[0]]=c[i]-c[i-1]-1;
if (i!=g) l[++l[0]]=1;
for (j=1;j<=n;j++)
if (y[j]==c[i]) y[j]=l[0];
}
for (i=1;i<=h[0];i++)
for (j=1;j<=l[0];j++) ma[i][j]=0;
for (i=1;i<=n;i++) ma[x[i]][y[i]]=1;
for (k=0,i=1;i<=h[0];i++)
for (j=1;j<=l[0];j++)
if (!ma[i][j]) { k++;ans[k]=0ll;dfs(i,j); }
sort(ans+1,ans+k+1);
printf("Case #%d:\n%d\n", ca, k);
for (i=1;i<k;i++) printf("%I64d ", ans[i]);
printf("%I64d\n", ans[k]);
}
return 0;
}