oj.uz

Submission #963537

# Submission time Handle Problem Language Result Execution time Memory
963537 2024-04-15T09:36:51 Z ksu2009en Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 644 ms 44844 KB 
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2")

#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>


using namespace std;
typedef int ll;

ll const half = 7;

#define endl '\n'

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    ll l, q;
    cin >> l >> q;
    
    string a;
    cin >> a;
    
    vector<ll> pw(max(half, l - half) + 2);
    pw[0] = 1;
    
    for(int i = 1; i < pw.size(); i++)
        pw[i] = pw[i - 1] * 3;
        
    vector<ll> dp, bit(pw[max(0, l - half)] + 1, -1), bin_to3((1ll << max(0, l - half)) + 1), from3_to_bin(pw[max(0, l - half)] + 1);
    
    for(int i = 0; i < (1 << max(0, l - half)); i++){
        ll cnt = 0;
        
        for(int j = max(0, l - half) - 1; j >= 0; j--){
            if((i >> j) & 1){
                cnt = (cnt + 1) * 3;
            }
            else
                cnt *= 3;
        }
        cnt /= 3;
        bin_to3[i] = cnt;
        from3_to_bin[cnt] = i;
        
    }
    
    for(int i = 0; i < pw[(max(0, l - half))]; i++){
        ll val = i;
        
        for(int j = 0; j < max(0, l - half); j++){
            if(val % 3 == 2){
                bit[i] = j;
                break;
            }
            
            val /= 3;
        }
    }
    
    vector<vector<bool>> sub(pw[half], vector<bool> ((1ll << half) + 1, true));
    
    for(int i = 0; i < pw[half]; i++){
        vector<ll> u;
        
        ll cur = pw[half];
        
        ll val = i;
        for(int i = half - 1; i >= 0; i--){
            cur /= 3;
            u.push_back(val / cur);
            val %= cur;
        }
        
        for(int j = 0; j < (1ll << half); j++){
            for(int k = 0; k < half; k++){
                if(u[u.size() - k - 1] == 2)
                    continue;
                
                if(u[u.size() - k - 1] != (j >> k) % 2){
                    sub[i][j] = false;
                    break;
                }
            }
        }
    }
    
    vector<pair<ll, ll>> quer;
    
    while(q--){
        string b;
        cin >> b;
        
        while(b.size() < l)
            b += "0";
        
        ll cnt = 0, pos = 0, c1 = 0;
        
        for(auto i: b){
            if(i == '0'){
                cnt *= 3;
            }
            else if(i == '1'){
                cnt = (cnt + 1) * 3;
            }
            else{
                cnt = (cnt + 2) * 3;
            }
            pos++;
            
            if(pos == half || (half > b.size() && pos == b.size()) ){
                c1 = cnt / 3;
            }
        }
        
        cnt /= 3;
        if(l > half){
            cnt %= pw[l - half];
        }
                
        quer.push_back({c1, cnt});
    }
        
    vector<ll> ans(quer.size());
    
    
    dp.resize(pw[max(0, l - half)] + 1);
    for(int i = 0; i < (1ll << min(half, l)); i++){
        if(l <= half){
            for(int j = 0; j < quer.size(); j++){
                if(sub[quer[j].first][i])
                    ans[j] += (a[i] - '0');
            }
            continue;
        }
        
        ll add = i * (1 << (l - half));
        for(int j = 0; j < pw[l - half]; j++){
            if(bit[j] == -1){
//                cout << j << ' ' << from3_to_bin[j] << ' ' << add << endl;
                dp[j] = (a[add + from3_to_bin[j]] - '0');
                continue;
            }
            
            dp[j] = 0;
            ll c1 = j - 2 * pw[bit[j]];
            dp[j] += dp[c1];
            
            c1 = j - pw[bit[j]];
            dp[j] += dp[c1];
        }
//
//        cout << i << endl;
//        for(int j = 0; j < pw[l - half]; j++)
//            cout << dp[j] << ' ';
//        cout << endl;
//
        for(int j = 0; j < quer.size(); j++){
            if(sub[quer[j].first][i]){
                
                ans[j] += dp[quer[j].second];
            }
        }
    }
    
    for(auto i: ans)
        cout << i << endl;
    
    return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:44:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i = 1; i < pw.size(); i++)
      |                    ~~^~~~~~~~~~~
snake_escaping.cpp:111:24: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'll' {aka 'int'} [-Wsign-compare]
  111 |         while(b.size() < l)
      |               ~~~~~~~~~^~~
snake_escaping.cpp:128:55: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |             if(pos == half || (half > b.size() && pos == b.size()) ){
      |                                                   ~~~~^~~~~~~~~~~
snake_escaping.cpp:147:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |             for(int j = 0; j < quer.size(); j++){
      |                            ~~^~~~~~~~~~~~~
snake_escaping.cpp:175:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  175 |         for(int j = 0; j < quer.size(); j++){
      |                        ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 419 ms 27060 KB Output is correct
12 Correct 537 ms 26800 KB Output is correct
13 Correct 409 ms 26212 KB Output is correct
14 Correct 448 ms 26148 KB Output is correct
15 Correct 573 ms 26964 KB Output is correct
16 Correct 483 ms 26248 KB Output is correct
17 Correct 466 ms 26176 KB Output is correct
18 Correct 279 ms 27980 KB Output is correct
19 Correct 276 ms 25012 KB Output is correct
20 Correct 492 ms 26800 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 419 ms 27060 KB Output is correct
12 Correct 537 ms 26800 KB Output is correct
13 Correct 409 ms 26212 KB Output is correct
14 Correct 448 ms 26148 KB Output is correct
15 Correct 573 ms 26964 KB Output is correct
16 Correct 483 ms 26248 KB Output is correct
17 Correct 466 ms 26176 KB Output is correct
18 Correct 279 ms 27980 KB Output is correct
19 Correct 276 ms 25012 KB Output is correct
20 Correct 492 ms 26800 KB Output is correct
21 Correct 482 ms 29920 KB Output is correct
22 Correct 510 ms 30184 KB Output is correct
23 Correct 497 ms 29156 KB Output is correct
24 Correct 493 ms 29048 KB Output is correct
25 Correct 644 ms 30948 KB Output is correct
26 Correct 529 ms 29364 KB Output is correct
27 Correct 502 ms 29404 KB Output is correct
28 Correct 297 ms 31884 KB Output is correct
29 Correct 335 ms 28212 KB Output is correct
30 Correct 499 ms 30176 KB Output is correct
31 Correct 511 ms 30124 KB Output is correct
32 Correct 505 ms 29932 KB Output is correct
33 Correct 403 ms 29080 KB Output is correct
34 Correct 461 ms 28892 KB Output is correct
35 Correct 482 ms 29624 KB Output is correct
36 Correct 234 ms 28076 KB Output is correct
37 Correct 456 ms 30144 KB Output is correct
38 Correct 317 ms 28048 KB Output is correct
39 Correct 455 ms 29148 KB Output is correct
40 Correct 495 ms 28972 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Runtime error 52 ms 44844 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 419 ms 27060 KB Output is correct
12 Correct 537 ms 26800 KB Output is correct
13 Correct 409 ms 26212 KB Output is correct
14 Correct 448 ms 26148 KB Output is correct
15 Correct 573 ms 26964 KB Output is correct
16 Correct 483 ms 26248 KB Output is correct
17 Correct 466 ms 26176 KB Output is correct
18 Correct 279 ms 27980 KB Output is correct
19 Correct 276 ms 25012 KB Output is correct
20 Correct 492 ms 26800 KB Output is correct
21 Correct 482 ms 29920 KB Output is correct
22 Correct 510 ms 30184 KB Output is correct
23 Correct 497 ms 29156 KB Output is correct
24 Correct 493 ms 29048 KB Output is correct
25 Correct 644 ms 30948 KB Output is correct
26 Correct 529 ms 29364 KB Output is correct
27 Correct 502 ms 29404 KB Output is correct
28 Correct 297 ms 31884 KB Output is correct
29 Correct 335 ms 28212 KB Output is correct
30 Correct 499 ms 30176 KB Output is correct
31 Correct 511 ms 30124 KB Output is correct
32 Correct 505 ms 29932 KB Output is correct
33 Correct 403 ms 29080 KB Output is correct
34 Correct 461 ms 28892 KB Output is correct
35 Correct 482 ms 29624 KB Output is correct
36 Correct 234 ms 28076 KB Output is correct
37 Correct 456 ms 30144 KB Output is correct
38 Correct 317 ms 28048 KB Output is correct
39 Correct 455 ms 29148 KB Output is correct
40 Correct 495 ms 28972 KB Output is correct
41 Runtime error 52 ms 44844 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -