[NOI2014]起床困难综合症

#include <bits/stdc++.h>
using namespace std;
#define N 200000
char c[10];
int x[N],y[N],n,m;
int js(int x1,int x2)
{
  for (int i=1;i<=n;i++)
  {
    int tmp1=(y[i]>>(x2-1))&1;
    if (x[i]==1) x1=x1&tmp1;
    if (x[i]==2) x1=x1|tmp1;
    if (x[i]==3) x1=x1^tmp1;
  }
  return(x1);
}
int main()
{
  freopen("noi.in","r",stdin);
  freopen("noi.out","w",stdout);
  //std::ios::sync_with_stdio(false);
  cin>>n>>m;
  for (int i=1;i<=n;i++)
  {
    cin>>c;
    if (c[0]==‘A‘) x[i]=1;
    if (c[0]==‘O‘) x[i]=2;
    if (c[0]==‘X‘) x[i]=3;
    cin>>y[i];
  }
  int ans=0,now;
  for (int i=30;i;i--)
  {
    int a=js(1,i);
    int b=js(0,i);
    if (b==1)
    {
      ans+=(1<<(i-1));
    } else
    if (a==1&&now+(1<<(i-1))<=m)
    {
      ans+=(1<<(i-1));
      now+=(1<<(i-1));
    }
  }
  cout<<ans;
  return 0;  
}