#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef unsigned long long ull;
const int maxn=50005;
struct Bitset
{
ull bit[1565];//开两倍的空间,50000/64*2
void reset()
{
memset(bit,0,sizeof(bit));
}
void flip(int pos)
{
bit[pos>>6]^=(ull)1<<(pos&63);
}
bool judge(int pos)
{
return bit[pos>>6]&((ull)1<<(pos&63));
}
}a,ans;
int b[maxn];
ull pre[64];
void init()
{
pre[0]=1;
for(int i=1;i<64;i++)
pre[i]=pre[i-1]|((ull)1<<i);
}
int main()
{
int t,n,m,q,i,j,mx;
init();
scanf("%d",&t);
while(t--&&scanf("%d%d%d",&n,&m,&q)!=EOF)
{
a.reset();
ans.reset();
mx=0;
for(i=0;i<n;i++)
{
int tp
hdu6085 手写bitset
最新推荐文章于 2019-06-29 20:52:00 发布