oj.uz

Submission #80211

# Submission time Handle Problem Language Result Execution time Memory
80211 2018-10-19T14:37:59 Z Bodo171 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 983 ms 66560 KB 
#include <cstdio>
#include <iostream>

using namespace std;
const int nmax=(1<<20)+5;
char s[22],str[nmax];
char t;
char pc[nmax],v[nmax];
int sub[nmax],supra[nmax];
int l,q,i,j,m0,m1,mq,mn,ans;
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]=v[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(int 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=min(min(pc[m0],pc[m1]),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+=v[(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:16:20: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[1048581]' [-Wformat=]
     scanf("%s",&str);
                ~~~~^
snake_escaping.cpp:30:22: warning: format '%s' expects argument of type 'char*', but argument 2 has type 'char (*)[22]' [-Wformat=]
         scanf("%s",&s);
                    ~~^
snake_escaping.cpp:15: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:16:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",&str);
     ~~~~~^~~~~~~~~~~
snake_escaping.cpp:30: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 512 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 3 ms 728 KB Output is correct
8 Correct 2 ms 728 KB Output is correct
9 Correct 3 ms 728 KB Output is correct
10 Correct 3 ms 728 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 512 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 3 ms 728 KB Output is correct
8 Correct 2 ms 728 KB Output is correct
9 Correct 3 ms 728 KB Output is correct
10 Correct 3 ms 728 KB Output is correct
11 Correct 308 ms 5136 KB Output is correct
12 Correct 424 ms 5420 KB Output is correct
13 Correct 334 ms 5420 KB Output is correct
14 Correct 352 ms 5420 KB Output is correct
15 Correct 345 ms 5844 KB Output is correct
16 Correct 352 ms 5844 KB Output is correct
17 Correct 352 ms 5844 KB Output is correct
18 Correct 259 ms 6864 KB Output is correct
19 Correct 294 ms 6864 KB Output is correct
20 Correct 322 ms 6864 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 512 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 3 ms 728 KB Output is correct
8 Correct 2 ms 728 KB Output is correct
9 Correct 3 ms 728 KB Output is correct
10 Correct 3 ms 728 KB Output is correct
11 Correct 308 ms 5136 KB Output is correct
12 Correct 424 ms 5420 KB Output is correct
13 Correct 334 ms 5420 KB Output is correct
14 Correct 352 ms 5420 KB Output is correct
15 Correct 345 ms 5844 KB Output is correct
16 Correct 352 ms 5844 KB Output is correct
17 Correct 352 ms 5844 KB Output is correct
18 Correct 259 ms 6864 KB Output is correct
19 Correct 294 ms 6864 KB Output is correct
20 Correct 322 ms 6864 KB Output is correct
21 Correct 354 ms 6864 KB Output is correct
22 Correct 363 ms 6864 KB Output is correct
23 Correct 401 ms 6864 KB Output is correct
24 Correct 401 ms 6864 KB Output is correct
25 Correct 362 ms 7016 KB Output is correct
26 Correct 430 ms 7016 KB Output is correct
27 Correct 399 ms 7016 KB Output is correct
28 Correct 282 ms 7984 KB Output is correct
29 Correct 352 ms 7984 KB Output is correct
30 Correct 333 ms 7984 KB Output is correct
31 Correct 387 ms 7984 KB Output is correct
32 Correct 414 ms 7984 KB Output is correct
33 Correct 399 ms 7984 KB Output is correct
34 Correct 403 ms 7984 KB Output is correct
35 Correct 419 ms 7984 KB Output is correct
36 Correct 251 ms 7984 KB Output is correct
37 Correct 332 ms 7984 KB Output is correct
38 Correct 362 ms 7984 KB Output is correct
39 Correct 385 ms 7984 KB Output is correct
40 Correct 429 ms 7984 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 512 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 3 ms 728 KB Output is correct
8 Correct 2 ms 728 KB Output is correct
9 Correct 3 ms 728 KB Output is correct
10 Correct 3 ms 728 KB Output is correct
11 Correct 68 ms 14320 KB Output is correct
12 Correct 72 ms 14612 KB Output is correct
13 Correct 77 ms 14612 KB Output is correct
14 Correct 155 ms 14624 KB Output is correct
15 Correct 70 ms 14760 KB Output is correct
16 Correct 89 ms 14760 KB Output is correct
17 Correct 88 ms 14760 KB Output is correct
18 Correct 62 ms 14796 KB Output is correct
19 Correct 69 ms 14796 KB Output is correct
20 Correct 73 ms 14796 KB Output is correct
21 Correct 82 ms 14796 KB Output is correct
22 Correct 83 ms 14796 KB Output is correct
23 Correct 77 ms 14796 KB Output is correct
24 Correct 94 ms 14796 KB Output is correct
25 Correct 121 ms 14796 KB Output is correct
26 Correct 62 ms 14796 KB Output is correct
27 Correct 73 ms 14796 KB Output is correct
28 Correct 69 ms 14796 KB Output is correct
29 Correct 76 ms 14796 KB Output is correct
30 Correct 77 ms 14796 KB Output is correct
31 Correct 76 ms 14796 KB Output is correct
32 Correct 97 ms 14796 KB Output is correct
33 Correct 102 ms 14796 KB Output is correct
34 Correct 66 ms 14796 KB Output is correct
35 Correct 83 ms 14796 KB Output is correct
36 Correct 85 ms 14796 KB Output is correct
37 Correct 86 ms 14796 KB Output is correct
38 Correct 87 ms 14796 KB Output is correct
39 Correct 82 ms 14796 KB Output is correct
40 Correct 83 ms 14796 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 512 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 3 ms 728 KB Output is correct
8 Correct 2 ms 728 KB Output is correct
9 Correct 3 ms 728 KB Output is correct
10 Correct 3 ms 728 KB Output is correct
11 Correct 308 ms 5136 KB Output is correct
12 Correct 424 ms 5420 KB Output is correct
13 Correct 334 ms 5420 KB Output is correct
14 Correct 352 ms 5420 KB Output is correct
15 Correct 345 ms 5844 KB Output is correct
16 Correct 352 ms 5844 KB Output is correct
17 Correct 352 ms 5844 KB Output is correct
18 Correct 259 ms 6864 KB Output is correct
19 Correct 294 ms 6864 KB Output is correct
20 Correct 322 ms 6864 KB Output is correct
21 Correct 354 ms 6864 KB Output is correct
22 Correct 363 ms 6864 KB Output is correct
23 Correct 401 ms 6864 KB Output is correct
24 Correct 401 ms 6864 KB Output is correct
25 Correct 362 ms 7016 KB Output is correct
26 Correct 430 ms 7016 KB Output is correct
27 Correct 399 ms 7016 KB Output is correct
28 Correct 282 ms 7984 KB Output is correct
29 Correct 352 ms 7984 KB Output is correct
30 Correct 333 ms 7984 KB Output is correct
31 Correct 387 ms 7984 KB Output is correct
32 Correct 414 ms 7984 KB Output is correct
33 Correct 399 ms 7984 KB Output is correct
34 Correct 403 ms 7984 KB Output is correct
35 Correct 419 ms 7984 KB Output is correct
36 Correct 251 ms 7984 KB Output is correct
37 Correct 332 ms 7984 KB Output is correct
38 Correct 362 ms 7984 KB Output is correct
39 Correct 385 ms 7984 KB Output is correct
40 Correct 429 ms 7984 KB Output is correct
41 Correct 68 ms 14320 KB Output is correct
42 Correct 72 ms 14612 KB Output is correct
43 Correct 77 ms 14612 KB Output is correct
44 Correct 155 ms 14624 KB Output is correct
45 Correct 70 ms 14760 KB Output is correct
46 Correct 89 ms 14760 KB Output is correct
47 Correct 88 ms 14760 KB Output is correct
48 Correct 62 ms 14796 KB Output is correct
49 Correct 69 ms 14796 KB Output is correct
50 Correct 73 ms 14796 KB Output is correct
51 Correct 82 ms 14796 KB Output is correct
52 Correct 83 ms 14796 KB Output is correct
53 Correct 77 ms 14796 KB Output is correct
54 Correct 94 ms 14796 KB Output is correct
55 Correct 121 ms 14796 KB Output is correct
56 Correct 62 ms 14796 KB Output is correct
57 Correct 73 ms 14796 KB Output is correct
58 Correct 69 ms 14796 KB Output is correct
59 Correct 76 ms 14796 KB Output is correct
60 Correct 77 ms 14796 KB Output is correct
61 Correct 76 ms 14796 KB Output is correct
62 Correct 97 ms 14796 KB Output is correct
63 Correct 102 ms 14796 KB Output is correct
64 Correct 66 ms 14796 KB Output is correct
65 Correct 83 ms 14796 KB Output is correct
66 Correct 85 ms 14796 KB Output is correct
67 Correct 86 ms 14796 KB Output is correct
68 Correct 87 ms 14796 KB Output is correct
69 Correct 82 ms 14796 KB Output is correct
70 Correct 83 ms 14796 KB Output is correct
71 Correct 582 ms 40944 KB Output is correct
72 Correct 611 ms 46420 KB Output is correct
73 Correct 837 ms 60988 KB Output is correct
74 Correct 910 ms 61448 KB Output is correct
75 Correct 610 ms 63276 KB Output is correct
76 Runtime error 983 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.
77 Halted 0 ms 0 KB -