oj.uz

Submission #80247

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


using namespace std;
const int nmax=(1<<20)+5;
char s[22],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+=(int)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 (*)[1048581]' [-Wformat=]
     scanf("%s",&str);
                ~~~~^
snake_escaping.cpp:31:22: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[22]' [-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 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 644 KB Output is correct
6 Correct 4 ms 800 KB Output is correct
7 Correct 4 ms 800 KB Output is correct
8 Correct 2 ms 800 KB Output is correct
9 Correct 2 ms 800 KB Output is correct
10 Correct 2 ms 800 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 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 644 KB Output is correct
6 Correct 4 ms 800 KB Output is correct
7 Correct 4 ms 800 KB Output is correct
8 Correct 2 ms 800 KB Output is correct
9 Correct 2 ms 800 KB Output is correct
10 Correct 2 ms 800 KB Output is correct
11 Correct 265 ms 6116 KB Output is correct
12 Correct 309 ms 6116 KB Output is correct
13 Correct 326 ms 6116 KB Output is correct
14 Correct 336 ms 6116 KB Output is correct
15 Correct 310 ms 6420 KB Output is correct
16 Correct 351 ms 6420 KB Output is correct
17 Correct 362 ms 6420 KB Output is correct
18 Correct 264 ms 8152 KB Output is correct
19 Correct 275 ms 8152 KB Output is correct
20 Correct 309 ms 8152 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 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 644 KB Output is correct
6 Correct 4 ms 800 KB Output is correct
7 Correct 4 ms 800 KB Output is correct
8 Correct 2 ms 800 KB Output is correct
9 Correct 2 ms 800 KB Output is correct
10 Correct 2 ms 800 KB Output is correct
11 Correct 265 ms 6116 KB Output is correct
12 Correct 309 ms 6116 KB Output is correct
13 Correct 326 ms 6116 KB Output is correct
14 Correct 336 ms 6116 KB Output is correct
15 Correct 310 ms 6420 KB Output is correct
16 Correct 351 ms 6420 KB Output is correct
17 Correct 362 ms 6420 KB Output is correct
18 Correct 264 ms 8152 KB Output is correct
19 Correct 275 ms 8152 KB Output is correct
20 Correct 309 ms 8152 KB Output is correct
21 Correct 335 ms 8152 KB Output is correct
22 Correct 373 ms 8664 KB Output is correct
23 Correct 526 ms 8664 KB Output is correct
24 Correct 440 ms 8664 KB Output is correct
25 Correct 373 ms 10504 KB Output is correct
26 Correct 442 ms 10504 KB Output is correct
27 Correct 419 ms 10504 KB Output is correct
28 Correct 273 ms 12200 KB Output is correct
29 Correct 339 ms 12200 KB Output is correct
30 Correct 380 ms 12200 KB Output is correct
31 Correct 375 ms 12200 KB Output is correct
32 Correct 429 ms 12200 KB Output is correct
33 Correct 369 ms 12200 KB Output is correct
34 Correct 415 ms 12200 KB Output is correct
35 Correct 416 ms 12200 KB Output is correct
36 Correct 301 ms 12200 KB Output is correct
37 Correct 334 ms 12916 KB Output is correct
38 Correct 343 ms 12916 KB Output is correct
39 Correct 473 ms 12916 KB Output is correct
40 Correct 402 ms 12916 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 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 644 KB Output is correct
6 Correct 4 ms 800 KB Output is correct
7 Correct 4 ms 800 KB Output is correct
8 Correct 2 ms 800 KB Output is correct
9 Correct 2 ms 800 KB Output is correct
10 Correct 2 ms 800 KB Output is correct
11 Correct 78 ms 19376 KB Output is correct
12 Correct 75 ms 19504 KB Output is correct
13 Correct 80 ms 19616 KB Output is correct
14 Correct 92 ms 20236 KB Output is correct
15 Correct 73 ms 20304 KB Output is correct
16 Correct 91 ms 20304 KB Output is correct
17 Correct 90 ms 20304 KB Output is correct
18 Correct 65 ms 20468 KB Output is correct
19 Correct 69 ms 20468 KB Output is correct
20 Correct 78 ms 20468 KB Output is correct
21 Correct 79 ms 20468 KB Output is correct
22 Correct 84 ms 20468 KB Output is correct
23 Correct 74 ms 20468 KB Output is correct
24 Correct 94 ms 20468 KB Output is correct
25 Correct 90 ms 20468 KB Output is correct
26 Correct 59 ms 20468 KB Output is correct
27 Correct 72 ms 20468 KB Output is correct
28 Correct 72 ms 20468 KB Output is correct
29 Correct 76 ms 20468 KB Output is correct
30 Correct 73 ms 20468 KB Output is correct
31 Correct 69 ms 20468 KB Output is correct
32 Correct 95 ms 20468 KB Output is correct
33 Correct 87 ms 20468 KB Output is correct
34 Correct 58 ms 20468 KB Output is correct
35 Correct 80 ms 20468 KB Output is correct
36 Correct 85 ms 20468 KB Output is correct
37 Correct 81 ms 20468 KB Output is correct
38 Correct 85 ms 20468 KB Output is correct
39 Correct 91 ms 20468 KB Output is correct
40 Correct 84 ms 20468 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 376 KB Output is correct
3 Correct 2 ms 448 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 644 KB Output is correct
6 Correct 4 ms 800 KB Output is correct
7 Correct 4 ms 800 KB Output is correct
8 Correct 2 ms 800 KB Output is correct
9 Correct 2 ms 800 KB Output is correct
10 Correct 2 ms 800 KB Output is correct
11 Correct 265 ms 6116 KB Output is correct
12 Correct 309 ms 6116 KB Output is correct
13 Correct 326 ms 6116 KB Output is correct
14 Correct 336 ms 6116 KB Output is correct
15 Correct 310 ms 6420 KB Output is correct
16 Correct 351 ms 6420 KB Output is correct
17 Correct 362 ms 6420 KB Output is correct
18 Correct 264 ms 8152 KB Output is correct
19 Correct 275 ms 8152 KB Output is correct
20 Correct 309 ms 8152 KB Output is correct
21 Correct 335 ms 8152 KB Output is correct
22 Correct 373 ms 8664 KB Output is correct
23 Correct 526 ms 8664 KB Output is correct
24 Correct 440 ms 8664 KB Output is correct
25 Correct 373 ms 10504 KB Output is correct
26 Correct 442 ms 10504 KB Output is correct
27 Correct 419 ms 10504 KB Output is correct
28 Correct 273 ms 12200 KB Output is correct
29 Correct 339 ms 12200 KB Output is correct
30 Correct 380 ms 12200 KB Output is correct
31 Correct 375 ms 12200 KB Output is correct
32 Correct 429 ms 12200 KB Output is correct
33 Correct 369 ms 12200 KB Output is correct
34 Correct 415 ms 12200 KB Output is correct
35 Correct 416 ms 12200 KB Output is correct
36 Correct 301 ms 12200 KB Output is correct
37 Correct 334 ms 12916 KB Output is correct
38 Correct 343 ms 12916 KB Output is correct
39 Correct 473 ms 12916 KB Output is correct
40 Correct 402 ms 12916 KB Output is correct
41 Correct 78 ms 19376 KB Output is correct
42 Correct 75 ms 19504 KB Output is correct
43 Correct 80 ms 19616 KB Output is correct
44 Correct 92 ms 20236 KB Output is correct
45 Correct 73 ms 20304 KB Output is correct
46 Correct 91 ms 20304 KB Output is correct
47 Correct 90 ms 20304 KB Output is correct
48 Correct 65 ms 20468 KB Output is correct
49 Correct 69 ms 20468 KB Output is correct
50 Correct 78 ms 20468 KB Output is correct
51 Correct 79 ms 20468 KB Output is correct
52 Correct 84 ms 20468 KB Output is correct
53 Correct 74 ms 20468 KB Output is correct
54 Correct 94 ms 20468 KB Output is correct
55 Correct 90 ms 20468 KB Output is correct
56 Correct 59 ms 20468 KB Output is correct
57 Correct 72 ms 20468 KB Output is correct
58 Correct 72 ms 20468 KB Output is correct
59 Correct 76 ms 20468 KB Output is correct
60 Correct 73 ms 20468 KB Output is correct
61 Correct 69 ms 20468 KB Output is correct
62 Correct 95 ms 20468 KB Output is correct
63 Correct 87 ms 20468 KB Output is correct
64 Correct 58 ms 20468 KB Output is correct
65 Correct 80 ms 20468 KB Output is correct
66 Correct 85 ms 20468 KB Output is correct
67 Correct 81 ms 20468 KB Output is correct
68 Correct 85 ms 20468 KB Output is correct
69 Correct 91 ms 20468 KB Output is correct
70 Correct 84 ms 20468 KB Output is correct
71 Correct 544 ms 24904 KB Output is correct
72 Correct 567 ms 25224 KB Output is correct
73 Correct 681 ms 25224 KB Output is correct
74 Correct 824 ms 25224 KB Output is correct
75 Correct 539 ms 27672 KB Output is correct
76 Correct 962 ms 27672 KB Output is correct
77 Correct 962 ms 27672 KB Output is correct
78 Correct 383 ms 29588 KB Output is correct
79 Correct 497 ms 29588 KB Output is correct
80 Correct 582 ms 29588 KB Output is correct
81 Correct 703 ms 29588 KB Output is correct
82 Correct 736 ms 29588 KB Output is correct
83 Correct 565 ms 48324 KB Output is correct
84 Correct 963 ms 49288 KB Output is correct
85 Correct 923 ms 49340 KB Output is correct
86 Runtime error 370 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.
87 Halted 0 ms 0 KB -