답안 #80239 :: oj.uz

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

snake_escaping

#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,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]=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=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+=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: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	3 ms	376 KB	Output is correct
2	Correct	2 ms	452 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	676 KB	Output is correct
5	Correct	2 ms	780 KB	Output is correct
6	Correct	2 ms	780 KB	Output is correct
7	Correct	2 ms	780 KB	Output is correct
8	Correct	3 ms	780 KB	Output is correct
9	Correct	2 ms	780 KB	Output is correct
10	Correct	2 ms	780 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	452 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	676 KB	Output is correct
5	Correct	2 ms	780 KB	Output is correct
6	Correct	2 ms	780 KB	Output is correct
7	Correct	2 ms	780 KB	Output is correct
8	Correct	3 ms	780 KB	Output is correct
9	Correct	2 ms	780 KB	Output is correct
10	Correct	2 ms	780 KB	Output is correct
11	Correct	261 ms	8264 KB	Output is correct
12	Correct	310 ms	9572 KB	Output is correct
13	Correct	365 ms	11724 KB	Output is correct
14	Correct	341 ms	11804 KB	Output is correct
15	Correct	305 ms	12728 KB	Output is correct
16	Correct	349 ms	12728 KB	Output is correct
17	Correct	320 ms	12728 KB	Output is correct
18	Correct	242 ms	13704 KB	Output is correct
19	Correct	276 ms	13704 KB	Output is correct
20	Correct	277 ms	13704 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	452 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	676 KB	Output is correct
5	Correct	2 ms	780 KB	Output is correct
6	Correct	2 ms	780 KB	Output is correct
7	Correct	2 ms	780 KB	Output is correct
8	Correct	3 ms	780 KB	Output is correct
9	Correct	2 ms	780 KB	Output is correct
10	Correct	2 ms	780 KB	Output is correct
11	Correct	261 ms	8264 KB	Output is correct
12	Correct	310 ms	9572 KB	Output is correct
13	Correct	365 ms	11724 KB	Output is correct
14	Correct	341 ms	11804 KB	Output is correct
15	Correct	305 ms	12728 KB	Output is correct
16	Correct	349 ms	12728 KB	Output is correct
17	Correct	320 ms	12728 KB	Output is correct
18	Correct	242 ms	13704 KB	Output is correct
19	Correct	276 ms	13704 KB	Output is correct
20	Correct	277 ms	13704 KB	Output is correct
21	Correct	331 ms	13704 KB	Output is correct
22	Correct	343 ms	13704 KB	Output is correct
23	Correct	393 ms	13704 KB	Output is correct
24	Correct	402 ms	13704 KB	Output is correct
25	Correct	375 ms	13896 KB	Output is correct
26	Correct	446 ms	13896 KB	Output is correct
27	Correct	402 ms	13896 KB	Output is correct
28	Correct	244 ms	14940 KB	Output is correct
29	Correct	329 ms	14940 KB	Output is correct
30	Correct	358 ms	14940 KB	Output is correct
31	Correct	373 ms	14940 KB	Output is correct
32	Correct	408 ms	14940 KB	Output is correct
33	Correct	337 ms	14940 KB	Output is correct
34	Correct	424 ms	14940 KB	Output is correct
35	Correct	459 ms	14940 KB	Output is correct
36	Correct	290 ms	14940 KB	Output is correct
37	Correct	338 ms	14940 KB	Output is correct
38	Correct	347 ms	14940 KB	Output is correct
39	Correct	396 ms	14940 KB	Output is correct
40	Correct	444 ms	14940 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	452 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	676 KB	Output is correct
5	Correct	2 ms	780 KB	Output is correct
6	Correct	2 ms	780 KB	Output is correct
7	Correct	2 ms	780 KB	Output is correct
8	Correct	3 ms	780 KB	Output is correct
9	Correct	2 ms	780 KB	Output is correct
10	Correct	2 ms	780 KB	Output is correct
11	Correct	78 ms	20332 KB	Output is correct
12	Correct	82 ms	20332 KB	Output is correct
13	Correct	85 ms	20460 KB	Output is correct
14	Correct	92 ms	20460 KB	Output is correct
15	Correct	84 ms	20460 KB	Output is correct
16	Correct	89 ms	20460 KB	Output is correct
17	Correct	82 ms	20460 KB	Output is correct
18	Correct	64 ms	20460 KB	Output is correct
19	Correct	67 ms	20460 KB	Output is correct
20	Correct	72 ms	20460 KB	Output is correct
21	Correct	81 ms	20460 KB	Output is correct
22	Correct	95 ms	20460 KB	Output is correct
23	Correct	94 ms	20460 KB	Output is correct
24	Correct	86 ms	20460 KB	Output is correct
25	Correct	96 ms	20460 KB	Output is correct
26	Correct	67 ms	20460 KB	Output is correct
27	Correct	69 ms	20460 KB	Output is correct
28	Correct	70 ms	20460 KB	Output is correct
29	Correct	81 ms	20460 KB	Output is correct
30	Correct	79 ms	20460 KB	Output is correct
31	Correct	74 ms	20460 KB	Output is correct
32	Correct	96 ms	20460 KB	Output is correct
33	Correct	86 ms	20460 KB	Output is correct
34	Correct	59 ms	20460 KB	Output is correct
35	Correct	75 ms	20460 KB	Output is correct
36	Correct	82 ms	20460 KB	Output is correct
37	Correct	76 ms	20460 KB	Output is correct
38	Correct	77 ms	20460 KB	Output is correct
39	Correct	80 ms	20460 KB	Output is correct
40	Correct	79 ms	20460 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	2 ms	452 KB	Output is correct
3	Correct	2 ms	460 KB	Output is correct
4	Correct	2 ms	676 KB	Output is correct
5	Correct	2 ms	780 KB	Output is correct
6	Correct	2 ms	780 KB	Output is correct
7	Correct	2 ms	780 KB	Output is correct
8	Correct	3 ms	780 KB	Output is correct
9	Correct	2 ms	780 KB	Output is correct
10	Correct	2 ms	780 KB	Output is correct
11	Correct	261 ms	8264 KB	Output is correct
12	Correct	310 ms	9572 KB	Output is correct
13	Correct	365 ms	11724 KB	Output is correct
14	Correct	341 ms	11804 KB	Output is correct
15	Correct	305 ms	12728 KB	Output is correct
16	Correct	349 ms	12728 KB	Output is correct
17	Correct	320 ms	12728 KB	Output is correct
18	Correct	242 ms	13704 KB	Output is correct
19	Correct	276 ms	13704 KB	Output is correct
20	Correct	277 ms	13704 KB	Output is correct
21	Correct	331 ms	13704 KB	Output is correct
22	Correct	343 ms	13704 KB	Output is correct
23	Correct	393 ms	13704 KB	Output is correct
24	Correct	402 ms	13704 KB	Output is correct
25	Correct	375 ms	13896 KB	Output is correct
26	Correct	446 ms	13896 KB	Output is correct
27	Correct	402 ms	13896 KB	Output is correct
28	Correct	244 ms	14940 KB	Output is correct
29	Correct	329 ms	14940 KB	Output is correct
30	Correct	358 ms	14940 KB	Output is correct
31	Correct	373 ms	14940 KB	Output is correct
32	Correct	408 ms	14940 KB	Output is correct
33	Correct	337 ms	14940 KB	Output is correct
34	Correct	424 ms	14940 KB	Output is correct
35	Correct	459 ms	14940 KB	Output is correct
36	Correct	290 ms	14940 KB	Output is correct
37	Correct	338 ms	14940 KB	Output is correct
38	Correct	347 ms	14940 KB	Output is correct
39	Correct	396 ms	14940 KB	Output is correct
40	Correct	444 ms	14940 KB	Output is correct
41	Correct	78 ms	20332 KB	Output is correct
42	Correct	82 ms	20332 KB	Output is correct
43	Correct	85 ms	20460 KB	Output is correct
44	Correct	92 ms	20460 KB	Output is correct
45	Correct	84 ms	20460 KB	Output is correct
46	Correct	89 ms	20460 KB	Output is correct
47	Correct	82 ms	20460 KB	Output is correct
48	Correct	64 ms	20460 KB	Output is correct
49	Correct	67 ms	20460 KB	Output is correct
50	Correct	72 ms	20460 KB	Output is correct
51	Correct	81 ms	20460 KB	Output is correct
52	Correct	95 ms	20460 KB	Output is correct
53	Correct	94 ms	20460 KB	Output is correct
54	Correct	86 ms	20460 KB	Output is correct
55	Correct	96 ms	20460 KB	Output is correct
56	Correct	67 ms	20460 KB	Output is correct
57	Correct	69 ms	20460 KB	Output is correct
58	Correct	70 ms	20460 KB	Output is correct
59	Correct	81 ms	20460 KB	Output is correct
60	Correct	79 ms	20460 KB	Output is correct
61	Correct	74 ms	20460 KB	Output is correct
62	Correct	96 ms	20460 KB	Output is correct
63	Correct	86 ms	20460 KB	Output is correct
64	Correct	59 ms	20460 KB	Output is correct
65	Correct	75 ms	20460 KB	Output is correct
66	Correct	82 ms	20460 KB	Output is correct
67	Correct	76 ms	20460 KB	Output is correct
68	Correct	77 ms	20460 KB	Output is correct
69	Correct	80 ms	20460 KB	Output is correct
70	Correct	79 ms	20460 KB	Output is correct
71	Correct	524 ms	25084 KB	Output is correct
72	Correct	583 ms	46768 KB	Output is correct
73	Runtime error	696 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.
74	Halted	0 ms	0 KB	-

답안 #80239

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