【链接】
bzoj3668
【解题报告】
我们可以把初始的攻击力转化为二进制数,最后的答案就是所对应二进制每位进行所有操作后只能是0或1。所以我们只需要判断开始时攻击力所对应的每位是0优还是1优。
#include<cstdio>
using namespace std;
int n,m,ans,now,sum,tot;
inline char nc()
{
static char buf[100000],*l,*r;
if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
if (l==r) return EOF; return *l++;
}
inline int Read()
{
int res=0,f=1; char ch=nc(),cc=ch;
while (ch<'0'||ch>'9') cc=ch,ch=nc();
if (cc=='-') f=-1;
while (ch>='0'&&ch<='9') res=res*10+ch-48,ch=nc();
return res*f;
}
int main()
{
freopen("3668.in","r",stdin);
freopen("3668.out","w",stdout);
n=Read(); m=Read(); sum=now=ans=0; tot=(1<<30)-1;
for (int i=1; i<=n; i++)
{
char ch=nc();
while (ch!='A'&&ch!='O'&&ch!='X') ch=nc();
int x=Read();
if (ch=='A') sum&=x,tot&=x;
if (ch=='O') sum|=x,tot|=x;
if (ch=='X') sum^=x,tot^=x;
}
for (int j=30; j>=0; j--)
if (sum&(1<<j)) ans+=1<<j;
else if (tot&(1<<j)&&now+(1<<j)<=m) now+=1<<j,ans+=1<<j;
printf("%d",ans);
return 0;
}