oj.uz

Submission #257487

# Submission time Handle Problem Language Result Execution time Memory
257487 2020-08-04T10:49:51 Z mhy908 Snake Escaping (JOI18_snake_escaping) C++14
100 / 100
 1279 ms 41336 KB 
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;

int len, n, q;
int arr[1050000], arrrv[1050000], dp[1050000], dprv[1050000];
char str[1050000], qu[30];

int q_query(){
    int temp=0, x=0, ret=0;
    for(int i=1; i<=len; i++){
        temp*=2, x*=2;
        if(qu[i]=='?')temp++, x++;
        if(qu[i]=='1')temp++;
    }
    for(int i=x; ; i=x&(i-1)){
        ret+=arr[temp^i];
        if(!i)break;
    }
    return ret;
}

int o_query(){
    int temp=0, x=0, ret=0;
    for(int i=1; i<=len; i++){
        temp*=2, x*=2;
        if(qu[i]=='1')temp++, x++;
        if(qu[i]=='?')temp++;
    }
    for(int i=x; ; i=x&(i-1)){
        int pc=__builtin_popcount(i);
        if(pc%2)ret-=dp[temp^i];
        else ret+=dp[temp^i];
        if(!i)break;
    }
    return ret;
}

int z_query(){
    int temp=0, x=0, ret=0;
    for(int i=1; i<=len; i++){
        temp*=2, x*=2;
        if(qu[i]=='0')temp++, x++;
        if(qu[i]=='?')temp++;
    }
    for(int i=x; ; i=x&(i-1)){
        int pc=__builtin_popcount(i);
        if(pc%2)ret-=dprv[temp^i];
        else ret+=dprv[temp^i];
        if(!i)break;
    }
    return ret;
}

int main(){
    scanf("%d %d", &len, &q);
    n=(1<<len);
    scanf("%s", str);
    for(int i=0; i<n; i++){
        arr[i]=(int)(str[i]-'0');
        arrrv[(~i)&(n-1)]=arr[i];
    }
    for(int i=0; i<n; i++)dp[i]=arr[i], dprv[i]=arrrv[i];
    for(int i=0; i<len; i++){
        for(int mask=0; mask<n; mask++){
            if(mask&(1<<i))dp[mask]+=dp[mask^(1<<i)];
            if(mask&(1<<i))dprv[mask]+=dprv[mask^(1<<i)];
        }
    }
    for(int j=1; j<=q; j++){
        memset(qu, 0, sizeof qu);
        scanf("%s", qu+1);
        int qn=0, zn=0, on=0;
        for(int i=1; i<=len; i++){
            if(qu[i]=='?')qn++;
            if(qu[i]=='0')zn++;
            if(qu[i]=='1')on++;
        }
        if(qn<=len/3)printf("%d\n", q_query());
        else if(on<=len/3)printf("%d\n", o_query());
        else printf("%d\n", z_query());
    }
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:58:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &len, &q);
     ~~~~~^~~~~~~~~~~~~~~~~~~
snake_escaping.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", str);
     ~~~~~^~~~~~~~~~~
snake_escaping.cpp:74:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", qu+1);
         ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 337 ms 15252 KB Output is correct
12 Correct 331 ms 14840 KB Output is correct
13 Correct 305 ms 14072 KB Output is correct
14 Correct 297 ms 14136 KB Output is correct
15 Correct 345 ms 15096 KB Output is correct
16 Correct 345 ms 14328 KB Output is correct
17 Correct 334 ms 14328 KB Output is correct
18 Correct 279 ms 16248 KB Output is correct
19 Correct 268 ms 13252 KB Output is correct
20 Correct 328 ms 14840 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 337 ms 15252 KB Output is correct
12 Correct 331 ms 14840 KB Output is correct
13 Correct 305 ms 14072 KB Output is correct
14 Correct 297 ms 14136 KB Output is correct
15 Correct 345 ms 15096 KB Output is correct
16 Correct 345 ms 14328 KB Output is correct
17 Correct 334 ms 14328 KB Output is correct
18 Correct 279 ms 16248 KB Output is correct
19 Correct 268 ms 13252 KB Output is correct
20 Correct 328 ms 14840 KB Output is correct
21 Correct 353 ms 18296 KB Output is correct
22 Correct 418 ms 18424 KB Output is correct
23 Correct 387 ms 17400 KB Output is correct
24 Correct 382 ms 17272 KB Output is correct
25 Correct 398 ms 19256 KB Output is correct
26 Correct 406 ms 17656 KB Output is correct
27 Correct 411 ms 17676 KB Output is correct
28 Correct 289 ms 20324 KB Output is correct
29 Correct 292 ms 16240 KB Output is correct
30 Correct 410 ms 18508 KB Output is correct
31 Correct 431 ms 18316 KB Output is correct
32 Correct 454 ms 18168 KB Output is correct
33 Correct 350 ms 17016 KB Output is correct
34 Correct 362 ms 17204 KB Output is correct
35 Correct 401 ms 17672 KB Output is correct
36 Correct 289 ms 16184 KB Output is correct
37 Correct 358 ms 18168 KB Output is correct
38 Correct 322 ms 16120 KB Output is correct
39 Correct 400 ms 17388 KB Output is correct
40 Correct 359 ms 17272 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 75 ms 20040 KB Output is correct
12 Correct 68 ms 20108 KB Output is correct
13 Correct 69 ms 20052 KB Output is correct
14 Correct 110 ms 20088 KB Output is correct
15 Correct 81 ms 20112 KB Output is correct
16 Correct 118 ms 20144 KB Output is correct
17 Correct 89 ms 20088 KB Output is correct
18 Correct 58 ms 20192 KB Output is correct
19 Correct 62 ms 19960 KB Output is correct
20 Correct 67 ms 20088 KB Output is correct
21 Correct 82 ms 20100 KB Output is correct
22 Correct 108 ms 20088 KB Output is correct
23 Correct 63 ms 20088 KB Output is correct
24 Correct 81 ms 20088 KB Output is correct
25 Correct 83 ms 20088 KB Output is correct
26 Correct 55 ms 19960 KB Output is correct
27 Correct 64 ms 20088 KB Output is correct
28 Correct 60 ms 19960 KB Output is correct
29 Correct 76 ms 20068 KB Output is correct
30 Correct 84 ms 20048 KB Output is correct
31 Correct 65 ms 19960 KB Output is correct
32 Correct 111 ms 20088 KB Output is correct
33 Correct 92 ms 19984 KB Output is correct
34 Correct 55 ms 19912 KB Output is correct
35 Correct 86 ms 20216 KB Output is correct
36 Correct 75 ms 20088 KB Output is correct
37 Correct 80 ms 20088 KB Output is correct
38 Correct 79 ms 20008 KB Output is correct
39 Correct 94 ms 20116 KB Output is correct
40 Correct 79 ms 20088 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 337 ms 15252 KB Output is correct
12 Correct 331 ms 14840 KB Output is correct
13 Correct 305 ms 14072 KB Output is correct
14 Correct 297 ms 14136 KB Output is correct
15 Correct 345 ms 15096 KB Output is correct
16 Correct 345 ms 14328 KB Output is correct
17 Correct 334 ms 14328 KB Output is correct
18 Correct 279 ms 16248 KB Output is correct
19 Correct 268 ms 13252 KB Output is correct
20 Correct 328 ms 14840 KB Output is correct
21 Correct 353 ms 18296 KB Output is correct
22 Correct 418 ms 18424 KB Output is correct
23 Correct 387 ms 17400 KB Output is correct
24 Correct 382 ms 17272 KB Output is correct
25 Correct 398 ms 19256 KB Output is correct
26 Correct 406 ms 17656 KB Output is correct
27 Correct 411 ms 17676 KB Output is correct
28 Correct 289 ms 20324 KB Output is correct
29 Correct 292 ms 16240 KB Output is correct
30 Correct 410 ms 18508 KB Output is correct
31 Correct 431 ms 18316 KB Output is correct
32 Correct 454 ms 18168 KB Output is correct
33 Correct 350 ms 17016 KB Output is correct
34 Correct 362 ms 17204 KB Output is correct
35 Correct 401 ms 17672 KB Output is correct
36 Correct 289 ms 16184 KB Output is correct
37 Correct 358 ms 18168 KB Output is correct
38 Correct 322 ms 16120 KB Output is correct
39 Correct 400 ms 17388 KB Output is correct
40 Correct 359 ms 17272 KB Output is correct
41 Correct 75 ms 20040 KB Output is correct
42 Correct 68 ms 20108 KB Output is correct
43 Correct 69 ms 20052 KB Output is correct
44 Correct 110 ms 20088 KB Output is correct
45 Correct 81 ms 20112 KB Output is correct
46 Correct 118 ms 20144 KB Output is correct
47 Correct 89 ms 20088 KB Output is correct
48 Correct 58 ms 20192 KB Output is correct
49 Correct 62 ms 19960 KB Output is correct
50 Correct 67 ms 20088 KB Output is correct
51 Correct 82 ms 20100 KB Output is correct
52 Correct 108 ms 20088 KB Output is correct
53 Correct 63 ms 20088 KB Output is correct
54 Correct 81 ms 20088 KB Output is correct
55 Correct 83 ms 20088 KB Output is correct
56 Correct 55 ms 19960 KB Output is correct
57 Correct 64 ms 20088 KB Output is correct
58 Correct 60 ms 19960 KB Output is correct
59 Correct 76 ms 20068 KB Output is correct
60 Correct 84 ms 20048 KB Output is correct
61 Correct 65 ms 19960 KB Output is correct
62 Correct 111 ms 20088 KB Output is correct
63 Correct 92 ms 19984 KB Output is correct
64 Correct 55 ms 19912 KB Output is correct
65 Correct 86 ms 20216 KB Output is correct
66 Correct 75 ms 20088 KB Output is correct
67 Correct 80 ms 20088 KB Output is correct
68 Correct 79 ms 20008 KB Output is correct
69 Correct 94 ms 20116 KB Output is correct
70 Correct 79 ms 20088 KB Output is correct
71 Correct 530 ms 26112 KB Output is correct
72 Correct 558 ms 26288 KB Output is correct
73 Correct 764 ms 24824 KB Output is correct
74 Correct 918 ms 25132 KB Output is correct
75 Correct 632 ms 27200 KB Output is correct
76 Correct 1279 ms 29592 KB Output is correct
77 Correct 907 ms 24568 KB Output is correct
78 Correct 368 ms 28280 KB Output is correct
79 Correct 378 ms 41336 KB Output is correct
80 Correct 563 ms 26448 KB Output is correct
81 Correct 745 ms 26500 KB Output is correct
82 Correct 1075 ms 25376 KB Output is correct
83 Correct 463 ms 24440 KB Output is correct
84 Correct 613 ms 25248 KB Output is correct
85 Correct 919 ms 25400 KB Output is correct
86 Correct 351 ms 23160 KB Output is correct
87 Correct 485 ms 26232 KB Output is correct
88 Correct 381 ms 23160 KB Output is correct
89 Correct 648 ms 24904 KB Output is correct
90 Correct 712 ms 25200 KB Output is correct
91 Correct 498 ms 24348 KB Output is correct
92 Correct 1120 ms 25632 KB Output is correct
93 Correct 1223 ms 25464 KB Output is correct
94 Correct 361 ms 23288 KB Output is correct
95 Correct 789 ms 25344 KB Output is correct
96 Correct 803 ms 25288 KB Output is correct
97 Correct 788 ms 25260 KB Output is correct
98 Correct 843 ms 25300 KB Output is correct
99 Correct 884 ms 25240 KB Output is correct
100 Correct 870 ms 25576 KB Output is correct