Submission #255690

#	Time	Username	Problem	Language	Result	Execution time	Memory
255690		egekabas	Snake Escaping (JOI18_snake_escaping)	C++14	12 / 100	2085 ms	65540 KiB

snake_escaping

#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<ll, ll>  pii;
typedef pair<ld, ld>  pld;
ll l, q;
string s;
ll a = 10, b = 5;
ll sum[(1<<13)+10][(1<<8)+10];
ll p3[30];
unordered_map<ll, ll> dp[(1<<13)+10];
ll v2;
ll n;
ll calc(ll step, ll idx, ll val){
    if(dp[idx][val] != 0){ 
        return dp[idx][val]-1;
    }
    if(idx >= (1<<a)){
        //cout << s << '\n' << idx << '\n';
        dp[idx][val] = sum[idx-(1<<a)][v2]+1;
        return dp[idx][val]-1;
    }
    dp[idx][val] = 1;
    ll curval = (val%(p3[step+1]))/p3[step];
    //cout << step << ' ' << curval << '\n';
    if(curval != 1)
        dp[idx][val] += calc(step-1, idx*2, val-curval*p3[step]);
    if(curval != 0)
        dp[idx][val] += calc(step-1, idx*2+1, val-curval*p3[step]);
    
    return dp[idx][val]-1;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    p3[0] = 1;
    for(ll i = 1; i < 30; ++i)
        p3[i] = 3*p3[i-1];
    cin >> l >> q;
    a = min(a, l);
    b = l-a;
    n = (1<<l);
    cin >> s;
    ll cur = (1<<a);
    for(ll i = 0; i < n; ++i){
        ll v1 = cur;
        ++cur;
        if(cur == (1<<(a+1)))
            cur = (1<<a);
        for(ll bit = 0; bit < (1<<b); ++bit){
            ll idx = 0;
            ll val = (i>>a);
            for(ll j = 0; j < b; ++j){
                if((1<<j)&bit)
                    idx += p3[j]*(val%2);
                else
                    idx += p3[j]*2;
                val /= 2;
            }
            sum[v1-(1<<a)][idx] += s[i]-'0';
        }
    }
    for(ll i = 0; i < q; ++i){
        cin >> s;
        reverse(s.begin(), s.end());
        ll v1 = 0;
        for(ll i = 0; i < s.size(); ++i){
            if(s[i] == '1')
                v1 += p3[i];
            else if(s[i] == '?')
                v1 += 2*p3[i];
        }
        v2 = 0;
        for(ll i = a; i < a+b; ++i){
            if(i >= s.size())
                v2 += 2*p3[i-a];
            else if(s[i] == '1')
                v2 += p3[i-a];
            else if(s[i] == '?')
                v2 += 2*p3[i-a];
        }
        cout << calc(a-1, 1, v1) << '\n';
    }
} 

Compilation message (stderr)

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:77:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(ll i = 0; i < s.size(); ++i){
                       ~~^~~~~~~~~~
snake_escaping.cpp:85:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(i >= s.size())
                ~~^~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 53
• Subtask 5: 0 / 25