제출 #287554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287554		Leonardo_Paes	Snake Escaping (JOI18_snake_escaping)	C++17	0 / 100	703 ms	65540 KiB

snake_escaping

#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
• Subtask 2: 0 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 53
• Subtask 5: 0 / 25