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 <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T>
bool chmax(T &a, T b) { return a < b ? (a = b, true) : false; }
template<class T>
bool chmin(T &a, T b) { return b < a ? (a = b, true) : false; }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U>
void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T>
void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 20;
int n, q;
char w[(1<<MAX_N) + 10], com[MAX_N << 1];
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> q >> w;
for (int i = 0;i < q;++i) {
cin >> com;
int l = 0, r = (1<<n) - 1, sub = 0;
reverse(com, com + n);
for (int i = 0;i < n;++i) {
if (com[i] == '0') r ^= 1<<i;
if (com[i] == '1') l ^= 1<<i;
if (com[i] == '?') sub |= 1<<i;
}
int res = 0;
for (int s = sub ; s ;(--s) &= sub) {
res += w[l | s] - '0';
}
res += w[l] - '0';
cout << res << '\n';
DE(com, res);
}
}
Compilation message (stderr)
snake_escaping.cpp: In function 'int32_t main()':
snake_escaping.cpp:18:17: warning: statement has no effect [-Wunused-value]
18 | #define DE(...) 0
| ^
snake_escaping.cpp:43:3: note: in expansion of macro 'DE'
43 | DE(com, res);
| ^~
# | 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... |