이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define bp __builtin_popcountll
#define pb push_back
#define in(s) freopen(s, "r", stdin);
#define out(s) freopen(s, "w", stdout);
#define inout(s, end1, end2) freopen((string(s) + "." + end1).c_str(), "r", stdin),\
freopen((string(s) + "." + end2).c_str(), "w", stdout);
#define fi first
#define se second
#define bw(i, r, l) for (int i = r - 1; i >= l; i--)
#define fw(i, l, r) for (int i = l; i < r; i++)
#define fa(i, x) for (auto i: x)
using namespace std;
const int mod = 1e9 + 7, inf = 1061109567;
const long long infll = 4557430888798830399;
const int L = (1 << 20) + 5;
int l, q, cost[L], defMask = 0, sumSubset[L], sumSubsetOf[L];
int getMask(vector<int> &pos, int replaceMask) {
int ansMask = defMask;
fw (i, 0, pos.size()) {
int bitID = pos[i];
int bit = ((replaceMask >> i) & 1);
ansMask |= (bit << bitID);
}
return ansMask;
}
signed main() {
#ifdef BLU
in("blu.inp");
#endif
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> l >> q;
fw (i, 0, (1 << l)) {
char c;
cin >> c;
cost[i] = c - '0';
}
//sumSubset[i] stores sum of costs of j that j & i = j.
fw (i, 0, (1 << l)) sumSubset[i] = cost[i];
fw (i, 0, l) fw (mask, 0, (1 << l)) {
if (mask & (1 << i)) sumSubset[mask] += sumSubset[mask ^ (1 << i)];
}
//sumSubsetOf[i] stores sum of costs of j that j & i = i
fw (i, 0, (1 << l)) sumSubsetOf[i] = cost[i];
fw (i, 0, l) bw (mask, (1 << l), 0) {
if (!(mask & (1 << i))) sumSubsetOf[mask] += sumSubsetOf[mask | (1 << i)];
}
while (q--) {
string t;
cin >> t;
reverse(t.begin(), t.end());
int cnt0 = 0, cnt1 = 1, cntQ = 0;
fw (i, 0, t.length()) {
if (t[i] == '0') cnt0++;
else if (t[i] == '1') cnt1++;
else cntQ++;
}
//At least one of these is <= 6. Iterate over them.
int ans = 0;
defMask = 0;
vector<int> pos; pos.clear();
if (cntQ <= 6) {
fw (i, 0, t.length()) {
if (t[i] == '?') pos.pb(i);
else defMask |= ((t[i] - '0') << i);
}
fw (replacementMask, 0, (1 << cntQ)) {
int mask = getMask(pos, replacementMask);
ans += cost[mask];
}
} else if (cnt0 <= 6) {
fw (i, 0, t.length()) {
if (t[i] == '0') pos.pb(i);
else {
if (t[i] == '1') defMask |= (1 << i);
}
}
fw (replacementMask, 0, (1 << cnt0)) {
int mask = getMask(pos, replacementMask);
if (bp(replacementMask) % 2 == 0) {
ans += sumSubsetOf[mask];
} else ans -= sumSubsetOf[mask];
}
} else if (cnt1 <= 6) {
fw (i, 0, t.length()) {
if (t[i] == '1') pos.pb(i);
else {
if (t[i] == '?') defMask |= (1 << i);
}
}
fw (replacementMask, 0, (1 << cnt1)) {
int mask = getMask(pos, replacementMask);
if ((cnt1 - bp(replacementMask)) % 2 == 0) {
ans += sumSubset[mask];
} else ans -= sumSubset[mask];
}
}
cout << ans << "\n";
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
snake_escaping.cpp: In function 'int getMask(std::vector<int>&, int)':
snake_escaping.cpp:11:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define fw(i, l, r) for (int i = l; i < r; i++)
snake_escaping.cpp:20:6:
fw (i, 0, pos.size()) {
~~~~~~~~~~~~~~~~
snake_escaping.cpp:20:2: note: in expansion of macro 'fw'
fw (i, 0, pos.size()) {
^~
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:11:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define fw(i, l, r) for (int i = l; i < r; i++)
snake_escaping.cpp:53:7:
fw (i, 0, t.length()) {
~~~~~~~~~~~~~~~~
snake_escaping.cpp:53:3: note: in expansion of macro 'fw'
fw (i, 0, t.length()) {
^~
snake_escaping.cpp:11:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define fw(i, l, r) for (int i = l; i < r; i++)
snake_escaping.cpp:63:8:
fw (i, 0, t.length()) {
~~~~~~~~~~~~~~~~
snake_escaping.cpp:63:4: note: in expansion of macro 'fw'
fw (i, 0, t.length()) {
^~
snake_escaping.cpp:11:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define fw(i, l, r) for (int i = l; i < r; i++)
snake_escaping.cpp:72:8:
fw (i, 0, t.length()) {
~~~~~~~~~~~~~~~~
snake_escaping.cpp:72:4: note: in expansion of macro 'fw'
fw (i, 0, t.length()) {
^~
snake_escaping.cpp:11:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define fw(i, l, r) for (int i = l; i < r; i++)
snake_escaping.cpp:85:8:
fw (i, 0, t.length()) {
~~~~~~~~~~~~~~~~
snake_escaping.cpp:85:4: note: in expansion of macro 'fw'
fw (i, 0, t.length()) {
^~
# | 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... |