Submission #58959

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
58959	2018-07-19T21:33:56 Z	TadijaSebez	Snake Escaping (JOI18_snake_escaping)	C++11	75 / 100	1560 ms	66560 KB

snake_escaping

#include <stdio.h>
const int N=1<<20;
int dp0[N],dp1[N],pc[N];
char s[N],t[20];
int min(int a, int b){ return a>b?b:a;}
int abs(int x){ return x>0?x:-x;}
int main()
{
	int n,q,i,mask;
	for(i=1;i<N;i++) pc[i]=pc[i-(i&-i)]+1;
	scanf("%i %i",&n,&q);
	scanf("%s",s);
	for(i=0;i<(1<<n);i++)
	{
		dp1[i]=dp0[((1<<n)-1)^i]=s[i]-'0';
	}
	for(i=0;i<n;i++)
	{
		for(mask=0;mask<(1<<n);mask++)
		{
			if((mask>>i)&1)
			{
				dp1[mask]+=dp1[mask^(1<<i)];
				dp0[mask]+=dp0[mask^(1<<i)];
			}
		}
	}
	while(q--)
	{
		scanf("%s",t);
		int a=0,b=0,c=0;
		for(i=0;i<n;i++)
		{
			if(t[n-i-1]=='0') a+=1<<i;
			else if(t[n-i-1]=='1') b+=1<<i;
			else c+=1<<i;
		}
		int ans=0;
		if(pc[a]<=min(pc[b],pc[c]))
		{
			for(mask=a;;mask=(mask-1)&a)
			{
				//printf("a:%i %i\n",a,mask);
				if((pc[mask]&1)==(pc[a]&1)) ans+=dp0[mask|c];
				else ans-=dp0[mask|c];
				if(!mask) break;
			}
		}
		else if(pc[b]<=min(pc[a],pc[c]))
		{
			for(mask=b;;mask=(mask-1)&b)
			{
				//printf("b:%i %i\n",b,mask);
				if((pc[mask]&1)==(pc[b]&1)) ans+=dp1[mask|c];
				else ans-=dp1[mask|c];
				if(!mask) break;
			}
		}
		else
		{
			for(mask=c;;mask=(mask-1)&c)
			{
				//printf("c:%i %i\n",c,mask);
				ans+=s[mask|b]-'0';
				if(!mask) break;
			}
		}
		printf("%i\n",abs(ans));
	}
	return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:11:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&q);
  ~~~~~^~~~~~~~~~~~~~~
snake_escaping.cpp:12:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s);
  ~~~~~^~~~~~~~
snake_escaping.cpp:30:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",t);
   ~~~~~^~~~~~~~

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	4472 KB	Output is correct
2	Correct	7 ms	4584 KB	Output is correct
3	Correct	7 ms	4584 KB	Output is correct
4	Correct	7 ms	4584 KB	Output is correct
5	Correct	7 ms	4584 KB	Output is correct
6	Correct	7 ms	4584 KB	Output is correct
7	Correct	8 ms	4584 KB	Output is correct
8	Correct	8 ms	4584 KB	Output is correct
9	Correct	7 ms	4584 KB	Output is correct
10	Correct	6 ms	4584 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	4472 KB	Output is correct
2	Correct	7 ms	4584 KB	Output is correct
3	Correct	7 ms	4584 KB	Output is correct
4	Correct	7 ms	4584 KB	Output is correct
5	Correct	7 ms	4584 KB	Output is correct
6	Correct	7 ms	4584 KB	Output is correct
7	Correct	8 ms	4584 KB	Output is correct
8	Correct	8 ms	4584 KB	Output is correct
9	Correct	7 ms	4584 KB	Output is correct
10	Correct	6 ms	4584 KB	Output is correct
11	Correct	418 ms	8628 KB	Output is correct
12	Correct	390 ms	8628 KB	Output is correct
13	Correct	314 ms	8628 KB	Output is correct
14	Correct	339 ms	8628 KB	Output is correct
15	Correct	288 ms	8628 KB	Output is correct
16	Correct	319 ms	8628 KB	Output is correct
17	Correct	437 ms	8628 KB	Output is correct
18	Correct	323 ms	9624 KB	Output is correct
19	Correct	344 ms	9624 KB	Output is correct
20	Correct	352 ms	9624 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	4472 KB	Output is correct
2	Correct	7 ms	4584 KB	Output is correct
3	Correct	7 ms	4584 KB	Output is correct
4	Correct	7 ms	4584 KB	Output is correct
5	Correct	7 ms	4584 KB	Output is correct
6	Correct	7 ms	4584 KB	Output is correct
7	Correct	8 ms	4584 KB	Output is correct
8	Correct	8 ms	4584 KB	Output is correct
9	Correct	7 ms	4584 KB	Output is correct
10	Correct	6 ms	4584 KB	Output is correct
11	Correct	418 ms	8628 KB	Output is correct
12	Correct	390 ms	8628 KB	Output is correct
13	Correct	314 ms	8628 KB	Output is correct
14	Correct	339 ms	8628 KB	Output is correct
15	Correct	288 ms	8628 KB	Output is correct
16	Correct	319 ms	8628 KB	Output is correct
17	Correct	437 ms	8628 KB	Output is correct
18	Correct	323 ms	9624 KB	Output is correct
19	Correct	344 ms	9624 KB	Output is correct
20	Correct	352 ms	9624 KB	Output is correct
21	Correct	418 ms	9624 KB	Output is correct
22	Correct	492 ms	9624 KB	Output is correct
23	Correct	466 ms	9624 KB	Output is correct
24	Correct	492 ms	9624 KB	Output is correct
25	Correct	351 ms	9764 KB	Output is correct
26	Correct	423 ms	9764 KB	Output is correct
27	Correct	440 ms	9764 KB	Output is correct
28	Correct	267 ms	10672 KB	Output is correct
29	Correct	365 ms	10672 KB	Output is correct
30	Correct	386 ms	10672 KB	Output is correct
31	Correct	412 ms	10672 KB	Output is correct
32	Correct	451 ms	10672 KB	Output is correct
33	Correct	485 ms	10672 KB	Output is correct
34	Correct	485 ms	10672 KB	Output is correct
35	Correct	437 ms	10672 KB	Output is correct
36	Correct	333 ms	10672 KB	Output is correct
37	Correct	376 ms	10672 KB	Output is correct
38	Correct	334 ms	10672 KB	Output is correct
39	Correct	410 ms	10672 KB	Output is correct
40	Correct	558 ms	10672 KB	Output is correct

Subtask #4
53.0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	4472 KB	Output is correct
2	Correct	7 ms	4584 KB	Output is correct
3	Correct	7 ms	4584 KB	Output is correct
4	Correct	7 ms	4584 KB	Output is correct
5	Correct	7 ms	4584 KB	Output is correct
6	Correct	7 ms	4584 KB	Output is correct
7	Correct	8 ms	4584 KB	Output is correct
8	Correct	8 ms	4584 KB	Output is correct
9	Correct	7 ms	4584 KB	Output is correct
10	Correct	6 ms	4584 KB	Output is correct
11	Correct	75 ms	14124 KB	Output is correct
12	Correct	87 ms	14124 KB	Output is correct
13	Correct	85 ms	14124 KB	Output is correct
14	Correct	97 ms	14204 KB	Output is correct
15	Correct	75 ms	14252 KB	Output is correct
16	Correct	105 ms	14252 KB	Output is correct
17	Correct	100 ms	14252 KB	Output is correct
18	Correct	63 ms	14308 KB	Output is correct
19	Correct	74 ms	14308 KB	Output is correct
20	Correct	79 ms	14308 KB	Output is correct
21	Correct	91 ms	14308 KB	Output is correct
22	Correct	96 ms	14308 KB	Output is correct
23	Correct	75 ms	14308 KB	Output is correct
24	Correct	119 ms	14308 KB	Output is correct
25	Correct	139 ms	14312 KB	Output is correct
26	Correct	70 ms	14312 KB	Output is correct
27	Correct	89 ms	14312 KB	Output is correct
28	Correct	81 ms	14312 KB	Output is correct
29	Correct	100 ms	14312 KB	Output is correct
30	Correct	97 ms	14312 KB	Output is correct
31	Correct	84 ms	14312 KB	Output is correct
32	Correct	140 ms	14312 KB	Output is correct
33	Correct	99 ms	14312 KB	Output is correct
34	Correct	69 ms	14312 KB	Output is correct
35	Correct	94 ms	14312 KB	Output is correct
36	Correct	95 ms	14312 KB	Output is correct
37	Correct	92 ms	14312 KB	Output is correct
38	Correct	96 ms	14312 KB	Output is correct
39	Correct	113 ms	14312 KB	Output is correct
40	Correct	102 ms	14312 KB	Output is correct

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	4472 KB	Output is correct
2	Correct	7 ms	4584 KB	Output is correct
3	Correct	7 ms	4584 KB	Output is correct
4	Correct	7 ms	4584 KB	Output is correct
5	Correct	7 ms	4584 KB	Output is correct
6	Correct	7 ms	4584 KB	Output is correct
7	Correct	8 ms	4584 KB	Output is correct
8	Correct	8 ms	4584 KB	Output is correct
9	Correct	7 ms	4584 KB	Output is correct
10	Correct	6 ms	4584 KB	Output is correct
11	Correct	418 ms	8628 KB	Output is correct
12	Correct	390 ms	8628 KB	Output is correct
13	Correct	314 ms	8628 KB	Output is correct
14	Correct	339 ms	8628 KB	Output is correct
15	Correct	288 ms	8628 KB	Output is correct
16	Correct	319 ms	8628 KB	Output is correct
17	Correct	437 ms	8628 KB	Output is correct
18	Correct	323 ms	9624 KB	Output is correct
19	Correct	344 ms	9624 KB	Output is correct
20	Correct	352 ms	9624 KB	Output is correct
21	Correct	418 ms	9624 KB	Output is correct
22	Correct	492 ms	9624 KB	Output is correct
23	Correct	466 ms	9624 KB	Output is correct
24	Correct	492 ms	9624 KB	Output is correct
25	Correct	351 ms	9764 KB	Output is correct
26	Correct	423 ms	9764 KB	Output is correct
27	Correct	440 ms	9764 KB	Output is correct
28	Correct	267 ms	10672 KB	Output is correct
29	Correct	365 ms	10672 KB	Output is correct
30	Correct	386 ms	10672 KB	Output is correct
31	Correct	412 ms	10672 KB	Output is correct
32	Correct	451 ms	10672 KB	Output is correct
33	Correct	485 ms	10672 KB	Output is correct
34	Correct	485 ms	10672 KB	Output is correct
35	Correct	437 ms	10672 KB	Output is correct
36	Correct	333 ms	10672 KB	Output is correct
37	Correct	376 ms	10672 KB	Output is correct
38	Correct	334 ms	10672 KB	Output is correct
39	Correct	410 ms	10672 KB	Output is correct
40	Correct	558 ms	10672 KB	Output is correct
41	Correct	75 ms	14124 KB	Output is correct
42	Correct	87 ms	14124 KB	Output is correct
43	Correct	85 ms	14124 KB	Output is correct
44	Correct	97 ms	14204 KB	Output is correct
45	Correct	75 ms	14252 KB	Output is correct
46	Correct	105 ms	14252 KB	Output is correct
47	Correct	100 ms	14252 KB	Output is correct
48	Correct	63 ms	14308 KB	Output is correct
49	Correct	74 ms	14308 KB	Output is correct
50	Correct	79 ms	14308 KB	Output is correct
51	Correct	91 ms	14308 KB	Output is correct
52	Correct	96 ms	14308 KB	Output is correct
53	Correct	75 ms	14308 KB	Output is correct
54	Correct	119 ms	14308 KB	Output is correct
55	Correct	139 ms	14312 KB	Output is correct
56	Correct	70 ms	14312 KB	Output is correct
57	Correct	89 ms	14312 KB	Output is correct
58	Correct	81 ms	14312 KB	Output is correct
59	Correct	100 ms	14312 KB	Output is correct
60	Correct	97 ms	14312 KB	Output is correct
61	Correct	84 ms	14312 KB	Output is correct
62	Correct	140 ms	14312 KB	Output is correct
63	Correct	99 ms	14312 KB	Output is correct
64	Correct	69 ms	14312 KB	Output is correct
65	Correct	94 ms	14312 KB	Output is correct
66	Correct	95 ms	14312 KB	Output is correct
67	Correct	92 ms	14312 KB	Output is correct
68	Correct	96 ms	14312 KB	Output is correct
69	Correct	113 ms	14312 KB	Output is correct
70	Correct	102 ms	14312 KB	Output is correct
71	Correct	725 ms	18816 KB	Output is correct
72	Correct	736 ms	19256 KB	Output is correct
73	Correct	987 ms	19256 KB	Output is correct
74	Correct	1217 ms	19256 KB	Output is correct
75	Correct	872 ms	35996 KB	Output is correct
76	Correct	1504 ms	35996 KB	Output is correct
77	Correct	1241 ms	35996 KB	Output is correct
78	Correct	377 ms	37768 KB	Output is correct
79	Correct	659 ms	37768 KB	Output is correct
80	Correct	680 ms	37768 KB	Output is correct
81	Correct	1004 ms	56516 KB	Output is correct
82	Correct	1560 ms	56516 KB	Output is correct
83	Correct	659 ms	56516 KB	Output is correct
84	Correct	1391 ms	56516 KB	Output is correct
85	Correct	1206 ms	56516 KB	Output is correct
86	Correct	372 ms	56516 KB	Output is correct
87	Correct	702 ms	56516 KB	Output is correct
88	Correct	680 ms	56516 KB	Output is correct
89	Runtime error	876 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.
90	Halted	0 ms	0 KB	-

Submission #58959

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