oj.uz

Submission #255664

# Submission time Handle Problem Language Result Execution time Memory
255664 2020-08-01T13:44:53 Z egekabas Snake Escaping (JOI18_snake_escaping) C++14
12 / 100
 1000 ms 65540 KB 
#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 = 9, b = 5;
ll sum[(1<<13)+10][(1<<7)+10];
ll p3[30];
unordered_map<ll, ll> dp[23][(1<<13)+10];
ll v2;
ll calc(ll step, ll idx, ll val){
    if(dp[step][idx][val] != 0){ 
        return dp[step][idx][val]-1;
    }
    if(step == a || step == s.size()){
        //cout << s << '\n' << idx << '\n';
        dp[step][idx][val] = sum[idx][v2]+1;
        return dp[step][idx][val]-1;
    }
    dp[step][idx][val] = 1;
    if(s[step] != '1')
        dp[step][idx][val] += calc(step+1, idx, val/3);
    if(s[step] != '0')
        dp[step][idx][val] += calc(step+1, idx+(1LL<<step), val/3);
    
    return dp[step][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;
    ll n = (1<<l);
    cin >> s;
    for(ll i = 0; i < n; ++i){
        ll v1 = (i&((1<<a)-1));
        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;
            }
            assert(idx >= 0);
            sum[v1][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];
        }
        assert(v2 >= 0);
        cout << calc(0, 0, v1) << '\n';
    }
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 11520 KB Output is correct
2 Correct 9 ms 11648 KB Output is correct
3 Correct 11 ms 11776 KB Output is correct
4 Correct 11 ms 11904 KB Output is correct
5 Correct 15 ms 12416 KB Output is correct
6 Correct 12 ms 12160 KB Output is correct
7 Correct 14 ms 12288 KB Output is correct
8 Correct 9 ms 11264 KB Output is correct
9 Correct 9 ms 11392 KB Output is correct
10 Correct 11 ms 11648 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 11520 KB Output is correct
2 Correct 9 ms 11648 KB Output is correct
3 Correct 11 ms 11776 KB Output is correct
4 Correct 11 ms 11904 KB Output is correct
5 Correct 15 ms 12416 KB Output is correct
6 Correct 12 ms 12160 KB Output is correct
7 Correct 14 ms 12288 KB Output is correct
8 Correct 9 ms 11264 KB Output is correct
9 Correct 9 ms 11392 KB Output is correct
10 Correct 11 ms 11648 KB Output is correct
11 Correct 256 ms 15584 KB Output is correct
12 Correct 275 ms 15352 KB Output is correct
13 Correct 300 ms 15992 KB Output is correct
14 Correct 298 ms 15992 KB Output is correct
15 Correct 284 ms 17528 KB Output is correct
16 Correct 349 ms 18040 KB Output is correct
17 Correct 437 ms 22280 KB Output is correct
18 Correct 205 ms 16504 KB Output is correct
19 Correct 250 ms 13560 KB Output is correct
20 Correct 285 ms 15352 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 11520 KB Output is correct
2 Correct 9 ms 11648 KB Output is correct
3 Correct 11 ms 11776 KB Output is correct
4 Correct 11 ms 11904 KB Output is correct
5 Correct 15 ms 12416 KB Output is correct
6 Correct 12 ms 12160 KB Output is correct
7 Correct 14 ms 12288 KB Output is correct
8 Correct 9 ms 11264 KB Output is correct
9 Correct 9 ms 11392 KB Output is correct
10 Correct 11 ms 11648 KB Output is correct
11 Correct 256 ms 15584 KB Output is correct
12 Correct 275 ms 15352 KB Output is correct
13 Correct 300 ms 15992 KB Output is correct
14 Correct 298 ms 15992 KB Output is correct
15 Correct 284 ms 17528 KB Output is correct
16 Correct 349 ms 18040 KB Output is correct
17 Correct 437 ms 22280 KB Output is correct
18 Correct 205 ms 16504 KB Output is correct
19 Correct 250 ms 13560 KB Output is correct
20 Correct 285 ms 15352 KB Output is correct
21 Incorrect 320 ms 17640 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 11520 KB Output is correct
2 Correct 9 ms 11648 KB Output is correct
3 Correct 11 ms 11776 KB Output is correct
4 Correct 11 ms 11904 KB Output is correct
5 Correct 15 ms 12416 KB Output is correct
6 Correct 12 ms 12160 KB Output is correct
7 Correct 14 ms 12288 KB Output is correct
8 Correct 9 ms 11264 KB Output is correct
9 Correct 9 ms 11392 KB Output is correct
10 Correct 11 ms 11648 KB Output is correct
11 Runtime error 1000 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 11520 KB Output is correct
2 Correct 9 ms 11648 KB Output is correct
3 Correct 11 ms 11776 KB Output is correct
4 Correct 11 ms 11904 KB Output is correct
5 Correct 15 ms 12416 KB Output is correct
6 Correct 12 ms 12160 KB Output is correct
7 Correct 14 ms 12288 KB Output is correct
8 Correct 9 ms 11264 KB Output is correct
9 Correct 9 ms 11392 KB Output is correct
10 Correct 11 ms 11648 KB Output is correct
11 Correct 256 ms 15584 KB Output is correct
12 Correct 275 ms 15352 KB Output is correct
13 Correct 300 ms 15992 KB Output is correct
14 Correct 298 ms 15992 KB Output is correct
15 Correct 284 ms 17528 KB Output is correct
16 Correct 349 ms 18040 KB Output is correct
17 Correct 437 ms 22280 KB Output is correct
18 Correct 205 ms 16504 KB Output is correct
19 Correct 250 ms 13560 KB Output is correct
20 Correct 285 ms 15352 KB Output is correct
21 Incorrect 320 ms 17640 KB Output isn't correct
22 Halted 0 ms 0 KB -