CF884E Binary Matrix [并查集][滚动数组]

传送门

题意: 求1的连通块的个数

比较容易想到用并查集合并, 但是题目空间不允许

因为只会和上面一排合并, 所以考虑滚动数组, 每次把根弄到最下面的一排

#include<bits/stdc++.h>
#define N 40050
using namespace std;
int fa[N], cnt, n, m; char s[N];
int mp[2][N];
int Pos(int i, int j){ return i * m + j;}
int find(int x){ return x == fa[x] ? x : fa[x] = find(fa[x]);}
void Merge(int x, int y){
	int fx = find(x), fy = find(y);
	if(fx != fy){ fa[fy] = fx; cnt--;}
}
int main(){
	scanf("%d%d", &n, &m);
	for(int i=1; i<=m*2; i++) fa[i] = i;
	for(int i=1; i<=n; i++){
		int now = i & 1;
		scanf("%s", s+1);
		for(int j=1; j<=m/4; j++){
			char c = s[j]; int x = 0; if(!isdigit(c)) x = c - 'A' + 10; else x = c - '0';
			mp[now][(j-1) * 4 + 1] = (x >> 3) & 1; cnt += (x >> 3) & 1;
			mp[now][(j-1) * 4 + 2] = (x >> 2) & 1; cnt += (x >> 2) & 1;
			mp[now][(j-1) * 4 + 3] = (x >> 1) & 1; cnt += (x >> 1) & 1;
			mp[now][(j-1) * 4 + 4] = x & 1; cnt += x & 1;
		}
		for(int j=1; j<=m; j++) fa[Pos(now, j)] = Pos(now, j);
		for(int j=1; j<m; j++){
			if(mp[now][j] && mp[now][j+1]) Merge(Pos(now, j), Pos(now, j+1));
		}
		for(int j=1; j<=m; j++){
			if(mp[now^1][j] && mp[now][j]) Merge(Pos(now, j), Pos(now^1, j));	
		}
	} printf("%d", cnt); return 0;
}