답안 #80251 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
80251	2018-10-19T16:47:26 Z	Bodo171	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	1020 ms	66560 KB

snake_escaping

#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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	456 KB	Output is correct
3	Correct	3 ms	456 KB	Output is correct
4	Correct	2 ms	492 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	3 ms	516 KB	Output is correct
7	Correct	2 ms	528 KB	Output is correct
8	Correct	3 ms	588 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	2 ms	752 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	456 KB	Output is correct
3	Correct	3 ms	456 KB	Output is correct
4	Correct	2 ms	492 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	3 ms	516 KB	Output is correct
7	Correct	2 ms	528 KB	Output is correct
8	Correct	3 ms	588 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	2 ms	752 KB	Output is correct
11	Correct	295 ms	6864 KB	Output is correct
12	Correct	432 ms	6864 KB	Output is correct
13	Correct	340 ms	6864 KB	Output is correct
14	Correct	351 ms	6864 KB	Output is correct
15	Correct	305 ms	7676 KB	Output is correct
16	Correct	336 ms	7676 KB	Output is correct
17	Correct	349 ms	8460 KB	Output is correct
18	Correct	243 ms	10076 KB	Output is correct
19	Correct	274 ms	10076 KB	Output is correct
20	Correct	316 ms	10076 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	456 KB	Output is correct
3	Correct	3 ms	456 KB	Output is correct
4	Correct	2 ms	492 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	3 ms	516 KB	Output is correct
7	Correct	2 ms	528 KB	Output is correct
8	Correct	3 ms	588 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	2 ms	752 KB	Output is correct
11	Correct	295 ms	6864 KB	Output is correct
12	Correct	432 ms	6864 KB	Output is correct
13	Correct	340 ms	6864 KB	Output is correct
14	Correct	351 ms	6864 KB	Output is correct
15	Correct	305 ms	7676 KB	Output is correct
16	Correct	336 ms	7676 KB	Output is correct
17	Correct	349 ms	8460 KB	Output is correct
18	Correct	243 ms	10076 KB	Output is correct
19	Correct	274 ms	10076 KB	Output is correct
20	Correct	316 ms	10076 KB	Output is correct
21	Correct	353 ms	10076 KB	Output is correct
22	Correct	362 ms	10076 KB	Output is correct
23	Correct	403 ms	10076 KB	Output is correct
24	Correct	426 ms	10076 KB	Output is correct
25	Correct	380 ms	10696 KB	Output is correct
26	Correct	426 ms	10696 KB	Output is correct
27	Correct	429 ms	10696 KB	Output is correct
28	Correct	285 ms	12108 KB	Output is correct
29	Correct	329 ms	12108 KB	Output is correct
30	Correct	359 ms	12108 KB	Output is correct
31	Correct	394 ms	12108 KB	Output is correct
32	Correct	402 ms	12108 KB	Output is correct
33	Correct	385 ms	12108 KB	Output is correct
34	Correct	416 ms	12108 KB	Output is correct
35	Correct	407 ms	12108 KB	Output is correct
36	Correct	269 ms	12108 KB	Output is correct
37	Correct	333 ms	12108 KB	Output is correct
38	Correct	373 ms	12108 KB	Output is correct
39	Correct	406 ms	12108 KB	Output is correct
40	Correct	416 ms	12108 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	456 KB	Output is correct
3	Correct	3 ms	456 KB	Output is correct
4	Correct	2 ms	492 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	3 ms	516 KB	Output is correct
7	Correct	2 ms	528 KB	Output is correct
8	Correct	3 ms	588 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	2 ms	752 KB	Output is correct
11	Correct	68 ms	17628 KB	Output is correct
12	Correct	72 ms	17628 KB	Output is correct
13	Correct	89 ms	17632 KB	Output is correct
14	Correct	87 ms	17756 KB	Output is correct
15	Correct	68 ms	18056 KB	Output is correct
16	Correct	84 ms	18088 KB	Output is correct
17	Correct	87 ms	18092 KB	Output is correct
18	Correct	69 ms	18204 KB	Output is correct
19	Correct	74 ms	18204 KB	Output is correct
20	Correct	68 ms	18204 KB	Output is correct
21	Correct	80 ms	18204 KB	Output is correct
22	Correct	81 ms	18204 KB	Output is correct
23	Correct	68 ms	18204 KB	Output is correct
24	Correct	85 ms	18204 KB	Output is correct
25	Correct	95 ms	18204 KB	Output is correct
26	Correct	64 ms	18204 KB	Output is correct
27	Correct	71 ms	18204 KB	Output is correct
28	Correct	68 ms	18204 KB	Output is correct
29	Correct	79 ms	18204 KB	Output is correct
30	Correct	82 ms	18204 KB	Output is correct
31	Correct	77 ms	18204 KB	Output is correct
32	Correct	88 ms	18204 KB	Output is correct
33	Correct	84 ms	18204 KB	Output is correct
34	Correct	62 ms	18204 KB	Output is correct
35	Correct	86 ms	18204 KB	Output is correct
36	Correct	85 ms	18204 KB	Output is correct
37	Correct	78 ms	18204 KB	Output is correct
38	Correct	82 ms	18204 KB	Output is correct
39	Correct	84 ms	18204 KB	Output is correct
40	Correct	80 ms	18204 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	456 KB	Output is correct
3	Correct	3 ms	456 KB	Output is correct
4	Correct	2 ms	492 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	3 ms	516 KB	Output is correct
7	Correct	2 ms	528 KB	Output is correct
8	Correct	3 ms	588 KB	Output is correct
9	Correct	2 ms	600 KB	Output is correct
10	Correct	2 ms	752 KB	Output is correct
11	Correct	295 ms	6864 KB	Output is correct
12	Correct	432 ms	6864 KB	Output is correct
13	Correct	340 ms	6864 KB	Output is correct
14	Correct	351 ms	6864 KB	Output is correct
15	Correct	305 ms	7676 KB	Output is correct
16	Correct	336 ms	7676 KB	Output is correct
17	Correct	349 ms	8460 KB	Output is correct
18	Correct	243 ms	10076 KB	Output is correct
19	Correct	274 ms	10076 KB	Output is correct
20	Correct	316 ms	10076 KB	Output is correct
21	Correct	353 ms	10076 KB	Output is correct
22	Correct	362 ms	10076 KB	Output is correct
23	Correct	403 ms	10076 KB	Output is correct
24	Correct	426 ms	10076 KB	Output is correct
25	Correct	380 ms	10696 KB	Output is correct
26	Correct	426 ms	10696 KB	Output is correct
27	Correct	429 ms	10696 KB	Output is correct
28	Correct	285 ms	12108 KB	Output is correct
29	Correct	329 ms	12108 KB	Output is correct
30	Correct	359 ms	12108 KB	Output is correct
31	Correct	394 ms	12108 KB	Output is correct
32	Correct	402 ms	12108 KB	Output is correct
33	Correct	385 ms	12108 KB	Output is correct
34	Correct	416 ms	12108 KB	Output is correct
35	Correct	407 ms	12108 KB	Output is correct
36	Correct	269 ms	12108 KB	Output is correct
37	Correct	333 ms	12108 KB	Output is correct
38	Correct	373 ms	12108 KB	Output is correct
39	Correct	406 ms	12108 KB	Output is correct
40	Correct	416 ms	12108 KB	Output is correct
41	Correct	68 ms	17628 KB	Output is correct
42	Correct	72 ms	17628 KB	Output is correct
43	Correct	89 ms	17632 KB	Output is correct
44	Correct	87 ms	17756 KB	Output is correct
45	Correct	68 ms	18056 KB	Output is correct
46	Correct	84 ms	18088 KB	Output is correct
47	Correct	87 ms	18092 KB	Output is correct
48	Correct	69 ms	18204 KB	Output is correct
49	Correct	74 ms	18204 KB	Output is correct
50	Correct	68 ms	18204 KB	Output is correct
51	Correct	80 ms	18204 KB	Output is correct
52	Correct	81 ms	18204 KB	Output is correct
53	Correct	68 ms	18204 KB	Output is correct
54	Correct	85 ms	18204 KB	Output is correct
55	Correct	95 ms	18204 KB	Output is correct
56	Correct	64 ms	18204 KB	Output is correct
57	Correct	71 ms	18204 KB	Output is correct
58	Correct	68 ms	18204 KB	Output is correct
59	Correct	79 ms	18204 KB	Output is correct
60	Correct	82 ms	18204 KB	Output is correct
61	Correct	77 ms	18204 KB	Output is correct
62	Correct	88 ms	18204 KB	Output is correct
63	Correct	84 ms	18204 KB	Output is correct
64	Correct	62 ms	18204 KB	Output is correct
65	Correct	86 ms	18204 KB	Output is correct
66	Correct	85 ms	18204 KB	Output is correct
67	Correct	78 ms	18204 KB	Output is correct
68	Correct	82 ms	18204 KB	Output is correct
69	Correct	84 ms	18204 KB	Output is correct
70	Correct	80 ms	18204 KB	Output is correct
71	Correct	582 ms	22924 KB	Output is correct
72	Correct	593 ms	22948 KB	Output is correct
73	Correct	698 ms	22948 KB	Output is correct
74	Correct	911 ms	22948 KB	Output is correct
75	Correct	522 ms	24324 KB	Output is correct
76	Correct	899 ms	24324 KB	Output is correct
77	Correct	945 ms	24324 KB	Output is correct
78	Correct	378 ms	26220 KB	Output is correct
79	Correct	527 ms	26220 KB	Output is correct
80	Correct	632 ms	26220 KB	Output is correct
81	Correct	734 ms	26220 KB	Output is correct
82	Correct	952 ms	26220 KB	Output is correct
83	Correct	579 ms	43908 KB	Output is correct
84	Correct	1020 ms	44776 KB	Output is correct
85	Correct	862 ms	45152 KB	Output is correct
86	Correct	355 ms	45152 KB	Output is correct
87	Correct	573 ms	59072 KB	Output is correct
88	Correct	535 ms	59072 KB	Output is correct
89	Correct	683 ms	59072 KB	Output is correct
90	Runtime error	695 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.
91	Halted	0 ms	0 KB	-

답안 #80251

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 53.0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
53.0 / 53.0

Subtask #5
0 / 25.0