Bits and Pieces 模拟

来源：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=11215#problem/A

题意：有两个数a和b，现在已知这两个数按位与的结果是c，按位或的结果是d，给你c和d的值，让求a和b的值，使得b-a的值最小。

思路：因为c的按位与的结果，所以c的为1位，a和b的该位都为1，d是按位或的结果，所以d的为0位，a和b的该位都是0。根据这两个条件，可以确定一些位，然后因为目的使b - a的值最小，所以除了最后一个1，其他的1都给a，这样就可以保证结果最小。

代码：

#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;

#define CLR(arr,val) memset(arr,val,sizeof(arr))
typedef long long LL;
const int N = 35;
int numx[N],numy[N],num3[N],cntx,cnty,ans1[N],ans2[N];
int flag1[N],flag2[N];
void fun(LL x,int num[N],int &cnt){
	while(x){
	  int y = x%2;
	  num[cnt++] = y;
	  x /= 2;
	}
	return;
}
LL mi(int x){
	LL s = 1;
	for(int i = 0;i < x; ++i)
		s *= 2;
	return s;
}
LL fun2(int num[N],int x){
	LL s = 0;
	for(int i = 0; i < x; ++i){
	  s  = s + num[i] * mi(i);
	}
	return s;
}
int main(){
	//freopen("1.txt","r",stdin);
	int numcase;
	scanf("%d",&numcase);
	while(numcase--){
	  LL x,y;
	  scanf("%lld%lld",&x,&y);
	  //printf("%d %d\n",y|(x&y),x&y);
	  CLR(numx,0);
	  CLR(numy,0);
	  CLR(ans1,0);
	  CLR(ans2,0);
	  CLR(flag1,0);
	  CLR(flag2,0);
	  cntx = 0;
	  cnty = 0;
	  fun(x,numx,cntx);
	  fun(y,numy,cnty);
	  for(int i = 0; i < cntx; ++i){
		  if(numx[i] == 1 ){
		    ans1[i] = 1;
			ans2[i] = 1;
			flag1[i] = 1;
			flag2[i] = 1;
		  }
	  }
	  bool isok = false;
	  for(int i = 0;i < cntx; ++i){
		  if(numx[i] == 1 && ! numy[i]){
		    isok = true;
			break;
		  }
	  }
	  for(int i = 0; i < cnty; ++i){
		  if(!numy[i]){
			  if(flag1[i] || flag2[i]){
			    isok = true;
				break;
			  }
		    ans1[i] = 0;
			ans2[i] = 0;
		  }
	  }
	  if(isok){
	    printf("-1\n");
		continue;
	  }
	  int sum = 0;
	  for(int i = 0; i < cnty; ++i){
		  if(flag1[i] && flag2[i])
			  continue;
		  if(numy[i] ){
		    sum++;
		  }
	  }
	  int cc = 0;
	  for(int i = 0; i < cnty; ++i){
		  if(flag1[i] && flag2[i])
			  continue;
		  if(numy[i]){
		     cc++;
			 if(cc == sum){
			   ans2[i] = 1;
			   ans1[i] = 0;
			 }
			 else{
			   ans2[i] = 0;
			   ans1[i] = 1;
			 }
		  }
	  }
	  //for(int i = 0; i < cnty; ++i)
		 // printf("%d ",ans2[i]);
	  //printf("\n");
	  LL mmax = fun2(ans2,cnty);
	  LL mmin = fun2(ans1,cnty);
	  LL mm = max(mmax,mmin);
	  LL ii = min(mmax,mmin);
	  printf("%lld %lld\n",ii,mm);
	}
	return 0;
}