답안 #80260 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
80260	2018-10-19T17:02:47 Z	Bodo171	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	930 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	3 ms	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	524 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	564 KB	Output is correct
7	Correct	2 ms	616 KB	Output is correct
8	Correct	2 ms	756 KB	Output is correct
9	Correct	2 ms	756 KB	Output is correct
10	Correct	2 ms	756 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	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	524 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	564 KB	Output is correct
7	Correct	2 ms	616 KB	Output is correct
8	Correct	2 ms	756 KB	Output is correct
9	Correct	2 ms	756 KB	Output is correct
10	Correct	2 ms	756 KB	Output is correct
11	Correct	293 ms	5464 KB	Output is correct
12	Correct	338 ms	5464 KB	Output is correct
13	Correct	342 ms	5464 KB	Output is correct
14	Correct	333 ms	5464 KB	Output is correct
15	Correct	327 ms	5740 KB	Output is correct
16	Correct	361 ms	5740 KB	Output is correct
17	Correct	337 ms	5740 KB	Output is correct
18	Correct	256 ms	6780 KB	Output is correct
19	Correct	276 ms	6780 KB	Output is correct
20	Correct	354 ms	6780 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	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	524 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	564 KB	Output is correct
7	Correct	2 ms	616 KB	Output is correct
8	Correct	2 ms	756 KB	Output is correct
9	Correct	2 ms	756 KB	Output is correct
10	Correct	2 ms	756 KB	Output is correct
11	Correct	293 ms	5464 KB	Output is correct
12	Correct	338 ms	5464 KB	Output is correct
13	Correct	342 ms	5464 KB	Output is correct
14	Correct	333 ms	5464 KB	Output is correct
15	Correct	327 ms	5740 KB	Output is correct
16	Correct	361 ms	5740 KB	Output is correct
17	Correct	337 ms	5740 KB	Output is correct
18	Correct	256 ms	6780 KB	Output is correct
19	Correct	276 ms	6780 KB	Output is correct
20	Correct	354 ms	6780 KB	Output is correct
21	Correct	359 ms	6780 KB	Output is correct
22	Correct	345 ms	6780 KB	Output is correct
23	Correct	403 ms	6780 KB	Output is correct
24	Correct	425 ms	6780 KB	Output is correct
25	Correct	362 ms	6852 KB	Output is correct
26	Correct	422 ms	6852 KB	Output is correct
27	Correct	464 ms	6852 KB	Output is correct
28	Correct	273 ms	7756 KB	Output is correct
29	Correct	347 ms	7756 KB	Output is correct
30	Correct	360 ms	7756 KB	Output is correct
31	Correct	433 ms	7756 KB	Output is correct
32	Correct	424 ms	7756 KB	Output is correct
33	Correct	399 ms	7756 KB	Output is correct
34	Correct	473 ms	7756 KB	Output is correct
35	Correct	416 ms	7756 KB	Output is correct
36	Correct	257 ms	7756 KB	Output is correct
37	Correct	327 ms	7756 KB	Output is correct
38	Correct	344 ms	7756 KB	Output is correct
39	Correct	377 ms	7756 KB	Output is correct
40	Correct	406 ms	7756 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	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	524 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	564 KB	Output is correct
7	Correct	2 ms	616 KB	Output is correct
8	Correct	2 ms	756 KB	Output is correct
9	Correct	2 ms	756 KB	Output is correct
10	Correct	2 ms	756 KB	Output is correct
11	Correct	72 ms	12244 KB	Output is correct
12	Correct	81 ms	12244 KB	Output is correct
13	Correct	77 ms	12244 KB	Output is correct
14	Correct	101 ms	12244 KB	Output is correct
15	Correct	68 ms	12352 KB	Output is correct
16	Correct	86 ms	12352 KB	Output is correct
17	Correct	94 ms	12468 KB	Output is correct
18	Correct	62 ms	12532 KB	Output is correct
19	Correct	76 ms	12532 KB	Output is correct
20	Correct	72 ms	12532 KB	Output is correct
21	Correct	73 ms	12532 KB	Output is correct
22	Correct	88 ms	12532 KB	Output is correct
23	Correct	69 ms	12532 KB	Output is correct
24	Correct	89 ms	12532 KB	Output is correct
25	Correct	92 ms	12532 KB	Output is correct
26	Correct	59 ms	12532 KB	Output is correct
27	Correct	92 ms	12532 KB	Output is correct
28	Correct	70 ms	12532 KB	Output is correct
29	Correct	79 ms	12532 KB	Output is correct
30	Correct	76 ms	12532 KB	Output is correct
31	Correct	73 ms	12532 KB	Output is correct
32	Correct	100 ms	12532 KB	Output is correct
33	Correct	93 ms	12532 KB	Output is correct
34	Correct	63 ms	12532 KB	Output is correct
35	Correct	77 ms	12532 KB	Output is correct
36	Correct	115 ms	12532 KB	Output is correct
37	Correct	81 ms	12532 KB	Output is correct
38	Correct	79 ms	12532 KB	Output is correct
39	Correct	83 ms	12532 KB	Output is correct
40	Correct	81 ms	12532 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	512 KB	Output is correct
3	Correct	3 ms	512 KB	Output is correct
4	Correct	2 ms	524 KB	Output is correct
5	Correct	2 ms	544 KB	Output is correct
6	Correct	2 ms	564 KB	Output is correct
7	Correct	2 ms	616 KB	Output is correct
8	Correct	2 ms	756 KB	Output is correct
9	Correct	2 ms	756 KB	Output is correct
10	Correct	2 ms	756 KB	Output is correct
11	Correct	293 ms	5464 KB	Output is correct
12	Correct	338 ms	5464 KB	Output is correct
13	Correct	342 ms	5464 KB	Output is correct
14	Correct	333 ms	5464 KB	Output is correct
15	Correct	327 ms	5740 KB	Output is correct
16	Correct	361 ms	5740 KB	Output is correct
17	Correct	337 ms	5740 KB	Output is correct
18	Correct	256 ms	6780 KB	Output is correct
19	Correct	276 ms	6780 KB	Output is correct
20	Correct	354 ms	6780 KB	Output is correct
21	Correct	359 ms	6780 KB	Output is correct
22	Correct	345 ms	6780 KB	Output is correct
23	Correct	403 ms	6780 KB	Output is correct
24	Correct	425 ms	6780 KB	Output is correct
25	Correct	362 ms	6852 KB	Output is correct
26	Correct	422 ms	6852 KB	Output is correct
27	Correct	464 ms	6852 KB	Output is correct
28	Correct	273 ms	7756 KB	Output is correct
29	Correct	347 ms	7756 KB	Output is correct
30	Correct	360 ms	7756 KB	Output is correct
31	Correct	433 ms	7756 KB	Output is correct
32	Correct	424 ms	7756 KB	Output is correct
33	Correct	399 ms	7756 KB	Output is correct
34	Correct	473 ms	7756 KB	Output is correct
35	Correct	416 ms	7756 KB	Output is correct
36	Correct	257 ms	7756 KB	Output is correct
37	Correct	327 ms	7756 KB	Output is correct
38	Correct	344 ms	7756 KB	Output is correct
39	Correct	377 ms	7756 KB	Output is correct
40	Correct	406 ms	7756 KB	Output is correct
41	Correct	72 ms	12244 KB	Output is correct
42	Correct	81 ms	12244 KB	Output is correct
43	Correct	77 ms	12244 KB	Output is correct
44	Correct	101 ms	12244 KB	Output is correct
45	Correct	68 ms	12352 KB	Output is correct
46	Correct	86 ms	12352 KB	Output is correct
47	Correct	94 ms	12468 KB	Output is correct
48	Correct	62 ms	12532 KB	Output is correct
49	Correct	76 ms	12532 KB	Output is correct
50	Correct	72 ms	12532 KB	Output is correct
51	Correct	73 ms	12532 KB	Output is correct
52	Correct	88 ms	12532 KB	Output is correct
53	Correct	69 ms	12532 KB	Output is correct
54	Correct	89 ms	12532 KB	Output is correct
55	Correct	92 ms	12532 KB	Output is correct
56	Correct	59 ms	12532 KB	Output is correct
57	Correct	92 ms	12532 KB	Output is correct
58	Correct	70 ms	12532 KB	Output is correct
59	Correct	79 ms	12532 KB	Output is correct
60	Correct	76 ms	12532 KB	Output is correct
61	Correct	73 ms	12532 KB	Output is correct
62	Correct	100 ms	12532 KB	Output is correct
63	Correct	93 ms	12532 KB	Output is correct
64	Correct	63 ms	12532 KB	Output is correct
65	Correct	77 ms	12532 KB	Output is correct
66	Correct	115 ms	12532 KB	Output is correct
67	Correct	81 ms	12532 KB	Output is correct
68	Correct	79 ms	12532 KB	Output is correct
69	Correct	83 ms	12532 KB	Output is correct
70	Correct	81 ms	12532 KB	Output is correct
71	Correct	587 ms	17100 KB	Output is correct
72	Correct	583 ms	17224 KB	Output is correct
73	Correct	686 ms	17224 KB	Output is correct
74	Correct	868 ms	17224 KB	Output is correct
75	Correct	567 ms	18660 KB	Output is correct
76	Correct	930 ms	18660 KB	Output is correct
77	Correct	913 ms	18660 KB	Output is correct
78	Correct	442 ms	20548 KB	Output is correct
79	Correct	565 ms	20548 KB	Output is correct
80	Correct	663 ms	20548 KB	Output is correct
81	Correct	794 ms	20548 KB	Output is correct
82	Correct	806 ms	20548 KB	Output is correct
83	Correct	612 ms	20548 KB	Output is correct
84	Correct	890 ms	20548 KB	Output is correct
85	Correct	898 ms	20548 KB	Output is correct
86	Correct	354 ms	20548 KB	Output is correct
87	Correct	542 ms	20548 KB	Output is correct
88	Correct	467 ms	20548 KB	Output is correct
89	Correct	577 ms	20548 KB	Output is correct
90	Correct	625 ms	20548 KB	Output is correct
91	Correct	511 ms	20548 KB	Output is correct
92	Correct	843 ms	20548 KB	Output is correct
93	Correct	856 ms	20548 KB	Output is correct
94	Correct	352 ms	20548 KB	Output is correct
95	Correct	772 ms	20548 KB	Output is correct
96	Correct	768 ms	31500 KB	Output is correct
97	Correct	693 ms	31500 KB	Output is correct
98	Correct	718 ms	31500 KB	Output is correct
99	Correct	743 ms	53004 KB	Output is correct
100	Runtime error	713 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.

답안 #80260

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