1.题目描述:点击打开链接
2.解题思路:将输入的查询看做二进制串,转化为十进制得到叶子节点的序号,存储每个叶子节点的值即可
3.代码:
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<string>
#include<sstream>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<cassert>
#include<cstdlib>
#include<cstdio>
#include<ctime>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;
const int maxn = 7 + 3;
int a[1 << maxn];
string buf[maxn];
vector<int>ans;
int n, m;
int cnt = 0;
string sr;
void solve()
{
int loc = 0;
int arr[maxn];
for (int i = 0; i < cnt; i++)
arr[i] = buf[i][1] - '0'-1;
for (