oj.uz

Submission #963545

# Submission time Handle Problem Language Result Execution time Memory
963545 2024-04-15T09:45:36 Z ksu2009en Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 1240 ms 65536 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 long long 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(l, half) + 1);
    pw[0] = 1;
    
    for(int i = 1; i < pw.size(); i++)
        pw[i] = pw[i - 1] * 3;
        
    vector<int> dp, bit(pw[max(0ll, l - half)] + 1, -1), bin_to3((1ll << max(0ll, l - half)) + 1), from3_to_bin(pw[max(0ll, l - half)] + 1);
    
    for(int i = 0; i < (1 << max(0ll, l - half)); i++){
        ll cnt = 0;
        
        for(int j = max(0ll, 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(0ll, l - half))]; i++){
        ll val = i;
        
        for(int j = 0; j < max(0ll, 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(0ll, 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<long long 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 'long long int'} [-Wsign-compare]
  111 |         while(b.size() < l)
      |               ~~~~~~~~~^~~
snake_escaping.cpp:128:55: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long 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<long long int, long long 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<long long int, long long 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 3 ms 600 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 2 ms 460 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 600 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 3 ms 600 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 2 ms 460 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 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 557 ms 33560 KB Output is correct
12 Correct 583 ms 33328 KB Output is correct
13 Correct 557 ms 33204 KB Output is correct
14 Correct 574 ms 32676 KB Output is correct
15 Correct 619 ms 34028 KB Output is correct
16 Correct 677 ms 32792 KB Output is correct
17 Correct 724 ms 33312 KB Output is correct
18 Correct 381 ms 34764 KB Output is correct
19 Correct 429 ms 31660 KB Output is correct
20 Correct 555 ms 33300 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 2 ms 460 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 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 557 ms 33560 KB Output is correct
12 Correct 583 ms 33328 KB Output is correct
13 Correct 557 ms 33204 KB Output is correct
14 Correct 574 ms 32676 KB Output is correct
15 Correct 619 ms 34028 KB Output is correct
16 Correct 677 ms 32792 KB Output is correct
17 Correct 724 ms 33312 KB Output is correct
18 Correct 381 ms 34764 KB Output is correct
19 Correct 429 ms 31660 KB Output is correct
20 Correct 555 ms 33300 KB Output is correct
21 Correct 570 ms 35216 KB Output is correct
22 Correct 610 ms 35632 KB Output is correct
23 Correct 618 ms 34584 KB Output is correct
24 Correct 641 ms 34132 KB Output is correct
25 Correct 663 ms 36628 KB Output is correct
26 Correct 676 ms 35256 KB Output is correct
27 Correct 635 ms 34680 KB Output is correct
28 Correct 352 ms 37788 KB Output is correct
29 Correct 453 ms 33064 KB Output is correct
30 Correct 594 ms 35868 KB Output is correct
31 Correct 608 ms 35136 KB Output is correct
32 Correct 615 ms 35248 KB Output is correct
33 Correct 523 ms 34180 KB Output is correct
34 Correct 656 ms 34420 KB Output is correct
35 Correct 647 ms 34600 KB Output is correct
36 Correct 301 ms 33688 KB Output is correct
37 Correct 527 ms 35116 KB Output is correct
38 Correct 453 ms 33192 KB Output is correct
39 Correct 600 ms 34468 KB Output is correct
40 Correct 661 ms 34064 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 2 ms 460 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 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 430 ms 23476 KB Output is correct
12 Correct 426 ms 23736 KB Output is correct
13 Correct 447 ms 23560 KB Output is correct
14 Correct 428 ms 23480 KB Output is correct
15 Correct 456 ms 23740 KB Output is correct
16 Correct 440 ms 23616 KB Output is correct
17 Correct 433 ms 23536 KB Output is correct
18 Correct 414 ms 23736 KB Output is correct
19 Correct 420 ms 23484 KB Output is correct
20 Correct 429 ms 23732 KB Output is correct
21 Correct 445 ms 23544 KB Output is correct
22 Correct 426 ms 23488 KB Output is correct
23 Correct 431 ms 23472 KB Output is correct
24 Correct 430 ms 24492 KB Output is correct
25 Correct 432 ms 23484 KB Output is correct
26 Correct 410 ms 23472 KB Output is correct
27 Correct 421 ms 23544 KB Output is correct
28 Correct 435 ms 23472 KB Output is correct
29 Correct 427 ms 23540 KB Output is correct
30 Correct 453 ms 23480 KB Output is correct
31 Correct 430 ms 23472 KB Output is correct
32 Correct 428 ms 23536 KB Output is correct
33 Correct 445 ms 23524 KB Output is correct
34 Correct 422 ms 23484 KB Output is correct
35 Correct 431 ms 23484 KB Output is correct
36 Correct 435 ms 23472 KB Output is correct
37 Correct 425 ms 23472 KB Output is correct
38 Correct 428 ms 23472 KB Output is correct
39 Correct 430 ms 23492 KB Output is correct
40 Correct 431 ms 23500 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 600 KB Output is correct
2 Correct 2 ms 624 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 2 ms 460 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 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 557 ms 33560 KB Output is correct
12 Correct 583 ms 33328 KB Output is correct
13 Correct 557 ms 33204 KB Output is correct
14 Correct 574 ms 32676 KB Output is correct
15 Correct 619 ms 34028 KB Output is correct
16 Correct 677 ms 32792 KB Output is correct
17 Correct 724 ms 33312 KB Output is correct
18 Correct 381 ms 34764 KB Output is correct
19 Correct 429 ms 31660 KB Output is correct
20 Correct 555 ms 33300 KB Output is correct
21 Correct 570 ms 35216 KB Output is correct
22 Correct 610 ms 35632 KB Output is correct
23 Correct 618 ms 34584 KB Output is correct
24 Correct 641 ms 34132 KB Output is correct
25 Correct 663 ms 36628 KB Output is correct
26 Correct 676 ms 35256 KB Output is correct
27 Correct 635 ms 34680 KB Output is correct
28 Correct 352 ms 37788 KB Output is correct
29 Correct 453 ms 33064 KB Output is correct
30 Correct 594 ms 35868 KB Output is correct
31 Correct 608 ms 35136 KB Output is correct
32 Correct 615 ms 35248 KB Output is correct
33 Correct 523 ms 34180 KB Output is correct
34 Correct 656 ms 34420 KB Output is correct
35 Correct 647 ms 34600 KB Output is correct
36 Correct 301 ms 33688 KB Output is correct
37 Correct 527 ms 35116 KB Output is correct
38 Correct 453 ms 33192 KB Output is correct
39 Correct 600 ms 34468 KB Output is correct
40 Correct 661 ms 34064 KB Output is correct
41 Correct 430 ms 23476 KB Output is correct
42 Correct 426 ms 23736 KB Output is correct
43 Correct 447 ms 23560 KB Output is correct
44 Correct 428 ms 23480 KB Output is correct
45 Correct 456 ms 23740 KB Output is correct
46 Correct 440 ms 23616 KB Output is correct
47 Correct 433 ms 23536 KB Output is correct
48 Correct 414 ms 23736 KB Output is correct
49 Correct 420 ms 23484 KB Output is correct
50 Correct 429 ms 23732 KB Output is correct
51 Correct 445 ms 23544 KB Output is correct
52 Correct 426 ms 23488 KB Output is correct
53 Correct 431 ms 23472 KB Output is correct
54 Correct 430 ms 24492 KB Output is correct
55 Correct 432 ms 23484 KB Output is correct
56 Correct 410 ms 23472 KB Output is correct
57 Correct 421 ms 23544 KB Output is correct
58 Correct 435 ms 23472 KB Output is correct
59 Correct 427 ms 23540 KB Output is correct
60 Correct 453 ms 23480 KB Output is correct
61 Correct 430 ms 23472 KB Output is correct
62 Correct 428 ms 23536 KB Output is correct
63 Correct 445 ms 23524 KB Output is correct
64 Correct 422 ms 23484 KB Output is correct
65 Correct 431 ms 23484 KB Output is correct
66 Correct 435 ms 23472 KB Output is correct
67 Correct 425 ms 23472 KB Output is correct
68 Correct 428 ms 23472 KB Output is correct
69 Correct 430 ms 23492 KB Output is correct
70 Correct 431 ms 23500 KB Output is correct
71 Correct 1029 ms 62440 KB Output is correct
72 Correct 1058 ms 63224 KB Output is correct
73 Correct 1132 ms 60232 KB Output is correct
74 Correct 1170 ms 61412 KB Output is correct
75 Correct 1209 ms 63868 KB Output is correct
76 Correct 1226 ms 61872 KB Output is correct
77 Correct 1209 ms 61656 KB Output is correct
78 Correct 761 ms 65536 KB Output is correct
79 Correct 886 ms 57688 KB Output is correct
80 Correct 1032 ms 63048 KB Output is correct
81 Correct 1230 ms 62424 KB Output is correct
82 Correct 1188 ms 61032 KB Output is correct
83 Correct 955 ms 60124 KB Output is correct
84 Correct 1216 ms 65092 KB Output is correct
85 Correct 1222 ms 65512 KB Output is correct
86 Correct 760 ms 63276 KB Output is correct
87 Correct 1027 ms 65536 KB Output is correct
88 Correct 927 ms 62932 KB Output is correct
89 Correct 1084 ms 65120 KB Output is correct
90 Correct 1199 ms 65380 KB Output is correct
91 Correct 969 ms 64460 KB Output is correct
92 Correct 1181 ms 65536 KB Output is correct
93 Correct 1240 ms 65536 KB Output is correct
94 Correct 717 ms 62896 KB Output is correct
95 Correct 1186 ms 65536 KB Output is correct
96 Correct 1153 ms 61192 KB Output is correct
97 Correct 1212 ms 61020 KB Output is correct
98 Correct 1197 ms 61284 KB Output is correct
99 Correct 1228 ms 61204 KB Output is correct
100 Correct 1153 ms 61268 KB Output is correct