oj.uz

Submission #920225

# Submission time Handle Problem Language Result Execution time Memory
920225 2024-02-02T09:57:38 Z Unforgettablepl Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 1973 ms 54892 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;

#define int long long

int DP1[1048576];
int DP2[1048576];
int arr[1048576];
int idx[6];

inline int preprocess(const string &s,char c){
    int ans = 0;
    int cnt = 0;
    for(int bit=0;bit<s.size();bit++){
        if(s[bit]==c){
            idx[cnt++]=bit;
        } else if(s[bit]=='?'){
            if(c=='1')ans|=(1<<bit);
        } else {
            if(s[bit]=='1')ans|=(1<<bit);
        }
    }
    return ans;
}

inline int applymask(int qu,int mask,int cnt){
    for(int bit=0;bit<cnt;bit++){
        if(mask&(1<<bit))qu|=(1<<idx[bit]);
    }
    return qu;
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int l,q;
    cin >> l >> q;
    for(int mask=0;mask<(1<<l);mask++){
        char a;cin>>a;a-='0';
        DP1[mask]=DP2[mask]=arr[mask]=a;
    }
    for(int bit=0;bit<20;bit++){
        for(int mask=0;mask<(1<<20);mask++){
            if(mask&(1<<bit)){
                DP2[mask^(1<<bit)]+=DP2[mask];
            } else {
                DP1[mask|(1<<bit)]+=DP1[mask];
            }
        }
    }
    for(int i=1;i<=q;i++){
        string s;cin>>s;
        reverse(s.begin(),s.end());
        int c1=0,c0=0,cq=0;
        for(char&j:s) { 
            if(j=='1')c1++;
            else if(j=='0')c0++;
            else if(j=='?')cq++;
        }
        if(cq<=6){
            int qu = preprocess(s,'?');
            int ans = 0;
            for(int mask=0;mask<(1<<cq);mask++){
                ans+=arr[applymask(qu,mask,cq)];
            }
            cout<<ans<<'\n';
            continue;
        }
        if(c1<=6){
            int qu = preprocess(s,'1');
            int ans = 0;
            for(int mask=0;mask<(1<<c1);mask++){
                if(__builtin_parity(mask)==(c1&1)){
                    ans+=DP1[applymask(qu,mask,c1)];
                } else {
                    ans-=DP1[applymask(qu,mask,c1)];
                }
            }
            cout<<ans<<'\n';
            continue;
        }
        if(c0<=6){
            int qu = preprocess(s,'0');
            int ans = 0;
            for(int mask=0;mask<(1<<c0);mask++){
                if(__builtin_parity(mask)){
                    ans-=DP2[applymask(qu,mask,c0)];
                } else {
                    ans+=DP2[applymask(qu,mask,c0)];
                }
            }
            cout<<ans<<'\n';
            continue;
        }
    }
}

Compilation message

snake_escaping.cpp: In function 'long long int preprocess(const string&, char)':
snake_escaping.cpp:16:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int bit=0;bit<s.size();bit++){
      |                   ~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 18520 KB Output is correct
2 Correct 32 ms 18520 KB Output is correct
3 Correct 28 ms 18520 KB Output is correct
4 Correct 30 ms 18532 KB Output is correct
5 Correct 29 ms 18520 KB Output is correct
6 Correct 30 ms 18524 KB Output is correct
7 Correct 30 ms 18520 KB Output is correct
8 Correct 28 ms 18756 KB Output is correct
9 Correct 31 ms 18520 KB Output is correct
10 Correct 30 ms 18520 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 18520 KB Output is correct
2 Correct 32 ms 18520 KB Output is correct
3 Correct 28 ms 18520 KB Output is correct
4 Correct 30 ms 18532 KB Output is correct
5 Correct 29 ms 18520 KB Output is correct
6 Correct 30 ms 18524 KB Output is correct
7 Correct 30 ms 18520 KB Output is correct
8 Correct 28 ms 18756 KB Output is correct
9 Correct 31 ms 18520 KB Output is correct
10 Correct 30 ms 18520 KB Output is correct
11 Correct 444 ms 22780 KB Output is correct
12 Correct 469 ms 22396 KB Output is correct
13 Correct 309 ms 21560 KB Output is correct
14 Correct 302 ms 21584 KB Output is correct
15 Correct 843 ms 22872 KB Output is correct
16 Correct 397 ms 21780 KB Output is correct
17 Correct 396 ms 21904 KB Output is correct
18 Correct 191 ms 23644 KB Output is correct
19 Correct 211 ms 20560 KB Output is correct
20 Correct 468 ms 22204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 18520 KB Output is correct
2 Correct 32 ms 18520 KB Output is correct
3 Correct 28 ms 18520 KB Output is correct
4 Correct 30 ms 18532 KB Output is correct
5 Correct 29 ms 18520 KB Output is correct
6 Correct 30 ms 18524 KB Output is correct
7 Correct 30 ms 18520 KB Output is correct
8 Correct 28 ms 18756 KB Output is correct
9 Correct 31 ms 18520 KB Output is correct
10 Correct 30 ms 18520 KB Output is correct
11 Correct 444 ms 22780 KB Output is correct
12 Correct 469 ms 22396 KB Output is correct
13 Correct 309 ms 21560 KB Output is correct
14 Correct 302 ms 21584 KB Output is correct
15 Correct 843 ms 22872 KB Output is correct
16 Correct 397 ms 21780 KB Output is correct
17 Correct 396 ms 21904 KB Output is correct
18 Correct 191 ms 23644 KB Output is correct
19 Correct 211 ms 20560 KB Output is correct
20 Correct 468 ms 22204 KB Output is correct
21 Correct 870 ms 22864 KB Output is correct
22 Correct 470 ms 22864 KB Output is correct
23 Correct 434 ms 21868 KB Output is correct
24 Correct 398 ms 21872 KB Output is correct
25 Correct 342 ms 24072 KB Output is correct
26 Correct 531 ms 22736 KB Output is correct
27 Correct 511 ms 22212 KB Output is correct
28 Correct 210 ms 24656 KB Output is correct
29 Correct 286 ms 20592 KB Output is correct
30 Correct 686 ms 22864 KB Output is correct
31 Correct 916 ms 22948 KB Output is correct
32 Correct 553 ms 22800 KB Output is correct
33 Correct 334 ms 21588 KB Output is correct
34 Correct 423 ms 21688 KB Output is correct
35 Correct 515 ms 22100 KB Output is correct
36 Correct 196 ms 20560 KB Output is correct
37 Correct 869 ms 23120 KB Output is correct
38 Correct 292 ms 20680 KB Output is correct
39 Correct 462 ms 22152 KB Output is correct
40 Correct 417 ms 21756 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 18520 KB Output is correct
2 Correct 32 ms 18520 KB Output is correct
3 Correct 28 ms 18520 KB Output is correct
4 Correct 30 ms 18532 KB Output is correct
5 Correct 29 ms 18520 KB Output is correct
6 Correct 30 ms 18524 KB Output is correct
7 Correct 30 ms 18520 KB Output is correct
8 Correct 28 ms 18756 KB Output is correct
9 Correct 31 ms 18520 KB Output is correct
10 Correct 30 ms 18520 KB Output is correct
11 Correct 51 ms 25168 KB Output is correct
12 Correct 54 ms 25168 KB Output is correct
13 Correct 68 ms 25168 KB Output is correct
14 Correct 115 ms 25224 KB Output is correct
15 Correct 64 ms 25168 KB Output is correct
16 Correct 122 ms 25168 KB Output is correct
17 Correct 106 ms 25060 KB Output is correct
18 Correct 46 ms 25424 KB Output is correct
19 Correct 53 ms 25176 KB Output is correct
20 Correct 55 ms 25168 KB Output is correct
21 Correct 65 ms 25168 KB Output is correct
22 Correct 80 ms 25168 KB Output is correct
23 Correct 56 ms 25172 KB Output is correct
24 Correct 104 ms 25344 KB Output is correct
25 Correct 111 ms 25060 KB Output is correct
26 Correct 45 ms 24920 KB Output is correct
27 Correct 61 ms 25212 KB Output is correct
28 Correct 57 ms 25120 KB Output is correct
29 Correct 70 ms 25120 KB Output is correct
30 Correct 88 ms 25172 KB Output is correct
31 Correct 57 ms 25168 KB Output is correct
32 Correct 100 ms 25140 KB Output is correct
33 Correct 109 ms 25172 KB Output is correct
34 Correct 48 ms 24920 KB Output is correct
35 Correct 96 ms 25172 KB Output is correct
36 Correct 105 ms 25424 KB Output is correct
37 Correct 86 ms 25172 KB Output is correct
38 Correct 95 ms 25168 KB Output is correct
39 Correct 108 ms 25424 KB Output is correct
40 Correct 93 ms 25168 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 18520 KB Output is correct
2 Correct 32 ms 18520 KB Output is correct
3 Correct 28 ms 18520 KB Output is correct
4 Correct 30 ms 18532 KB Output is correct
5 Correct 29 ms 18520 KB Output is correct
6 Correct 30 ms 18524 KB Output is correct
7 Correct 30 ms 18520 KB Output is correct
8 Correct 28 ms 18756 KB Output is correct
9 Correct 31 ms 18520 KB Output is correct
10 Correct 30 ms 18520 KB Output is correct
11 Correct 444 ms 22780 KB Output is correct
12 Correct 469 ms 22396 KB Output is correct
13 Correct 309 ms 21560 KB Output is correct
14 Correct 302 ms 21584 KB Output is correct
15 Correct 843 ms 22872 KB Output is correct
16 Correct 397 ms 21780 KB Output is correct
17 Correct 396 ms 21904 KB Output is correct
18 Correct 191 ms 23644 KB Output is correct
19 Correct 211 ms 20560 KB Output is correct
20 Correct 468 ms 22204 KB Output is correct
21 Correct 870 ms 22864 KB Output is correct
22 Correct 470 ms 22864 KB Output is correct
23 Correct 434 ms 21868 KB Output is correct
24 Correct 398 ms 21872 KB Output is correct
25 Correct 342 ms 24072 KB Output is correct
26 Correct 531 ms 22736 KB Output is correct
27 Correct 511 ms 22212 KB Output is correct
28 Correct 210 ms 24656 KB Output is correct
29 Correct 286 ms 20592 KB Output is correct
30 Correct 686 ms 22864 KB Output is correct
31 Correct 916 ms 22948 KB Output is correct
32 Correct 553 ms 22800 KB Output is correct
33 Correct 334 ms 21588 KB Output is correct
34 Correct 423 ms 21688 KB Output is correct
35 Correct 515 ms 22100 KB Output is correct
36 Correct 196 ms 20560 KB Output is correct
37 Correct 869 ms 23120 KB Output is correct
38 Correct 292 ms 20680 KB Output is correct
39 Correct 462 ms 22152 KB Output is correct
40 Correct 417 ms 21756 KB Output is correct
41 Correct 51 ms 25168 KB Output is correct
42 Correct 54 ms 25168 KB Output is correct
43 Correct 68 ms 25168 KB Output is correct
44 Correct 115 ms 25224 KB Output is correct
45 Correct 64 ms 25168 KB Output is correct
46 Correct 122 ms 25168 KB Output is correct
47 Correct 106 ms 25060 KB Output is correct
48 Correct 46 ms 25424 KB Output is correct
49 Correct 53 ms 25176 KB Output is correct
50 Correct 55 ms 25168 KB Output is correct
51 Correct 65 ms 25168 KB Output is correct
52 Correct 80 ms 25168 KB Output is correct
53 Correct 56 ms 25172 KB Output is correct
54 Correct 104 ms 25344 KB Output is correct
55 Correct 111 ms 25060 KB Output is correct
56 Correct 45 ms 24920 KB Output is correct
57 Correct 61 ms 25212 KB Output is correct
58 Correct 57 ms 25120 KB Output is correct
59 Correct 70 ms 25120 KB Output is correct
60 Correct 88 ms 25172 KB Output is correct
61 Correct 57 ms 25168 KB Output is correct
62 Correct 100 ms 25140 KB Output is correct
63 Correct 109 ms 25172 KB Output is correct
64 Correct 48 ms 24920 KB Output is correct
65 Correct 96 ms 25172 KB Output is correct
66 Correct 105 ms 25424 KB Output is correct
67 Correct 86 ms 25172 KB Output is correct
68 Correct 95 ms 25168 KB Output is correct
69 Correct 108 ms 25424 KB Output is correct
70 Correct 93 ms 25168 KB Output is correct
71 Correct 378 ms 30204 KB Output is correct
72 Correct 441 ms 30036 KB Output is correct
73 Correct 653 ms 28772 KB Output is correct
74 Correct 1050 ms 29032 KB Output is correct
75 Correct 487 ms 31056 KB Output is correct
76 Correct 1973 ms 29536 KB Output is correct
77 Correct 1494 ms 50624 KB Output is correct
78 Correct 289 ms 54892 KB Output is correct
79 Correct 374 ms 48728 KB Output is correct
80 Correct 468 ms 51964 KB Output is correct
81 Correct 691 ms 51536 KB Output is correct
82 Correct 975 ms 50520 KB Output is correct
83 Correct 467 ms 49744 KB Output is correct
84 Correct 1020 ms 50620 KB Output is correct
85 Correct 1626 ms 50892 KB Output is correct
86 Correct 266 ms 48752 KB Output is correct
87 Correct 414 ms 51628 KB Output is correct
88 Correct 386 ms 48464 KB Output is correct
89 Correct 749 ms 50748 KB Output is correct
90 Correct 1008 ms 50748 KB Output is correct
91 Correct 445 ms 49744 KB Output is correct
92 Correct 1311 ms 51052 KB Output is correct
93 Correct 1441 ms 51192 KB Output is correct
94 Correct 249 ms 48680 KB Output is correct
95 Correct 1142 ms 50732 KB Output is correct
96 Correct 1068 ms 50744 KB Output is correct
97 Correct 1180 ms 50804 KB Output is correct
98 Correct 1157 ms 50692 KB Output is correct
99 Correct 1142 ms 50896 KB Output is correct
100 Correct 1220 ms 50860 KB Output is correct