oj.uz

답안 #255660

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255660 2020-08-01T13:41:49 Z egekabas Snake Escaping (JOI18_snake_escaping) C++14
12 / 100
 1026 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;
            }
            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 < s.size(); ++i){
            if(s[i] == '1')
                v2 += p3[i-a];
            else if(s[i] == '?')
                v2 += 2*p3[i-a];
        }
        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:71:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(ll i = 0; i < s.size(); ++i){
                       ~~^~~~~~~~~~
snake_escaping.cpp:78:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(ll i = a; i < s.size(); ++i){
                       ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11520 KB Output is correct
2 Correct 10 ms 11648 KB Output is correct
3 Correct 11 ms 11904 KB Output is correct
4 Correct 12 ms 11904 KB Output is correct
5 Correct 19 ms 12416 KB Output is correct
6 Correct 15 ms 12288 KB Output is correct
7 Correct 19 ms 12288 KB Output is correct
8 Correct 9 ms 11264 KB Output is correct
9 Correct 11 ms 11392 KB Output is correct
10 Correct 9 ms 11648 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11520 KB Output is correct
2 Correct 10 ms 11648 KB Output is correct
3 Correct 11 ms 11904 KB Output is correct
4 Correct 12 ms 11904 KB Output is correct
5 Correct 19 ms 12416 KB Output is correct
6 Correct 15 ms 12288 KB Output is correct
7 Correct 19 ms 12288 KB Output is correct
8 Correct 9 ms 11264 KB Output is correct
9 Correct 11 ms 11392 KB Output is correct
10 Correct 9 ms 11648 KB Output is correct
11 Correct 247 ms 15480 KB Output is correct
12 Correct 287 ms 15472 KB Output is correct
13 Correct 310 ms 16396 KB Output is correct
14 Correct 332 ms 16376 KB Output is correct
15 Correct 330 ms 18064 KB Output is correct
16 Correct 344 ms 18492 KB Output is correct
17 Correct 476 ms 22664 KB Output is correct
18 Correct 220 ms 16888 KB Output is correct
19 Correct 253 ms 13896 KB Output is correct
20 Correct 272 ms 15736 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11520 KB Output is correct
2 Correct 10 ms 11648 KB Output is correct
3 Correct 11 ms 11904 KB Output is correct
4 Correct 12 ms 11904 KB Output is correct
5 Correct 19 ms 12416 KB Output is correct
6 Correct 15 ms 12288 KB Output is correct
7 Correct 19 ms 12288 KB Output is correct
8 Correct 9 ms 11264 KB Output is correct
9 Correct 11 ms 11392 KB Output is correct
10 Correct 9 ms 11648 KB Output is correct
11 Correct 247 ms 15480 KB Output is correct
12 Correct 287 ms 15472 KB Output is correct
13 Correct 310 ms 16396 KB Output is correct
14 Correct 332 ms 16376 KB Output is correct
15 Correct 330 ms 18064 KB Output is correct
16 Correct 344 ms 18492 KB Output is correct
17 Correct 476 ms 22664 KB Output is correct
18 Correct 220 ms 16888 KB Output is correct
19 Correct 253 ms 13896 KB Output is correct
20 Correct 272 ms 15736 KB Output is correct
21 Incorrect 335 ms 18276 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11520 KB Output is correct
2 Correct 10 ms 11648 KB Output is correct
3 Correct 11 ms 11904 KB Output is correct
4 Correct 12 ms 11904 KB Output is correct
5 Correct 19 ms 12416 KB Output is correct
6 Correct 15 ms 12288 KB Output is correct
7 Correct 19 ms 12288 KB Output is correct
8 Correct 9 ms 11264 KB Output is correct
9 Correct 11 ms 11392 KB Output is correct
10 Correct 9 ms 11648 KB Output is correct
11 Runtime error 1026 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

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 11520 KB Output is correct
2 Correct 10 ms 11648 KB Output is correct
3 Correct 11 ms 11904 KB Output is correct
4 Correct 12 ms 11904 KB Output is correct
5 Correct 19 ms 12416 KB Output is correct
6 Correct 15 ms 12288 KB Output is correct
7 Correct 19 ms 12288 KB Output is correct
8 Correct 9 ms 11264 KB Output is correct
9 Correct 11 ms 11392 KB Output is correct
10 Correct 9 ms 11648 KB Output is correct
11 Correct 247 ms 15480 KB Output is correct
12 Correct 287 ms 15472 KB Output is correct
13 Correct 310 ms 16396 KB Output is correct
14 Correct 332 ms 16376 KB Output is correct
15 Correct 330 ms 18064 KB Output is correct
16 Correct 344 ms 18492 KB Output is correct
17 Correct 476 ms 22664 KB Output is correct
18 Correct 220 ms 16888 KB Output is correct
19 Correct 253 ms 13896 KB Output is correct
20 Correct 272 ms 15736 KB Output is correct
21 Incorrect 335 ms 18276 KB Output isn't correct
22 Halted 0 ms 0 KB -