답안 #80243 :: oj.uz

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

snake_escaping

#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;
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(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=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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	520 KB	Output is correct
3	Correct	2 ms	520 KB	Output is correct
4	Correct	2 ms	520 KB	Output is correct
5	Correct	2 ms	520 KB	Output is correct
6	Correct	2 ms	524 KB	Output is correct
7	Correct	2 ms	580 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	2 ms	684 KB	Output is correct
10	Correct	2 ms	824 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	520 KB	Output is correct
3	Correct	2 ms	520 KB	Output is correct
4	Correct	2 ms	520 KB	Output is correct
5	Correct	2 ms	520 KB	Output is correct
6	Correct	2 ms	524 KB	Output is correct
7	Correct	2 ms	580 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	2 ms	684 KB	Output is correct
10	Correct	2 ms	824 KB	Output is correct
11	Correct	258 ms	6368 KB	Output is correct
12	Correct	305 ms	6368 KB	Output is correct
13	Correct	303 ms	6852 KB	Output is correct
14	Correct	316 ms	7124 KB	Output is correct
15	Correct	302 ms	7884 KB	Output is correct
16	Correct	320 ms	7884 KB	Output is correct
17	Correct	322 ms	7884 KB	Output is correct
18	Correct	226 ms	9504 KB	Output is correct
19	Correct	273 ms	9504 KB	Output is correct
20	Correct	302 ms	9504 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	520 KB	Output is correct
3	Correct	2 ms	520 KB	Output is correct
4	Correct	2 ms	520 KB	Output is correct
5	Correct	2 ms	520 KB	Output is correct
6	Correct	2 ms	524 KB	Output is correct
7	Correct	2 ms	580 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	2 ms	684 KB	Output is correct
10	Correct	2 ms	824 KB	Output is correct
11	Correct	258 ms	6368 KB	Output is correct
12	Correct	305 ms	6368 KB	Output is correct
13	Correct	303 ms	6852 KB	Output is correct
14	Correct	316 ms	7124 KB	Output is correct
15	Correct	302 ms	7884 KB	Output is correct
16	Correct	320 ms	7884 KB	Output is correct
17	Correct	322 ms	7884 KB	Output is correct
18	Correct	226 ms	9504 KB	Output is correct
19	Correct	273 ms	9504 KB	Output is correct
20	Correct	302 ms	9504 KB	Output is correct
21	Correct	315 ms	9504 KB	Output is correct
22	Correct	339 ms	9504 KB	Output is correct
23	Correct	407 ms	9504 KB	Output is correct
24	Correct	414 ms	9504 KB	Output is correct
25	Correct	349 ms	10732 KB	Output is correct
26	Correct	441 ms	10732 KB	Output is correct
27	Correct	409 ms	10732 KB	Output is correct
28	Correct	255 ms	11668 KB	Output is correct
29	Correct	325 ms	11668 KB	Output is correct
30	Correct	338 ms	11668 KB	Output is correct
31	Correct	367 ms	11668 KB	Output is correct
32	Correct	390 ms	11668 KB	Output is correct
33	Correct	340 ms	11668 KB	Output is correct
34	Correct	394 ms	11668 KB	Output is correct
35	Correct	393 ms	11668 KB	Output is correct
36	Correct	278 ms	11668 KB	Output is correct
37	Correct	319 ms	11844 KB	Output is correct
38	Correct	324 ms	11844 KB	Output is correct
39	Correct	377 ms	11844 KB	Output is correct
40	Correct	381 ms	11844 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	520 KB	Output is correct
3	Correct	2 ms	520 KB	Output is correct
4	Correct	2 ms	520 KB	Output is correct
5	Correct	2 ms	520 KB	Output is correct
6	Correct	2 ms	524 KB	Output is correct
7	Correct	2 ms	580 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	2 ms	684 KB	Output is correct
10	Correct	2 ms	824 KB	Output is correct
11	Correct	72 ms	18332 KB	Output is correct
12	Correct	69 ms	18332 KB	Output is correct
13	Correct	83 ms	18572 KB	Output is correct
14	Correct	81 ms	18988 KB	Output is correct
15	Correct	89 ms	19016 KB	Output is correct
16	Correct	88 ms	19088 KB	Output is correct
17	Correct	92 ms	19208 KB	Output is correct
18	Correct	60 ms	19208 KB	Output is correct
19	Correct	66 ms	19208 KB	Output is correct
20	Correct	68 ms	19208 KB	Output is correct
21	Correct	91 ms	19208 KB	Output is correct
22	Correct	84 ms	19208 KB	Output is correct
23	Correct	67 ms	19208 KB	Output is correct
24	Correct	96 ms	19208 KB	Output is correct
25	Correct	86 ms	19208 KB	Output is correct
26	Correct	58 ms	19208 KB	Output is correct
27	Correct	68 ms	19208 KB	Output is correct
28	Correct	74 ms	19208 KB	Output is correct
29	Correct	74 ms	19208 KB	Output is correct
30	Correct	74 ms	19208 KB	Output is correct
31	Correct	69 ms	19208 KB	Output is correct
32	Correct	89 ms	19208 KB	Output is correct
33	Correct	87 ms	19208 KB	Output is correct
34	Correct	59 ms	19208 KB	Output is correct
35	Correct	81 ms	19208 KB	Output is correct
36	Correct	78 ms	19208 KB	Output is correct
37	Correct	103 ms	19208 KB	Output is correct
38	Correct	86 ms	19208 KB	Output is correct
39	Correct	81 ms	19208 KB	Output is correct
40	Correct	119 ms	19208 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	520 KB	Output is correct
3	Correct	2 ms	520 KB	Output is correct
4	Correct	2 ms	520 KB	Output is correct
5	Correct	2 ms	520 KB	Output is correct
6	Correct	2 ms	524 KB	Output is correct
7	Correct	2 ms	580 KB	Output is correct
8	Correct	2 ms	616 KB	Output is correct
9	Correct	2 ms	684 KB	Output is correct
10	Correct	2 ms	824 KB	Output is correct
11	Correct	258 ms	6368 KB	Output is correct
12	Correct	305 ms	6368 KB	Output is correct
13	Correct	303 ms	6852 KB	Output is correct
14	Correct	316 ms	7124 KB	Output is correct
15	Correct	302 ms	7884 KB	Output is correct
16	Correct	320 ms	7884 KB	Output is correct
17	Correct	322 ms	7884 KB	Output is correct
18	Correct	226 ms	9504 KB	Output is correct
19	Correct	273 ms	9504 KB	Output is correct
20	Correct	302 ms	9504 KB	Output is correct
21	Correct	315 ms	9504 KB	Output is correct
22	Correct	339 ms	9504 KB	Output is correct
23	Correct	407 ms	9504 KB	Output is correct
24	Correct	414 ms	9504 KB	Output is correct
25	Correct	349 ms	10732 KB	Output is correct
26	Correct	441 ms	10732 KB	Output is correct
27	Correct	409 ms	10732 KB	Output is correct
28	Correct	255 ms	11668 KB	Output is correct
29	Correct	325 ms	11668 KB	Output is correct
30	Correct	338 ms	11668 KB	Output is correct
31	Correct	367 ms	11668 KB	Output is correct
32	Correct	390 ms	11668 KB	Output is correct
33	Correct	340 ms	11668 KB	Output is correct
34	Correct	394 ms	11668 KB	Output is correct
35	Correct	393 ms	11668 KB	Output is correct
36	Correct	278 ms	11668 KB	Output is correct
37	Correct	319 ms	11844 KB	Output is correct
38	Correct	324 ms	11844 KB	Output is correct
39	Correct	377 ms	11844 KB	Output is correct
40	Correct	381 ms	11844 KB	Output is correct
41	Correct	72 ms	18332 KB	Output is correct
42	Correct	69 ms	18332 KB	Output is correct
43	Correct	83 ms	18572 KB	Output is correct
44	Correct	81 ms	18988 KB	Output is correct
45	Correct	89 ms	19016 KB	Output is correct
46	Correct	88 ms	19088 KB	Output is correct
47	Correct	92 ms	19208 KB	Output is correct
48	Correct	60 ms	19208 KB	Output is correct
49	Correct	66 ms	19208 KB	Output is correct
50	Correct	68 ms	19208 KB	Output is correct
51	Correct	91 ms	19208 KB	Output is correct
52	Correct	84 ms	19208 KB	Output is correct
53	Correct	67 ms	19208 KB	Output is correct
54	Correct	96 ms	19208 KB	Output is correct
55	Correct	86 ms	19208 KB	Output is correct
56	Correct	58 ms	19208 KB	Output is correct
57	Correct	68 ms	19208 KB	Output is correct
58	Correct	74 ms	19208 KB	Output is correct
59	Correct	74 ms	19208 KB	Output is correct
60	Correct	74 ms	19208 KB	Output is correct
61	Correct	69 ms	19208 KB	Output is correct
62	Correct	89 ms	19208 KB	Output is correct
63	Correct	87 ms	19208 KB	Output is correct
64	Correct	59 ms	19208 KB	Output is correct
65	Correct	81 ms	19208 KB	Output is correct
66	Correct	78 ms	19208 KB	Output is correct
67	Correct	103 ms	19208 KB	Output is correct
68	Correct	86 ms	19208 KB	Output is correct
69	Correct	81 ms	19208 KB	Output is correct
70	Correct	119 ms	19208 KB	Output is correct
71	Correct	513 ms	23712 KB	Output is correct
72	Correct	613 ms	23748 KB	Output is correct
73	Correct	669 ms	23748 KB	Output is correct
74	Correct	866 ms	24400 KB	Output is correct
75	Correct	538 ms	26872 KB	Output is correct
76	Correct	883 ms	26872 KB	Output is correct
77	Correct	919 ms	26872 KB	Output is correct
78	Correct	360 ms	28860 KB	Output is correct
79	Correct	565 ms	44740 KB	Output is correct
80	Runtime error	617 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.
81	Halted	0 ms	0 KB	-

답안 #80243

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