传送门:www.lydsy.com:808/JudgeOnline/problem.php?id=3668
乱搞题,枚举每一位就可以A了,居然谢了1.5h,弱……
Code:
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1e5+10;
int n,m;
unsigned int ans=0;
int op[maxn],t[maxn],Bit;
int bans[32],rbans[32],zeroto[32],oneto[32];
unsigned int inm=0;
//1 AND 2 OR 3 XOR
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
char opt[4];scanf("%s%d",opt,&t[i]);
if(opt[0]=='A')op[i]=1;
if(opt[0]=='O')op[i]=2;
if(opt[0]=='X')op[i]=3;
}
Bit=31;
long long test=0;
for(int j=1;j<=n;j++){
if(op[j]==1)test&=t[j];
if(op[j]==2)test|=t[j];
if(op[j]==3)test^=t[j];
}
for(int i=0;i<=Bit;i++)
zeroto[i]=test>>i&1;
test=4294967295LL;
for(int j=1;j<=n;j++){
if(op[j]==1)test&=t[j];
if(op[j]==2)test|=t[j];
if(op[j]==3)test^=t[j];
}
for(int i=0;i<=Bit;i++)
oneto[i]=test>>i&1;
for(int i=Bit;i>=0;i--){
if(oneto[i]&&zeroto[i]){
ans|=1<<i;
}else
if(!oneto[i]&&zeroto[i]){
ans|=1<<i;
}else
if(oneto[i]&&!zeroto[i]){
if((inm|(1<<i))<=m){
inm|=(1<<i);
ans|=1<<i;
}
}
}
cout<<ans<<endl;
return 0;
}