답안 #80244 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
80244	2018-10-19T16:37:04 Z	Bodo171	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	865 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,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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	284 KB	Output is correct
2	Correct	3 ms	524 KB	Output is correct
3	Correct	2 ms	524 KB	Output is correct
4	Correct	2 ms	524 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	2 ms	620 KB	Output is correct
7	Correct	3 ms	648 KB	Output is correct
8	Correct	2 ms	660 KB	Output is correct
9	Correct	2 ms	688 KB	Output is correct
10	Correct	2 ms	700 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	284 KB	Output is correct
2	Correct	3 ms	524 KB	Output is correct
3	Correct	2 ms	524 KB	Output is correct
4	Correct	2 ms	524 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	2 ms	620 KB	Output is correct
7	Correct	3 ms	648 KB	Output is correct
8	Correct	2 ms	660 KB	Output is correct
9	Correct	2 ms	688 KB	Output is correct
10	Correct	2 ms	700 KB	Output is correct
11	Correct	307 ms	4608 KB	Output is correct
12	Correct	293 ms	4608 KB	Output is correct
13	Correct	318 ms	4608 KB	Output is correct
14	Correct	320 ms	4608 KB	Output is correct
15	Correct	305 ms	4800 KB	Output is correct
16	Correct	349 ms	4800 KB	Output is correct
17	Correct	325 ms	4800 KB	Output is correct
18	Correct	224 ms	5764 KB	Output is correct
19	Correct	257 ms	5764 KB	Output is correct
20	Correct	283 ms	5764 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	284 KB	Output is correct
2	Correct	3 ms	524 KB	Output is correct
3	Correct	2 ms	524 KB	Output is correct
4	Correct	2 ms	524 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	2 ms	620 KB	Output is correct
7	Correct	3 ms	648 KB	Output is correct
8	Correct	2 ms	660 KB	Output is correct
9	Correct	2 ms	688 KB	Output is correct
10	Correct	2 ms	700 KB	Output is correct
11	Correct	307 ms	4608 KB	Output is correct
12	Correct	293 ms	4608 KB	Output is correct
13	Correct	318 ms	4608 KB	Output is correct
14	Correct	320 ms	4608 KB	Output is correct
15	Correct	305 ms	4800 KB	Output is correct
16	Correct	349 ms	4800 KB	Output is correct
17	Correct	325 ms	4800 KB	Output is correct
18	Correct	224 ms	5764 KB	Output is correct
19	Correct	257 ms	5764 KB	Output is correct
20	Correct	283 ms	5764 KB	Output is correct
21	Correct	342 ms	5764 KB	Output is correct
22	Correct	342 ms	5764 KB	Output is correct
23	Correct	399 ms	5764 KB	Output is correct
24	Correct	427 ms	5764 KB	Output is correct
25	Correct	393 ms	5840 KB	Output is correct
26	Correct	400 ms	5840 KB	Output is correct
27	Correct	422 ms	5840 KB	Output is correct
28	Correct	263 ms	6668 KB	Output is correct
29	Correct	322 ms	6668 KB	Output is correct
30	Correct	358 ms	6668 KB	Output is correct
31	Correct	390 ms	6668 KB	Output is correct
32	Correct	439 ms	6668 KB	Output is correct
33	Correct	410 ms	6668 KB	Output is correct
34	Correct	412 ms	6668 KB	Output is correct
35	Correct	400 ms	6668 KB	Output is correct
36	Correct	289 ms	6668 KB	Output is correct
37	Correct	351 ms	6668 KB	Output is correct
38	Correct	445 ms	6668 KB	Output is correct
39	Correct	405 ms	6668 KB	Output is correct
40	Correct	418 ms	6668 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	284 KB	Output is correct
2	Correct	3 ms	524 KB	Output is correct
3	Correct	2 ms	524 KB	Output is correct
4	Correct	2 ms	524 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	2 ms	620 KB	Output is correct
7	Correct	3 ms	648 KB	Output is correct
8	Correct	2 ms	660 KB	Output is correct
9	Correct	2 ms	688 KB	Output is correct
10	Correct	2 ms	700 KB	Output is correct
11	Correct	79 ms	11184 KB	Output is correct
12	Correct	73 ms	11184 KB	Output is correct
13	Correct	80 ms	11192 KB	Output is correct
14	Correct	88 ms	11192 KB	Output is correct
15	Correct	72 ms	11284 KB	Output is correct
16	Correct	105 ms	11284 KB	Output is correct
17	Correct	83 ms	11284 KB	Output is correct
18	Correct	61 ms	11440 KB	Output is correct
19	Correct	72 ms	11440 KB	Output is correct
20	Correct	71 ms	11440 KB	Output is correct
21	Correct	76 ms	11440 KB	Output is correct
22	Correct	103 ms	11440 KB	Output is correct
23	Correct	71 ms	11440 KB	Output is correct
24	Correct	100 ms	11440 KB	Output is correct
25	Correct	89 ms	11440 KB	Output is correct
26	Correct	61 ms	11440 KB	Output is correct
27	Correct	70 ms	11440 KB	Output is correct
28	Correct	71 ms	11440 KB	Output is correct
29	Correct	75 ms	11440 KB	Output is correct
30	Correct	78 ms	11440 KB	Output is correct
31	Correct	78 ms	11440 KB	Output is correct
32	Correct	94 ms	11440 KB	Output is correct
33	Correct	110 ms	11440 KB	Output is correct
34	Correct	64 ms	11440 KB	Output is correct
35	Correct	87 ms	11440 KB	Output is correct
36	Correct	87 ms	11440 KB	Output is correct
37	Correct	81 ms	11440 KB	Output is correct
38	Correct	90 ms	11440 KB	Output is correct
39	Correct	81 ms	11440 KB	Output is correct
40	Correct	88 ms	11440 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	284 KB	Output is correct
2	Correct	3 ms	524 KB	Output is correct
3	Correct	2 ms	524 KB	Output is correct
4	Correct	2 ms	524 KB	Output is correct
5	Correct	2 ms	568 KB	Output is correct
6	Correct	2 ms	620 KB	Output is correct
7	Correct	3 ms	648 KB	Output is correct
8	Correct	2 ms	660 KB	Output is correct
9	Correct	2 ms	688 KB	Output is correct
10	Correct	2 ms	700 KB	Output is correct
11	Correct	307 ms	4608 KB	Output is correct
12	Correct	293 ms	4608 KB	Output is correct
13	Correct	318 ms	4608 KB	Output is correct
14	Correct	320 ms	4608 KB	Output is correct
15	Correct	305 ms	4800 KB	Output is correct
16	Correct	349 ms	4800 KB	Output is correct
17	Correct	325 ms	4800 KB	Output is correct
18	Correct	224 ms	5764 KB	Output is correct
19	Correct	257 ms	5764 KB	Output is correct
20	Correct	283 ms	5764 KB	Output is correct
21	Correct	342 ms	5764 KB	Output is correct
22	Correct	342 ms	5764 KB	Output is correct
23	Correct	399 ms	5764 KB	Output is correct
24	Correct	427 ms	5764 KB	Output is correct
25	Correct	393 ms	5840 KB	Output is correct
26	Correct	400 ms	5840 KB	Output is correct
27	Correct	422 ms	5840 KB	Output is correct
28	Correct	263 ms	6668 KB	Output is correct
29	Correct	322 ms	6668 KB	Output is correct
30	Correct	358 ms	6668 KB	Output is correct
31	Correct	390 ms	6668 KB	Output is correct
32	Correct	439 ms	6668 KB	Output is correct
33	Correct	410 ms	6668 KB	Output is correct
34	Correct	412 ms	6668 KB	Output is correct
35	Correct	400 ms	6668 KB	Output is correct
36	Correct	289 ms	6668 KB	Output is correct
37	Correct	351 ms	6668 KB	Output is correct
38	Correct	445 ms	6668 KB	Output is correct
39	Correct	405 ms	6668 KB	Output is correct
40	Correct	418 ms	6668 KB	Output is correct
41	Correct	79 ms	11184 KB	Output is correct
42	Correct	73 ms	11184 KB	Output is correct
43	Correct	80 ms	11192 KB	Output is correct
44	Correct	88 ms	11192 KB	Output is correct
45	Correct	72 ms	11284 KB	Output is correct
46	Correct	105 ms	11284 KB	Output is correct
47	Correct	83 ms	11284 KB	Output is correct
48	Correct	61 ms	11440 KB	Output is correct
49	Correct	72 ms	11440 KB	Output is correct
50	Correct	71 ms	11440 KB	Output is correct
51	Correct	76 ms	11440 KB	Output is correct
52	Correct	103 ms	11440 KB	Output is correct
53	Correct	71 ms	11440 KB	Output is correct
54	Correct	100 ms	11440 KB	Output is correct
55	Correct	89 ms	11440 KB	Output is correct
56	Correct	61 ms	11440 KB	Output is correct
57	Correct	70 ms	11440 KB	Output is correct
58	Correct	71 ms	11440 KB	Output is correct
59	Correct	75 ms	11440 KB	Output is correct
60	Correct	78 ms	11440 KB	Output is correct
61	Correct	78 ms	11440 KB	Output is correct
62	Correct	94 ms	11440 KB	Output is correct
63	Correct	110 ms	11440 KB	Output is correct
64	Correct	64 ms	11440 KB	Output is correct
65	Correct	87 ms	11440 KB	Output is correct
66	Correct	87 ms	11440 KB	Output is correct
67	Correct	81 ms	11440 KB	Output is correct
68	Correct	90 ms	11440 KB	Output is correct
69	Correct	81 ms	11440 KB	Output is correct
70	Correct	88 ms	11440 KB	Output is correct
71	Correct	592 ms	15932 KB	Output is correct
72	Correct	572 ms	16200 KB	Output is correct
73	Correct	644 ms	16200 KB	Output is correct
74	Correct	846 ms	16200 KB	Output is correct
75	Correct	536 ms	16992 KB	Output is correct
76	Correct	865 ms	16992 KB	Output is correct
77	Correct	831 ms	16992 KB	Output is correct
78	Correct	352 ms	19024 KB	Output is correct
79	Correct	467 ms	34596 KB	Output is correct
80	Correct	559 ms	37716 KB	Output is correct
81	Correct	820 ms	59096 KB	Output is correct
82	Runtime error	796 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.
83	Halted	0 ms	0 KB	-

답안 #80244

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