状态分组+并查集统计

https://ac.nowcoder.com/acm/contest/100253/D

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
using ll = long long;
using pii = pair<int, int>;
const double PI = acos(-1);
const int N =1e5+10;
const int mod = 1e9 + 7;
int f[N];
int num[N];
int find(int x){
	if(f[x]==x) return f[x];
	else return f[x]=find(f[x]);
}
void merge(int x,int y){
	int fx=find(x);
	int fy=find(y);
	if(f[fx]!=f[fy]){
		f[fx]=fy;
		num[fy]+=num[fx];
	}
}
void solve(){
	int n;cin>>n;
	for(int i=1;i<=n;i++){
		f[i]=i;
		num[i]=1;
	}
	for(int i=n+1;i<=n+63;i++){
		f[i]=i;
		num[i]=0;
	}
	for(int i=1;i<=n;i++){
		ll w;cin>>w;
		int cnt=1;
		while(w){
			if(w&1){
				merge(i,n+cnt);
			}
			w>>=1;
			cnt++;
		}
	}
	int ma=0;
	for(int i=1;i<=n+63;i++){
		if(find(i)==i){
			ma=max(ma,num[i]);
		}
	}
	cout<<ma<<endl;
}
int main() {
	
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	
	int T = 1;
	cin>>T;
	while (T--) {
		solve();
	}
	
	return 0;
}