2018 百度之星程序设计大赛 复赛（hdu 6409 6410 6411）

比赛题目链接

A题：

#include
#include
#include
#include
#include
#include
#include
#include
#include

B题：

#include
#include
#include
#include
#include
#include
#include
#include
#include

C题：

#include

#define INF 0x3f3f3f3f
const int  maxn =100000+5;
const int  mod =1e9+7;
#define ll long long int
using namespace std;

vector v[maxn];
int b[maxn];
int a[maxn];

int find(int x)
{
    return b[x] == x ? x : b[x] = find(b[x]);
}
void unio(int x, int y)
{
    b[find(y)] = find(x);
}
int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int n, m;ll ans = 0;
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; i++)
            scanf("%d", &a[i]), b[i] = i;
        for (int i = 1; i <= m; i++)
        {
            int u, v;
            scanf("%d%d", &u, &v);
            unio(u, v);
        }
        for (int i = 1; i <= n; i++)
            v[i].clear();
        for (int i = 1; i <= n; i++)
            v[find(i)].push_back(a[i]);
        for (int i = 1; i <= n; i++)
        {
            sort(v[i].begin(), v[i].end());
            ll e[35] = { 0 };
            for (int j = 0; j < v[i].size(); j++)
            {
                int t = v[i][j];
                for (int k = 0; k < 32 && t; k++)
                {
                    if (t & 1)
                        e[k]++;
                    t >>= 1;
                }
            }
            for (int j = v[i].size() - 1; j > 0; j--)
            {
                int t = v[i][j];
                for (int k = 0; k < 32 && t; k++)
                {
                    if (t & 1)
                    {
                        e[k]--;
                        ans=(ans+(1ll<>= 1;
                }
            }
        }
        cout<