답안 #80245 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
80245	2018-10-19T16:39:05 Z	Bodo171	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	1041 ms	65664 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	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	3 ms	520 KB	Output is correct
4	Correct	3 ms	528 KB	Output is correct
5	Correct	3 ms	540 KB	Output is correct
6	Correct	3 ms	540 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	2 ms	636 KB	Output is correct
9	Correct	2 ms	664 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	3 ms	520 KB	Output is correct
4	Correct	3 ms	528 KB	Output is correct
5	Correct	3 ms	540 KB	Output is correct
6	Correct	3 ms	540 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	2 ms	636 KB	Output is correct
9	Correct	2 ms	664 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	280 ms	4728 KB	Output is correct
12	Correct	324 ms	4728 KB	Output is correct
13	Correct	334 ms	4728 KB	Output is correct
14	Correct	330 ms	4728 KB	Output is correct
15	Correct	304 ms	4728 KB	Output is correct
16	Correct	382 ms	4728 KB	Output is correct
17	Correct	350 ms	4728 KB	Output is correct
18	Correct	222 ms	5668 KB	Output is correct
19	Correct	261 ms	5668 KB	Output is correct
20	Correct	298 ms	5668 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	3 ms	520 KB	Output is correct
4	Correct	3 ms	528 KB	Output is correct
5	Correct	3 ms	540 KB	Output is correct
6	Correct	3 ms	540 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	2 ms	636 KB	Output is correct
9	Correct	2 ms	664 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	280 ms	4728 KB	Output is correct
12	Correct	324 ms	4728 KB	Output is correct
13	Correct	334 ms	4728 KB	Output is correct
14	Correct	330 ms	4728 KB	Output is correct
15	Correct	304 ms	4728 KB	Output is correct
16	Correct	382 ms	4728 KB	Output is correct
17	Correct	350 ms	4728 KB	Output is correct
18	Correct	222 ms	5668 KB	Output is correct
19	Correct	261 ms	5668 KB	Output is correct
20	Correct	298 ms	5668 KB	Output is correct
21	Correct	318 ms	5668 KB	Output is correct
22	Correct	380 ms	5668 KB	Output is correct
23	Correct	386 ms	5668 KB	Output is correct
24	Correct	426 ms	5668 KB	Output is correct
25	Correct	365 ms	5668 KB	Output is correct
26	Correct	476 ms	5668 KB	Output is correct
27	Correct	394 ms	5668 KB	Output is correct
28	Correct	307 ms	6832 KB	Output is correct
29	Correct	342 ms	6832 KB	Output is correct
30	Correct	344 ms	6832 KB	Output is correct
31	Correct	397 ms	6832 KB	Output is correct
32	Correct	441 ms	6832 KB	Output is correct
33	Correct	361 ms	6832 KB	Output is correct
34	Correct	441 ms	6832 KB	Output is correct
35	Correct	414 ms	6832 KB	Output is correct
36	Correct	281 ms	6832 KB	Output is correct
37	Correct	371 ms	6832 KB	Output is correct
38	Correct	328 ms	6832 KB	Output is correct
39	Correct	374 ms	6832 KB	Output is correct
40	Correct	386 ms	6832 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	3 ms	520 KB	Output is correct
4	Correct	3 ms	528 KB	Output is correct
5	Correct	3 ms	540 KB	Output is correct
6	Correct	3 ms	540 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	2 ms	636 KB	Output is correct
9	Correct	2 ms	664 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	67 ms	11184 KB	Output is correct
12	Correct	70 ms	11184 KB	Output is correct
13	Correct	75 ms	11188 KB	Output is correct
14	Correct	81 ms	11188 KB	Output is correct
15	Correct	87 ms	11264 KB	Output is correct
16	Correct	90 ms	11264 KB	Output is correct
17	Correct	114 ms	11264 KB	Output is correct
18	Correct	59 ms	11432 KB	Output is correct
19	Correct	71 ms	11432 KB	Output is correct
20	Correct	72 ms	11432 KB	Output is correct
21	Correct	82 ms	11432 KB	Output is correct
22	Correct	82 ms	11432 KB	Output is correct
23	Correct	69 ms	11432 KB	Output is correct
24	Correct	142 ms	11432 KB	Output is correct
25	Correct	87 ms	11432 KB	Output is correct
26	Correct	77 ms	11432 KB	Output is correct
27	Correct	70 ms	11432 KB	Output is correct
28	Correct	100 ms	11432 KB	Output is correct
29	Correct	73 ms	11432 KB	Output is correct
30	Correct	92 ms	11432 KB	Output is correct
31	Correct	78 ms	11432 KB	Output is correct
32	Correct	90 ms	11432 KB	Output is correct
33	Correct	88 ms	11432 KB	Output is correct
34	Correct	59 ms	11432 KB	Output is correct
35	Correct	84 ms	11432 KB	Output is correct
36	Correct	89 ms	11432 KB	Output is correct
37	Correct	81 ms	11432 KB	Output is correct
38	Correct	82 ms	11432 KB	Output is correct
39	Correct	82 ms	11432 KB	Output is correct
40	Correct	84 ms	11432 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	520 KB	Output is correct
3	Correct	3 ms	520 KB	Output is correct
4	Correct	3 ms	528 KB	Output is correct
5	Correct	3 ms	540 KB	Output is correct
6	Correct	3 ms	540 KB	Output is correct
7	Correct	2 ms	564 KB	Output is correct
8	Correct	2 ms	636 KB	Output is correct
9	Correct	2 ms	664 KB	Output is correct
10	Correct	3 ms	676 KB	Output is correct
11	Correct	280 ms	4728 KB	Output is correct
12	Correct	324 ms	4728 KB	Output is correct
13	Correct	334 ms	4728 KB	Output is correct
14	Correct	330 ms	4728 KB	Output is correct
15	Correct	304 ms	4728 KB	Output is correct
16	Correct	382 ms	4728 KB	Output is correct
17	Correct	350 ms	4728 KB	Output is correct
18	Correct	222 ms	5668 KB	Output is correct
19	Correct	261 ms	5668 KB	Output is correct
20	Correct	298 ms	5668 KB	Output is correct
21	Correct	318 ms	5668 KB	Output is correct
22	Correct	380 ms	5668 KB	Output is correct
23	Correct	386 ms	5668 KB	Output is correct
24	Correct	426 ms	5668 KB	Output is correct
25	Correct	365 ms	5668 KB	Output is correct
26	Correct	476 ms	5668 KB	Output is correct
27	Correct	394 ms	5668 KB	Output is correct
28	Correct	307 ms	6832 KB	Output is correct
29	Correct	342 ms	6832 KB	Output is correct
30	Correct	344 ms	6832 KB	Output is correct
31	Correct	397 ms	6832 KB	Output is correct
32	Correct	441 ms	6832 KB	Output is correct
33	Correct	361 ms	6832 KB	Output is correct
34	Correct	441 ms	6832 KB	Output is correct
35	Correct	414 ms	6832 KB	Output is correct
36	Correct	281 ms	6832 KB	Output is correct
37	Correct	371 ms	6832 KB	Output is correct
38	Correct	328 ms	6832 KB	Output is correct
39	Correct	374 ms	6832 KB	Output is correct
40	Correct	386 ms	6832 KB	Output is correct
41	Correct	67 ms	11184 KB	Output is correct
42	Correct	70 ms	11184 KB	Output is correct
43	Correct	75 ms	11188 KB	Output is correct
44	Correct	81 ms	11188 KB	Output is correct
45	Correct	87 ms	11264 KB	Output is correct
46	Correct	90 ms	11264 KB	Output is correct
47	Correct	114 ms	11264 KB	Output is correct
48	Correct	59 ms	11432 KB	Output is correct
49	Correct	71 ms	11432 KB	Output is correct
50	Correct	72 ms	11432 KB	Output is correct
51	Correct	82 ms	11432 KB	Output is correct
52	Correct	82 ms	11432 KB	Output is correct
53	Correct	69 ms	11432 KB	Output is correct
54	Correct	142 ms	11432 KB	Output is correct
55	Correct	87 ms	11432 KB	Output is correct
56	Correct	77 ms	11432 KB	Output is correct
57	Correct	70 ms	11432 KB	Output is correct
58	Correct	100 ms	11432 KB	Output is correct
59	Correct	73 ms	11432 KB	Output is correct
60	Correct	92 ms	11432 KB	Output is correct
61	Correct	78 ms	11432 KB	Output is correct
62	Correct	90 ms	11432 KB	Output is correct
63	Correct	88 ms	11432 KB	Output is correct
64	Correct	59 ms	11432 KB	Output is correct
65	Correct	84 ms	11432 KB	Output is correct
66	Correct	89 ms	11432 KB	Output is correct
67	Correct	81 ms	11432 KB	Output is correct
68	Correct	82 ms	11432 KB	Output is correct
69	Correct	82 ms	11432 KB	Output is correct
70	Correct	84 ms	11432 KB	Output is correct
71	Correct	609 ms	16064 KB	Output is correct
72	Correct	561 ms	16064 KB	Output is correct
73	Correct	665 ms	16064 KB	Output is correct
74	Correct	880 ms	16064 KB	Output is correct
75	Correct	553 ms	17012 KB	Output is correct
76	Correct	1041 ms	17012 KB	Output is correct
77	Correct	1002 ms	17012 KB	Output is correct
78	Correct	393 ms	18812 KB	Output is correct
79	Correct	501 ms	26168 KB	Output is correct
80	Correct	575 ms	29288 KB	Output is correct
81	Correct	699 ms	29288 KB	Output is correct
82	Correct	866 ms	29288 KB	Output is correct
83	Correct	545 ms	48888 KB	Output is correct
84	Correct	991 ms	50628 KB	Output is correct
85	Runtime error	889 ms	65664 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.
86	Halted	0 ms	0 KB	-

답안 #80245

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