L1-071 previous life files (20 points) (similar two points)

Portal

Title Description ：

Ideas ：   As before, I might be silly to think about how to realize binary tree … Maybe it's a little mature now , It can be seen that this is actually a water problem similar to the dichotomy principle . First, you can know the total number of conclusions , Every time "y" and "n" The choice of is like the operation of cutting half and half , So just a simple simulation ！

AC Code ：

#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int N = 1e5+10;

int n, m, sum;
string s;

signed main()
{
    cin >> n >> m;
    sum = pow(2, n);
//    cout << "sum: " << sum << endl;
    while(m --){
        cin >> s;
        int l = 1, r = sum;
        for(int i = 0; i < n; i ++){
            int mid = (l+r)/2;
            if(s[i]=='y') r = mid-1;
            else l = mid+1;
        }
        cout << l << endl;
    }

    return 0;
}