隐匿社交网络

// 用例不通过。实在看不出问题在哪
#include <iostream>
#include <vector>
using namespace std;


void calConnected(const vector<long long>& data, vector<vector<bool>>& connected)
{
    int n=data.size();
    connected.resize(n, vector<bool>(n, false));

    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            connected[i][j] = data[i]&data[j];
        }
    }
}

long long getAccountNum(vector<long long>& w, int x, vector<vector<bool>>& connected)
{
    long long account_num = 1;
    for(int i=0; i<w.size(); i++)
    {
        if(i!=x && connected[i][x])
            account_num++;
    }
    return account_num;
}


long long getMaxAccountNum(vector<long long>& w, vector<vector<bool>>& connected)
{
    int n = w.size();
    // vector<bool> visited(n, false);
    long long max_account_num = 0;
    for(int i=0; i<w.size(); i++)
    {
        // int cur_account_num = getAccountNum(w, i, connected);
        max_account_num = max(max_account_num, getAccountNum(w, i, connected));
    }
    return max_account_num;
}


int main() {
    int T;
    cin>>T;
    while(T--)
    {
        int n;
        cin>>n;
        vector<long long> weight(n);
        for(long long& x:weight)
            cin>>x;

        //题目的空间限制很宽泛。这里预处理任意两个账号的权重
        vector<vector<bool>> connected;
        calConnected(weight, connected);

        long long max_account_num = getMaxAccountNum(weight, connected);
        cout<<max_account_num<<endl;
    }
    
    return 0;
}
// 64 位输出请用 printf("%lld")