oj.uz

Submission #920228

# Submission time Handle Problem Language Result Execution time Memory
920228 2024-02-02T10:00:50 Z Unforgettablepl Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 45248 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 29 ms 18720 KB Output is correct
3 Correct 30 ms 18524 KB Output is correct
4 Correct 27 ms 18520 KB Output is correct
5 Correct 32 ms 18520 KB Output is correct
6 Correct 28 ms 18520 KB Output is correct
7 Correct 28 ms 18748 KB Output is correct
8 Correct 30 ms 18520 KB Output is correct
9 Correct 29 ms 18520 KB Output is correct
10 Correct 29 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 29 ms 18720 KB Output is correct
3 Correct 30 ms 18524 KB Output is correct
4 Correct 27 ms 18520 KB Output is correct
5 Correct 32 ms 18520 KB Output is correct
6 Correct 28 ms 18520 KB Output is correct
7 Correct 28 ms 18748 KB Output is correct
8 Correct 30 ms 18520 KB Output is correct
9 Correct 29 ms 18520 KB Output is correct
10 Correct 29 ms 18520 KB Output is correct
11 Correct 417 ms 28240 KB Output is correct
12 Correct 450 ms 28244 KB Output is correct
13 Correct 317 ms 27676 KB Output is correct
14 Correct 311 ms 27148 KB Output is correct
15 Correct 753 ms 28240 KB Output is correct
16 Correct 405 ms 27500 KB Output is correct
17 Correct 400 ms 27472 KB Output is correct
18 Correct 193 ms 29300 KB Output is correct
19 Correct 218 ms 26356 KB Output is correct
20 Correct 459 ms 28240 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 29 ms 18720 KB Output is correct
3 Correct 30 ms 18524 KB Output is correct
4 Correct 27 ms 18520 KB Output is correct
5 Correct 32 ms 18520 KB Output is correct
6 Correct 28 ms 18520 KB Output is correct
7 Correct 28 ms 18748 KB Output is correct
8 Correct 30 ms 18520 KB Output is correct
9 Correct 29 ms 18520 KB Output is correct
10 Correct 29 ms 18520 KB Output is correct
11 Correct 417 ms 28240 KB Output is correct
12 Correct 450 ms 28244 KB Output is correct
13 Correct 317 ms 27676 KB Output is correct
14 Correct 311 ms 27148 KB Output is correct
15 Correct 753 ms 28240 KB Output is correct
16 Correct 405 ms 27500 KB Output is correct
17 Correct 400 ms 27472 KB Output is correct
18 Correct 193 ms 29300 KB Output is correct
19 Correct 218 ms 26356 KB Output is correct
20 Correct 459 ms 28240 KB Output is correct
21 Correct 844 ms 29804 KB Output is correct
22 Correct 456 ms 30008 KB Output is correct
23 Correct 426 ms 28948 KB Output is correct
24 Correct 401 ms 28752 KB Output is correct
25 Correct 341 ms 30804 KB Output is correct
26 Correct 530 ms 29336 KB Output is correct
27 Correct 506 ms 29404 KB Output is correct
28 Correct 202 ms 32004 KB Output is correct
29 Correct 277 ms 27728 KB Output is correct
30 Correct 652 ms 29908 KB Output is correct
31 Correct 818 ms 30032 KB Output is correct
32 Correct 524 ms 30032 KB Output is correct
33 Correct 342 ms 28912 KB Output is correct
34 Correct 415 ms 29008 KB Output is correct
35 Correct 507 ms 29540 KB Output is correct
36 Correct 191 ms 27728 KB Output is correct
37 Correct 780 ms 30032 KB Output is correct
38 Correct 303 ms 27944 KB Output is correct
39 Correct 450 ms 29160 KB Output is correct
40 Correct 401 ms 28892 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 29 ms 18720 KB Output is correct
3 Correct 30 ms 18524 KB Output is correct
4 Correct 27 ms 18520 KB Output is correct
5 Correct 32 ms 18520 KB Output is correct
6 Correct 28 ms 18520 KB Output is correct
7 Correct 28 ms 18748 KB Output is correct
8 Correct 30 ms 18520 KB Output is correct
9 Correct 29 ms 18520 KB Output is correct
10 Correct 29 ms 18520 KB Output is correct
11 Correct 58 ms 26444 KB Output is correct
12 Correct 67 ms 26448 KB Output is correct
13 Correct 73 ms 26452 KB Output is correct
14 Correct 99 ms 26448 KB Output is correct
15 Correct 68 ms 26628 KB Output is correct
16 Correct 144 ms 26528 KB Output is correct
17 Correct 118 ms 26408 KB Output is correct
18 Correct 50 ms 26704 KB Output is correct
19 Correct 64 ms 26320 KB Output is correct
20 Correct 65 ms 26528 KB Output is correct
21 Correct 81 ms 26400 KB Output is correct
22 Correct 88 ms 26448 KB Output is correct
23 Correct 71 ms 26448 KB Output is correct
24 Correct 91 ms 26612 KB Output is correct
25 Correct 116 ms 26448 KB Output is correct
26 Correct 48 ms 26192 KB Output is correct
27 Correct 63 ms 26364 KB Output is correct
28 Correct 68 ms 26436 KB Output is correct
29 Correct 86 ms 26520 KB Output is correct
30 Correct 98 ms 26452 KB Output is correct
31 Correct 63 ms 26396 KB Output is correct
32 Correct 109 ms 26320 KB Output is correct
33 Correct 124 ms 26708 KB Output is correct
34 Correct 53 ms 26312 KB Output is correct
35 Correct 100 ms 26448 KB Output is correct
36 Correct 102 ms 26448 KB Output is correct
37 Correct 99 ms 26448 KB Output is correct
38 Correct 109 ms 26388 KB Output is correct
39 Correct 103 ms 26448 KB Output is correct
40 Correct 99 ms 26448 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 18520 KB Output is correct
2 Correct 29 ms 18720 KB Output is correct
3 Correct 30 ms 18524 KB Output is correct
4 Correct 27 ms 18520 KB Output is correct
5 Correct 32 ms 18520 KB Output is correct
6 Correct 28 ms 18520 KB Output is correct
7 Correct 28 ms 18748 KB Output is correct
8 Correct 30 ms 18520 KB Output is correct
9 Correct 29 ms 18520 KB Output is correct
10 Correct 29 ms 18520 KB Output is correct
11 Correct 417 ms 28240 KB Output is correct
12 Correct 450 ms 28244 KB Output is correct
13 Correct 317 ms 27676 KB Output is correct
14 Correct 311 ms 27148 KB Output is correct
15 Correct 753 ms 28240 KB Output is correct
16 Correct 405 ms 27500 KB Output is correct
17 Correct 400 ms 27472 KB Output is correct
18 Correct 193 ms 29300 KB Output is correct
19 Correct 218 ms 26356 KB Output is correct
20 Correct 459 ms 28240 KB Output is correct
21 Correct 844 ms 29804 KB Output is correct
22 Correct 456 ms 30008 KB Output is correct
23 Correct 426 ms 28948 KB Output is correct
24 Correct 401 ms 28752 KB Output is correct
25 Correct 341 ms 30804 KB Output is correct
26 Correct 530 ms 29336 KB Output is correct
27 Correct 506 ms 29404 KB Output is correct
28 Correct 202 ms 32004 KB Output is correct
29 Correct 277 ms 27728 KB Output is correct
30 Correct 652 ms 29908 KB Output is correct
31 Correct 818 ms 30032 KB Output is correct
32 Correct 524 ms 30032 KB Output is correct
33 Correct 342 ms 28912 KB Output is correct
34 Correct 415 ms 29008 KB Output is correct
35 Correct 507 ms 29540 KB Output is correct
36 Correct 191 ms 27728 KB Output is correct
37 Correct 780 ms 30032 KB Output is correct
38 Correct 303 ms 27944 KB Output is correct
39 Correct 450 ms 29160 KB Output is correct
40 Correct 401 ms 28892 KB Output is correct
41 Correct 58 ms 26444 KB Output is correct
42 Correct 67 ms 26448 KB Output is correct
43 Correct 73 ms 26452 KB Output is correct
44 Correct 99 ms 26448 KB Output is correct
45 Correct 68 ms 26628 KB Output is correct
46 Correct 144 ms 26528 KB Output is correct
47 Correct 118 ms 26408 KB Output is correct
48 Correct 50 ms 26704 KB Output is correct
49 Correct 64 ms 26320 KB Output is correct
50 Correct 65 ms 26528 KB Output is correct
51 Correct 81 ms 26400 KB Output is correct
52 Correct 88 ms 26448 KB Output is correct
53 Correct 71 ms 26448 KB Output is correct
54 Correct 91 ms 26612 KB Output is correct
55 Correct 116 ms 26448 KB Output is correct
56 Correct 48 ms 26192 KB Output is correct
57 Correct 63 ms 26364 KB Output is correct
58 Correct 68 ms 26436 KB Output is correct
59 Correct 86 ms 26520 KB Output is correct
60 Correct 98 ms 26452 KB Output is correct
61 Correct 63 ms 26396 KB Output is correct
62 Correct 109 ms 26320 KB Output is correct
63 Correct 124 ms 26708 KB Output is correct
64 Correct 53 ms 26312 KB Output is correct
65 Correct 100 ms 26448 KB Output is correct
66 Correct 102 ms 26448 KB Output is correct
67 Correct 99 ms 26448 KB Output is correct
68 Correct 109 ms 26388 KB Output is correct
69 Correct 103 ms 26448 KB Output is correct
70 Correct 99 ms 26448 KB Output is correct
71 Correct 419 ms 41036 KB Output is correct
72 Correct 495 ms 41168 KB Output is correct
73 Correct 693 ms 39656 KB Output is correct
74 Correct 1070 ms 40124 KB Output is correct
75 Correct 534 ms 42064 KB Output is correct
76 Execution timed out 2021 ms 45248 KB Time limit exceeded
77 Halted 0 ms 0 KB -