This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<string>
using namespace std;
#include<map>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
#define all(x) x.begin(),x.end()
string str;
int n;
vector<int> vc;
string its(int a, int l) {
string res = "";
for (int i = 0; i < l; i++) {
if ((a % 3) == 2) res += '?';
else res += '0' + a % 3;
a /= 3;
}
reverse(all(res));
return res;
}
int sti(string s) {
int res = 0;
for (int i = 0; i < n; i++) {
res <<= 1;
res += s[i] - '0';
}
return res;
}
int st3(string s) {
int res = 0;
for (int i = 0; i < n; i++) {
res *= 3;
if (s[i] == '?') res += 2;
else res += s[i] - '0';
}
return res;
}
void init(int N, int Q, string S) {
n = N;
str = S;
int z = 1; for (int i = 0; i < n; i++) z *= 3;
vc.resize(z);
for (int i = 0; i < z; i++) {
string s = its(i, n);
int ind = -1;
for (int j = 0; j < n; j++) if (s[j] == '?') ind = j;
if (ind == -1) vc[i] = str[sti(s)]-'0';
else {
int u = 0;
s[ind] = '0';
u = vc[st3(s)];
s[ind] = '1';
u += vc[st3(s)];
vc[i] = u;
}
//cout << i << ' ' << s << ' ' << mp[s] << endl;
}
}
int query(string A) {
return vc[st3(A)];
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int N, Q; cin >> N >> Q;
string S; cin >> S;
init(N, Q, move(S));
for (int i = 0; i < Q; i++) {
string A;
cin >> A;
cout << query(move(A)) << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |