oj.uz

Submission #774326

# Submission time Handle Problem Language Result Execution time Memory
774326 2023-07-05T14:41:09 Z 1bin Snake Escaping (JOI18_snake_escaping) C++14
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(v) v.begin(), v.end()
typedef long long ll;
int n, q, a[1 << 20], S[1 << 20], T[1 << 20], cnt[2], ans, p;
string s;

void f(int i, int op, int st){
    if(i == n){
        if(!op) ans += a[st];
        else if(op == 1){
            if(p & 1) ans -= S[st];
            else ans += S[st];
        }
        else{
            if(p & 1) ans -= T[st];
            else ans += T[st];
        }
        return;
    }
    if(!op){
        if(s[i] == '?') {
            f(i + 1, op, st);
            f(i + 1, op, st | 1 << i);
        }
        else {
            if(s[i] == '1') st |= 1 << i;
            f(i + 1, op, st);
        }
    }
    else if(op == 1){
        if(s[i] == '1'){
            f(i + 1, op, st | 1 << i);
            p++;
            f(i + 1, op, st);
            p--;
        }
        else{
            if(s[i] == '?') st |= 1 << i;
            f(i + 1, op, st);
        }
    }
    else{
        if(S[i] == '0'){
            f(i + 1, op, st);
            p++;
            f(i + 1, op, st | 1 << i);
            p--;
        }
        else{
            if(s[i] == '1') st |= 1 << i;
            f(i + 1, op, st);
        }
    }
    return;
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> q >> s;
    for(int i = 0; i < 1 << n; i++) {
        a[i] = s[i] - '0';
        S[i] = a[i]; T[(1 << n) - 1 - i] = a[i];
    }
    for(int i = 0; i < n; i++)
        for(int mask = 0; mask < 1 << n; mask++) {
            if(mask & (1 << i)) S[mask] += S[mask ^ (1 << i)];
            if(!(mask & (1 << i))) T[mask] += T[mask ^ (1 << i)];
        }
    while(q--){
        cin >> s;
        reverse(all(s));
        cnt[0] = cnt[1] = 0;
        for(int i = 0; i < n; i++){
            if(s[i] == '?') cnt[0]++;
            else if(s[i] == '0') cnt[1]++;
        }
        ans = 0;
        if(cnt[0] <= n / 3) f(0, 0, 0);
        else if(cnt[1] <= n / 3) f(0, 1, 0);
        else f(0, 2, 0);
        cout << ans << '\n';
    }
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -