oj.uz

Submission #80257

# Submission time Handle Problem Language Result Execution time Memory
80257 2018-10-19T16:59:40 Z Bodo171 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 995 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 3 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 664 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 262 ms 5408 KB Output is correct
12 Correct 286 ms 5508 KB Output is correct
13 Correct 318 ms 6348 KB Output is correct
14 Correct 333 ms 6424 KB Output is correct
15 Correct 319 ms 7440 KB Output is correct
16 Correct 346 ms 7440 KB Output is correct
17 Correct 338 ms 8060 KB Output is correct
18 Correct 237 ms 9944 KB Output is correct
19 Correct 260 ms 9944 KB Output is correct
20 Correct 308 ms 9944 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 262 ms 5408 KB Output is correct
12 Correct 286 ms 5508 KB Output is correct
13 Correct 318 ms 6348 KB Output is correct
14 Correct 333 ms 6424 KB Output is correct
15 Correct 319 ms 7440 KB Output is correct
16 Correct 346 ms 7440 KB Output is correct
17 Correct 338 ms 8060 KB Output is correct
18 Correct 237 ms 9944 KB Output is correct
19 Correct 260 ms 9944 KB Output is correct
20 Correct 308 ms 9944 KB Output is correct
21 Correct 334 ms 9944 KB Output is correct
22 Correct 349 ms 10676 KB Output is correct
23 Correct 387 ms 10676 KB Output is correct
24 Correct 411 ms 10676 KB Output is correct
25 Correct 405 ms 11916 KB Output is correct
26 Correct 617 ms 11916 KB Output is correct
27 Correct 436 ms 11916 KB Output is correct
28 Correct 256 ms 13376 KB Output is correct
29 Correct 340 ms 13376 KB Output is correct
30 Correct 339 ms 13376 KB Output is correct
31 Correct 367 ms 13376 KB Output is correct
32 Correct 398 ms 13376 KB Output is correct
33 Correct 360 ms 13376 KB Output is correct
34 Correct 410 ms 13376 KB Output is correct
35 Correct 427 ms 13376 KB Output is correct
36 Correct 239 ms 13376 KB Output is correct
37 Correct 332 ms 13668 KB Output is correct
38 Correct 341 ms 13668 KB Output is correct
39 Correct 381 ms 13668 KB Output is correct
40 Correct 385 ms 13668 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 65 ms 20120 KB Output is correct
12 Correct 66 ms 20120 KB Output is correct
13 Correct 73 ms 20120 KB Output is correct
14 Correct 89 ms 20120 KB Output is correct
15 Correct 67 ms 20376 KB Output is correct
16 Correct 93 ms 20604 KB Output is correct
17 Correct 95 ms 20612 KB Output is correct
18 Correct 64 ms 20796 KB Output is correct
19 Correct 71 ms 20796 KB Output is correct
20 Correct 106 ms 20796 KB Output is correct
21 Correct 77 ms 20796 KB Output is correct
22 Correct 107 ms 20796 KB Output is correct
23 Correct 69 ms 20796 KB Output is correct
24 Correct 104 ms 20796 KB Output is correct
25 Correct 82 ms 20796 KB Output is correct
26 Correct 67 ms 20796 KB Output is correct
27 Correct 65 ms 20796 KB Output is correct
28 Correct 70 ms 20796 KB Output is correct
29 Correct 73 ms 20796 KB Output is correct
30 Correct 73 ms 20796 KB Output is correct
31 Correct 67 ms 20796 KB Output is correct
32 Correct 84 ms 20796 KB Output is correct
33 Correct 82 ms 20796 KB Output is correct
34 Correct 57 ms 20796 KB Output is correct
35 Correct 74 ms 20796 KB Output is correct
36 Correct 83 ms 20796 KB Output is correct
37 Correct 83 ms 20796 KB Output is correct
38 Correct 79 ms 20796 KB Output is correct
39 Correct 80 ms 20796 KB Output is correct
40 Correct 83 ms 20796 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 528 KB Output is correct
5 Correct 2 ms 540 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 262 ms 5408 KB Output is correct
12 Correct 286 ms 5508 KB Output is correct
13 Correct 318 ms 6348 KB Output is correct
14 Correct 333 ms 6424 KB Output is correct
15 Correct 319 ms 7440 KB Output is correct
16 Correct 346 ms 7440 KB Output is correct
17 Correct 338 ms 8060 KB Output is correct
18 Correct 237 ms 9944 KB Output is correct
19 Correct 260 ms 9944 KB Output is correct
20 Correct 308 ms 9944 KB Output is correct
21 Correct 334 ms 9944 KB Output is correct
22 Correct 349 ms 10676 KB Output is correct
23 Correct 387 ms 10676 KB Output is correct
24 Correct 411 ms 10676 KB Output is correct
25 Correct 405 ms 11916 KB Output is correct
26 Correct 617 ms 11916 KB Output is correct
27 Correct 436 ms 11916 KB Output is correct
28 Correct 256 ms 13376 KB Output is correct
29 Correct 340 ms 13376 KB Output is correct
30 Correct 339 ms 13376 KB Output is correct
31 Correct 367 ms 13376 KB Output is correct
32 Correct 398 ms 13376 KB Output is correct
33 Correct 360 ms 13376 KB Output is correct
34 Correct 410 ms 13376 KB Output is correct
35 Correct 427 ms 13376 KB Output is correct
36 Correct 239 ms 13376 KB Output is correct
37 Correct 332 ms 13668 KB Output is correct
38 Correct 341 ms 13668 KB Output is correct
39 Correct 381 ms 13668 KB Output is correct
40 Correct 385 ms 13668 KB Output is correct
41 Correct 65 ms 20120 KB Output is correct
42 Correct 66 ms 20120 KB Output is correct
43 Correct 73 ms 20120 KB Output is correct
44 Correct 89 ms 20120 KB Output is correct
45 Correct 67 ms 20376 KB Output is correct
46 Correct 93 ms 20604 KB Output is correct
47 Correct 95 ms 20612 KB Output is correct
48 Correct 64 ms 20796 KB Output is correct
49 Correct 71 ms 20796 KB Output is correct
50 Correct 106 ms 20796 KB Output is correct
51 Correct 77 ms 20796 KB Output is correct
52 Correct 107 ms 20796 KB Output is correct
53 Correct 69 ms 20796 KB Output is correct
54 Correct 104 ms 20796 KB Output is correct
55 Correct 82 ms 20796 KB Output is correct
56 Correct 67 ms 20796 KB Output is correct
57 Correct 65 ms 20796 KB Output is correct
58 Correct 70 ms 20796 KB Output is correct
59 Correct 73 ms 20796 KB Output is correct
60 Correct 73 ms 20796 KB Output is correct
61 Correct 67 ms 20796 KB Output is correct
62 Correct 84 ms 20796 KB Output is correct
63 Correct 82 ms 20796 KB Output is correct
64 Correct 57 ms 20796 KB Output is correct
65 Correct 74 ms 20796 KB Output is correct
66 Correct 83 ms 20796 KB Output is correct
67 Correct 83 ms 20796 KB Output is correct
68 Correct 79 ms 20796 KB Output is correct
69 Correct 80 ms 20796 KB Output is correct
70 Correct 83 ms 20796 KB Output is correct
71 Correct 521 ms 25444 KB Output is correct
72 Correct 530 ms 25484 KB Output is correct
73 Correct 576 ms 25484 KB Output is correct
74 Correct 756 ms 25484 KB Output is correct
75 Correct 530 ms 26360 KB Output is correct
76 Correct 817 ms 26360 KB Output is correct
77 Correct 788 ms 26360 KB Output is correct
78 Correct 354 ms 28308 KB Output is correct
79 Correct 445 ms 28308 KB Output is correct
80 Correct 550 ms 28308 KB Output is correct
81 Correct 645 ms 28308 KB Output is correct
82 Correct 855 ms 28308 KB Output is correct
83 Correct 558 ms 28308 KB Output is correct
84 Correct 908 ms 28308 KB Output is correct
85 Correct 850 ms 28308 KB Output is correct
86 Correct 365 ms 28308 KB Output is correct
87 Correct 593 ms 28308 KB Output is correct
88 Correct 603 ms 28308 KB Output is correct
89 Correct 704 ms 28308 KB Output is correct
90 Correct 623 ms 28308 KB Output is correct
91 Correct 548 ms 28308 KB Output is correct
92 Correct 995 ms 28308 KB Output is correct
93 Correct 907 ms 46192 KB Output is correct
94 Correct 355 ms 46192 KB Output is correct
95 Runtime error 808 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.
96 Halted 0 ms 0 KB -