数字查询

解法：

预处理两个桶

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
#define endl '\n'

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int n, m, k;
	cin >> n >> m;
	string s;
	cin >> s;
	vector<int> a0, b1;
	int a = 1, b = 1;
	for (int i = 0; i < n; i++) {
		if (s[i] == '0') a0.push_back(i);
		else if (s[i] == '1') b1.push_back(i);
	}
	char c;
	while (m--) {
		cin >> c >> k;
		if (c == '0') {
			if (k <= a0.size()) cout << a0[k-1] << endl;
			else cout << -1 << endl;
		}
		else {
			if (k <= b1.size()) cout << b1[k-1] << endl;
			else cout << -1 << endl;
		}
	}
	return 0;
}