ZOJ3870:Team Formation(浙江省赛2015)

最新推荐文章于 2020-10-14 22:20:53 发布

原创最新推荐文章于 2020-10-14 22:20:53 发布 · 2.9k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#ZOJ

水专栏收录该内容

330 篇文章

订阅专栏

本文介绍了一种算法问题，即从N个学生中选择两名成员组成团队，使得两人的技能水平通过异或运算得到的结果大于各自技能水平。文章提供了一个有效的解决方案，并附带了完整的C++代码实现。

The 12th Zhejiang Provincial Collegiate Programming Contest

For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students of his university.

Edward knows the skill level of each student. He has found that if two students with skill level A and B form a team, the skill level of the team will be A ⊕ B, where ⊕ means bitwise exclusive or. A team will play well if and only if the skill level of the team is greater than the skill level of each team member (i.e. A ⊕ B > max{A, B}).

Edward wants to form a team that will play well in the contest. Please tell him the possible number of such teams. Two teams are considered different if there is at least one different team member.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains an integer N (2 <= N <= 100000), which indicates the number of student. The next line contains N positive integers separated by spaces. The i^th integer denotes the skill level of i^th student. Every integer will not exceed 10⁹.

Output

For each case, print the answer in one line.

Sample Input

Sample Output

1
6

题意：任选两个数，异或大于他们两个数

思路：对于一个数字的二进制形式，我们与比它小的比较，如果对应位互异，那么肯定是可行的

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
#define ls 2*i
#define rs 2*i+1
#define up(i,x,y) for(i=x;i<=y;i++)
#define down(i,x,y) for(i=x;i>=y;i--)
#define mem(a,x) memset(a,x,sizeof(a))
#define w(a) while(a)
#define LL long long
const double pi = acos(-1.0);
#define Len 20005
#define mod 19999997
const int INF = 0x3f3f3f3f;

int t,n,a[100005],bit[100];

int main()
{
    int i,j,k;
    scanf("%d",&t);
    w(t--)
    {
        mem(bit,0);
        scanf("%d",&n);
        up(i,0,n-1)
        {
            scanf("%d",&a[i]);
            for(j = 31;j>=0;j--)
            {
                if(a[i]&(1<<j))
                {
                    bit[j]++;
                    break;
                }
            }
        }
        LL ans = 0;
        up(i,0,n-1)
        {
            if(a[i])
            {
                int l = 31;
                w(1)
                {
                    if(a[i]&(1<<l)) break;
                    l--;
                }
                w(l>=0)
                {
                    if(!(a[i]&(1<<l))) ans+=bit[l];
                    l--;
                }
            }
        }
        printf("%lld\n",ans);
    }

    return 0;
}