CF 844E(Binary Matrix-压缩存储的矩阵的连通块)

给1个n*m的01矩阵，求1的连通块个数
注意每行的每连续4个数压缩成一个16进制数输入
$(1 \le n \le 212, 4 \le m \le 2^14 , 4|m$

对于每一行存储每个位置属于哪个连通块，用并查集向下转移，如果有连通块无法向下连通则累加答案

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (1<<15)
int f[2][1<<14]={};
char s[MAXN];
class bingchaji
{
public:
    int father[MAXN],n,cnt;
    void mem(int _n)
    {
        n=cnt=_n;
        Rep(i,n) father[i]=i;
    }
    int getfather(int x) 
    {
        if (father[x]==x) return x;

        return father[x]=getfather(father[x]);
    }
    void unite(int x,int y)
    {
        x=getfather(x);
        y=getfather(y);
        if (x^y) {
            --cnt;
            father[y]=x;
        }
    }
    bool same(int x,int y)
    {
        return getfather(x)==getfather(y);
    }
}S;

#define P(x,y) (((x) * m + (y) ))
int main()
{
//  freopen("E.in","r",stdin);
//  freopen(".out","w",stdout);

    int n=read(),m=read();
    ll ans=0;
    S.mem(2*m);
    For(i,n+1) {
        int p=0;
        int now=i&1;
        if (i<=n) {
            scanf("%s",s);
            Rep(j,m/4) {
                int p=s[j];
                if (isdigit(p)) p-='0'; else p=p-'A'+10;
                f[now][(j<<2)+3]=p&1;
                f[now][(j<<2)+2]=(p>>1)&1;
                f[now][(j<<2)+1]=(p>>2)&1;
                f[now][(j<<2)]=(p>>3)&1;
            }
        } else MEM(f[now]);
        Rep(j,m) S.father[P(now,j)]=P(now,j);
        Rep(k,2) Rep(j,m) {
            if (j<m-1 && f[k][j]&&f[k][j+1] )  S.unite(P(k,j) ,P(k,j+1 ) ); //r->l
            if (0==k && f[k][j] && f[k+1][j] ) {
                S.unite(P(now,j) ,P(now^1 ,j)  ); //up->down
            }
        }   
        Rep(k,2) Rep(j,m) {
            if (f[k][j] &&S.getfather(P(k,j))==P(k,j) ) {
                if (now!=k) ++ans;
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}