2022.2.2 训练日记1 AcWing 998. 起床困难综合症

题目链接：起床困难综合征

---

题目分析：

0.知识点：位运算
1.思路参考蓝书第八页。

---

code:

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

typedef pair<string, int> PII;

const int N = 100010;
PII str[N];
int n, m;
int calc(int bits, int now)
{
    for(int i = 1; i <= n; i ++)
    {
        int x = str[i].second >> bits & 1;//把第bits位取出来
        if(str[i].first == "AND") now &= x;
        else if(str[i].first == "OR") now |= x;
        else now ^= x;
    }
    return now;
}
int main()
{
    
    cin >> n >> m;
    //存储每扇门的信息。
    for(int i = 1; i <= n; i ++)
    {
        string a;
        int op;
        cin >> a >> op;
        str[i] = {a, op};
    }
    int val = 0, ans = 0;//val更新当前的值，ans存储当前答案。
    for(int bits = 29; bits >= 0; bits --)
    {
        int res0 = calc(bits, 0);
        int res1 = calc(bits, 1);
        if(val + (1 << bits) <= m && res0 < res1)
            val += (1 << bits), ans += res1 << bits;
        else ans += res0 << bits;
    }
    
    cout << ans;
    return 0;
}

---

总结：

1.如果要取第k位，int x = str  >>  k & 1;