二进制运算的特点是不进位,我们从高位向下确认,每一位是填1还是0,从而构造出这个数
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1000100;
typedef pair<string,int> PSI;
int n,m;
#define x first
#define y second
PSI w[N];
int calc(int bit,int now)
{
for(int i=1;i<=n;i++)
{
int t =w[i].y>>bit&1;
if(w[i].x=="AND") now&=t;
else if(w[i].x=="OR") now|=t;
else now^=t;
}
return now;
}
int main(void)
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >>m;
for(int i=1;i<=n;i++)
{
string op;int k;
cin >> op >> k;
w[i] = make_pair(op,k);
}
int val =0,ans=0;
for(int bit=30;~bit;bit--)
{
int res0 = calc(bit,0);
int res1 = calc(bit,1);
if(val+(1<<bit)<=m&&res0<res1)
{
val += 1<<bit;
ans+= res1<<bit;
}
else ans += res0<<bit;
}
cout << ans << endl;
return 0;
}