Submission #64563

#TimeUsernameProblemLanguageResultExecution timeMemory
64563keko37Snake Escaping (JOI18_snake_escaping)C++14
58 / 100
2049 ms17580 KiB
#include<iostream> using namespace std; const int MAXN = 21; int n, q; char l[MAXN]; int val[1<<MAXN], sum0[1<<MAXN], sum1[1<<MAXN], pc[1<<MAXN]; void precompute () { for (int i=0; i<(1<<n); i++) { pc[i] = __builtin_popcount(i); sum0[i] = val[i]; sum1[i] = val[i ^ ((1<<n) - 1)]; } for (int i=0; i<n; i++) { for (int j=0; j<(1<<n); j++) { if (j & (1<<i)) sum0[j] += sum0[j ^ (1<<i)]; if (j & (1<<i)) sum1[j] += sum1[j ^ (1<<i)]; } } } void ispis (int x) { for (int i=n-1; i>=0; i--) { cout << (bool) (x & (1<<i)); } cout << endl; } int main () { std::ios::sync_with_stdio(false); cin >> n >> q; for (int i=0; i<(1<<n); i++) { char c; cin >> c; val[i] = c - '0'; } precompute(); for (int tc=0; tc<q; tc++) { int a = 0, b = 0, c = 0; for (int i=0; i<n; i++) { cin >> l[i]; if (l[i] == '?') { a ^= (1<<(n-1-i)); } else if (l[i] == '0') { b ^= (1<<(n-1-i)); } else { c ^= (1<<(n-1-i)); } } int sol = 0, mask = 0, cnt = 0; if (pc[a] <= n/3) { do { cnt++; sol += val[mask | c]; } while (mask = (mask-a) & a); } else if (pc[b] <= n/3) { do { cnt++; if (pc[mask | a] & 1) { sol -= sum1[mask | a]; } else { sol += sum1[mask | a]; } } while (mask = (mask-b) & b); if (sol < 0) sol = -sol; } else { do { cnt++; if (pc[mask | a] & 1) { sol -= sum0[mask | a]; } else { sol += sum0[mask | a]; } } while (mask = (mask-c) & c); if (sol < 0) sol = -sol; } cout << sol << "\n"; } return 0; }

Compilation message (stderr)

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:58:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-a) & a);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:67:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-b) & b);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:77:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-c) & c);
             ~~~~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...