oj.uz

Submission #80255

# Submission time Handle Problem Language Result Execution time Memory
80255 2018-10-19T16:58:28 Z Bodo171 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1031 ms 66560 KB 
#include <cstdio>


using namespace std;
const int nmax=(1<<20);
char s[20],str[nmax];
char t;
char pc[nmax];
int sub[nmax],supra[nmax];
int l,q,i,j,m0,m1,mq,ans,cnt;
char mn;
bool brk;
int main()
{
    //freopen("data.in","r",stdin);
    scanf("%d%d",&l,&q);
    scanf("%s",&str);
    for(i=0;i<(1<<l);i++)
    {
        if(i!=0)
            pc[i]=pc[(i&(i-1))]+1;
        sub[i]=supra[i]=str[i]=str[i]-'0';
    }
    for(i=0;i<l;i++)
        for(j=0;j<(1<<l);j++)
           if(((1<<i)&j))
              sub[j]+=sub[(j^(1<<i))];
            else supra[j]+=supra[(j^(1<<i))];
    for(cnt=1;cnt<=q;cnt++)
    {
        scanf("%s",&s);
        m0=m1=mq=0;
        for(j=l-1;j>=0;j--)
        {
            t=s[l-1-j];
            if(t=='0') m0|=(1<<j);
            else if(t=='1') m1|=(1<<j);
             else mq|=(1<<j);
        }
        mn=pc[m0];
        if(pc[m1]<mn) mn=pc[m1];
        if(pc[mq]<mn) mn=pc[mq];
        ans=0;brk=0;
        if(mn==pc[m0])
        {
            ans=supra[m1];
            i=m0;
            while(i!=0)
            {
                if((pc[i]&1)) ans-=supra[(i|m1)];
                else ans+=supra[(i|m1)];
                i=((i-1)&m0);
            }
        }
        else
        {
            if(mn==pc[m1])
            {
                i=m1;
                while(!brk)
                {
                    if(i==0)
                        brk=1;
                    if(((pc[m1]-pc[i])&1)) ans-=sub[(i|mq)];
                    else ans+=sub[(i|mq)];
                    i=((i-1)&m1);
                }
            }
            else
            {
                    i=mq;
                    while(!brk)
                    {
                        ans+=str[(m1|i)];
                        if(i==0)
                            brk=1;
                        i=((i-1)&mq);
                    }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:17:20: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[1048576]' [-Wformat=]
     scanf("%s",&str);
                ~~~~^
snake_escaping.cpp:31:22: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[20]' [-Wformat=]
         scanf("%s",&s);
                    ~~^
snake_escaping.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&l,&q);
     ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",&str);
     ~~~~~^~~~~~~~~~~
snake_escaping.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s",&s);
         ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 3 ms 628 KB Output is correct
5 Correct 2 ms 628 KB Output is correct
6 Correct 2 ms 736 KB Output is correct
7 Correct 2 ms 736 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 2 ms 736 KB Output is correct
10 Correct 2 ms 736 KB Output is correct
11 Correct 284 ms 10308 KB Output is correct
12 Correct 302 ms 11408 KB Output is correct
13 Correct 323 ms 12848 KB Output is correct
14 Correct 326 ms 13052 KB Output is correct
15 Correct 314 ms 13968 KB Output is correct
16 Correct 343 ms 13968 KB Output is correct
17 Correct 337 ms 16516 KB Output is correct
18 Correct 243 ms 18288 KB Output is correct
19 Correct 268 ms 18288 KB Output is correct
20 Correct 292 ms 18288 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 3 ms 628 KB Output is correct
5 Correct 2 ms 628 KB Output is correct
6 Correct 2 ms 736 KB Output is correct
7 Correct 2 ms 736 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 2 ms 736 KB Output is correct
10 Correct 2 ms 736 KB Output is correct
11 Correct 284 ms 10308 KB Output is correct
12 Correct 302 ms 11408 KB Output is correct
13 Correct 323 ms 12848 KB Output is correct
14 Correct 326 ms 13052 KB Output is correct
15 Correct 314 ms 13968 KB Output is correct
16 Correct 343 ms 13968 KB Output is correct
17 Correct 337 ms 16516 KB Output is correct
18 Correct 243 ms 18288 KB Output is correct
19 Correct 268 ms 18288 KB Output is correct
20 Correct 292 ms 18288 KB Output is correct
21 Correct 340 ms 18288 KB Output is correct
22 Correct 380 ms 18288 KB Output is correct
23 Correct 416 ms 18288 KB Output is correct
24 Correct 422 ms 18288 KB Output is correct
25 Correct 347 ms 18304 KB Output is correct
26 Correct 392 ms 18304 KB Output is correct
27 Correct 396 ms 18304 KB Output is correct
28 Correct 260 ms 19312 KB Output is correct
29 Correct 327 ms 19312 KB Output is correct
30 Correct 341 ms 19312 KB Output is correct
31 Correct 367 ms 19312 KB Output is correct
32 Correct 382 ms 19312 KB Output is correct
33 Correct 397 ms 19312 KB Output is correct
34 Correct 390 ms 19312 KB Output is correct
35 Correct 399 ms 19312 KB Output is correct
36 Correct 263 ms 19312 KB Output is correct
37 Correct 333 ms 19312 KB Output is correct
38 Correct 358 ms 19312 KB Output is correct
39 Correct 365 ms 19312 KB Output is correct
40 Correct 388 ms 19312 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 3 ms 628 KB Output is correct
5 Correct 2 ms 628 KB Output is correct
6 Correct 2 ms 736 KB Output is correct
7 Correct 2 ms 736 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 2 ms 736 KB Output is correct
10 Correct 2 ms 736 KB Output is correct
11 Correct 71 ms 23792 KB Output is correct
12 Correct 72 ms 23792 KB Output is correct
13 Correct 76 ms 23812 KB Output is correct
14 Correct 82 ms 23920 KB Output is correct
15 Correct 78 ms 23920 KB Output is correct
16 Correct 81 ms 23920 KB Output is correct
17 Correct 81 ms 23920 KB Output is correct
18 Correct 59 ms 23920 KB Output is correct
19 Correct 66 ms 23920 KB Output is correct
20 Correct 74 ms 23920 KB Output is correct
21 Correct 75 ms 23920 KB Output is correct
22 Correct 76 ms 23920 KB Output is correct
23 Correct 67 ms 23920 KB Output is correct
24 Correct 81 ms 23920 KB Output is correct
25 Correct 87 ms 23920 KB Output is correct
26 Correct 60 ms 23920 KB Output is correct
27 Correct 69 ms 23920 KB Output is correct
28 Correct 70 ms 23920 KB Output is correct
29 Correct 116 ms 23920 KB Output is correct
30 Correct 88 ms 23920 KB Output is correct
31 Correct 76 ms 23920 KB Output is correct
32 Correct 127 ms 23920 KB Output is correct
33 Correct 90 ms 23920 KB Output is correct
34 Correct 58 ms 23920 KB Output is correct
35 Correct 81 ms 23920 KB Output is correct
36 Correct 79 ms 23920 KB Output is correct
37 Correct 82 ms 23920 KB Output is correct
38 Correct 81 ms 23920 KB Output is correct
39 Correct 90 ms 23920 KB Output is correct
40 Correct 81 ms 23920 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 472 KB Output is correct
4 Correct 3 ms 628 KB Output is correct
5 Correct 2 ms 628 KB Output is correct
6 Correct 2 ms 736 KB Output is correct
7 Correct 2 ms 736 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 2 ms 736 KB Output is correct
10 Correct 2 ms 736 KB Output is correct
11 Correct 284 ms 10308 KB Output is correct
12 Correct 302 ms 11408 KB Output is correct
13 Correct 323 ms 12848 KB Output is correct
14 Correct 326 ms 13052 KB Output is correct
15 Correct 314 ms 13968 KB Output is correct
16 Correct 343 ms 13968 KB Output is correct
17 Correct 337 ms 16516 KB Output is correct
18 Correct 243 ms 18288 KB Output is correct
19 Correct 268 ms 18288 KB Output is correct
20 Correct 292 ms 18288 KB Output is correct
21 Correct 340 ms 18288 KB Output is correct
22 Correct 380 ms 18288 KB Output is correct
23 Correct 416 ms 18288 KB Output is correct
24 Correct 422 ms 18288 KB Output is correct
25 Correct 347 ms 18304 KB Output is correct
26 Correct 392 ms 18304 KB Output is correct
27 Correct 396 ms 18304 KB Output is correct
28 Correct 260 ms 19312 KB Output is correct
29 Correct 327 ms 19312 KB Output is correct
30 Correct 341 ms 19312 KB Output is correct
31 Correct 367 ms 19312 KB Output is correct
32 Correct 382 ms 19312 KB Output is correct
33 Correct 397 ms 19312 KB Output is correct
34 Correct 390 ms 19312 KB Output is correct
35 Correct 399 ms 19312 KB Output is correct
36 Correct 263 ms 19312 KB Output is correct
37 Correct 333 ms 19312 KB Output is correct
38 Correct 358 ms 19312 KB Output is correct
39 Correct 365 ms 19312 KB Output is correct
40 Correct 388 ms 19312 KB Output is correct
41 Correct 71 ms 23792 KB Output is correct
42 Correct 72 ms 23792 KB Output is correct
43 Correct 76 ms 23812 KB Output is correct
44 Correct 82 ms 23920 KB Output is correct
45 Correct 78 ms 23920 KB Output is correct
46 Correct 81 ms 23920 KB Output is correct
47 Correct 81 ms 23920 KB Output is correct
48 Correct 59 ms 23920 KB Output is correct
49 Correct 66 ms 23920 KB Output is correct
50 Correct 74 ms 23920 KB Output is correct
51 Correct 75 ms 23920 KB Output is correct
52 Correct 76 ms 23920 KB Output is correct
53 Correct 67 ms 23920 KB Output is correct
54 Correct 81 ms 23920 KB Output is correct
55 Correct 87 ms 23920 KB Output is correct
56 Correct 60 ms 23920 KB Output is correct
57 Correct 69 ms 23920 KB Output is correct
58 Correct 70 ms 23920 KB Output is correct
59 Correct 116 ms 23920 KB Output is correct
60 Correct 88 ms 23920 KB Output is correct
61 Correct 76 ms 23920 KB Output is correct
62 Correct 127 ms 23920 KB Output is correct
63 Correct 90 ms 23920 KB Output is correct
64 Correct 58 ms 23920 KB Output is correct
65 Correct 81 ms 23920 KB Output is correct
66 Correct 79 ms 23920 KB Output is correct
67 Correct 82 ms 23920 KB Output is correct
68 Correct 81 ms 23920 KB Output is correct
69 Correct 90 ms 23920 KB Output is correct
70 Correct 81 ms 23920 KB Output is correct
71 Correct 582 ms 28252 KB Output is correct
72 Correct 575 ms 28404 KB Output is correct
73 Correct 691 ms 28404 KB Output is correct
74 Correct 867 ms 28704 KB Output is correct
75 Correct 570 ms 31256 KB Output is correct
76 Correct 927 ms 31256 KB Output is correct
77 Correct 935 ms 31256 KB Output is correct
78 Correct 350 ms 33296 KB Output is correct
79 Correct 521 ms 33296 KB Output is correct
80 Correct 590 ms 33296 KB Output is correct
81 Correct 783 ms 33296 KB Output is correct
82 Correct 763 ms 33296 KB Output is correct
83 Correct 576 ms 33296 KB Output is correct
84 Correct 953 ms 33296 KB Output is correct
85 Correct 943 ms 33296 KB Output is correct
86 Correct 363 ms 33296 KB Output is correct
87 Correct 538 ms 33296 KB Output is correct
88 Correct 528 ms 33296 KB Output is correct
89 Correct 656 ms 33296 KB Output is correct
90 Correct 668 ms 33296 KB Output is correct
91 Correct 537 ms 33296 KB Output is correct
92 Correct 1031 ms 33296 KB Output is correct
93 Correct 867 ms 53912 KB Output is correct
94 Runtime error 355 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
95 Halted 0 ms 0 KB -