oj.uz

Submission #287554

# Submission time Handle Problem Language Result Execution time Memory
287554 2020-08-31T20:01:10 Z Leonardo_Paes Snake Escaping (JOI18_snake_escaping) C++17
0 / 100
 703 ms 65540 KB 
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
const int maxn = 13;
typedef pair<int,int> pii;
map<pii, int> dp;
int nxt[(1<<maxn) + 10];
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int l, q;
    cin >> l >> q;
    vector<int> v((1<<l));
    for(int i=0; i<(1<<l); i++){
        char a;
        cin >> a;
        v[i] = a - '0';
    }
    for(int i=1; i<(1<<l); i++) nxt[i] = (i&-i); // rightmost set bit tipo na BIT -> ok
    for(int a=(1<<l)-1; a>=0; a--){
        dp[{a, 0}] = v[a]; // caso base -> ok
        for(int b=1; b<(1<<l); b++){
            int x = nxt[b];
            dp[{a, b}] = dp[{a|x, b^x}] + dp[{a, b^x}]; // unicos dois casos -> ok
        }
    }
    while(q--){
        string s;
        cin >> s;
        int a = 0, b = 0;
        for(int i=0; i<l; i++){
            if(s[i] == '1') a += (1<<(l-i-1));
            if(s[i] == '?') b += (1<<(l-i-1));
        }
        cout << dp[{a, b}] << "\n";
    }
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 703 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 703 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 703 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Runtime error 703 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 703 ms 65540 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -