Submission #58963

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
58963	2018-07-19T21:37:41 Z	TadijaSebez	Snake Escaping (JOI18_snake_escaping)	C++11	75 / 100	1562 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	7 ms	4472 KB	Output is correct
2	Correct	6 ms	4472 KB	Output is correct
3	Correct	6 ms	4680 KB	Output is correct
4	Correct	6 ms	4680 KB	Output is correct
5	Correct	7 ms	4684 KB	Output is correct
6	Correct	9 ms	4796 KB	Output is correct
7	Correct	8 ms	4796 KB	Output is correct
8	Correct	7 ms	4892 KB	Output is correct
9	Correct	8 ms	4892 KB	Output is correct
10	Correct	8 ms	4892 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	4472 KB	Output is correct
2	Correct	6 ms	4472 KB	Output is correct
3	Correct	6 ms	4680 KB	Output is correct
4	Correct	6 ms	4680 KB	Output is correct
5	Correct	7 ms	4684 KB	Output is correct
6	Correct	9 ms	4796 KB	Output is correct
7	Correct	8 ms	4796 KB	Output is correct
8	Correct	7 ms	4892 KB	Output is correct
9	Correct	8 ms	4892 KB	Output is correct
10	Correct	8 ms	4892 KB	Output is correct
11	Correct	354 ms	10068 KB	Output is correct
12	Correct	357 ms	10520 KB	Output is correct
13	Correct	393 ms	10520 KB	Output is correct
14	Correct	362 ms	10520 KB	Output is correct
15	Correct	339 ms	10764 KB	Output is correct
16	Correct	377 ms	10764 KB	Output is correct
17	Correct	397 ms	10764 KB	Output is correct
18	Correct	291 ms	11856 KB	Output is correct
19	Correct	265 ms	11856 KB	Output is correct
20	Correct	347 ms	11856 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	4472 KB	Output is correct
2	Correct	6 ms	4472 KB	Output is correct
3	Correct	6 ms	4680 KB	Output is correct
4	Correct	6 ms	4680 KB	Output is correct
5	Correct	7 ms	4684 KB	Output is correct
6	Correct	9 ms	4796 KB	Output is correct
7	Correct	8 ms	4796 KB	Output is correct
8	Correct	7 ms	4892 KB	Output is correct
9	Correct	8 ms	4892 KB	Output is correct
10	Correct	8 ms	4892 KB	Output is correct
11	Correct	354 ms	10068 KB	Output is correct
12	Correct	357 ms	10520 KB	Output is correct
13	Correct	393 ms	10520 KB	Output is correct
14	Correct	362 ms	10520 KB	Output is correct
15	Correct	339 ms	10764 KB	Output is correct
16	Correct	377 ms	10764 KB	Output is correct
17	Correct	397 ms	10764 KB	Output is correct
18	Correct	291 ms	11856 KB	Output is correct
19	Correct	265 ms	11856 KB	Output is correct
20	Correct	347 ms	11856 KB	Output is correct
21	Correct	397 ms	11856 KB	Output is correct
22	Correct	421 ms	11856 KB	Output is correct
23	Correct	447 ms	11856 KB	Output is correct
24	Correct	435 ms	11856 KB	Output is correct
25	Correct	392 ms	12932 KB	Output is correct
26	Correct	427 ms	12932 KB	Output is correct
27	Correct	399 ms	12932 KB	Output is correct
28	Correct	249 ms	13868 KB	Output is correct
29	Correct	386 ms	13868 KB	Output is correct
30	Correct	359 ms	13868 KB	Output is correct
31	Correct	369 ms	13868 KB	Output is correct
32	Correct	413 ms	13868 KB	Output is correct
33	Correct	391 ms	13868 KB	Output is correct
34	Correct	403 ms	13868 KB	Output is correct
35	Correct	431 ms	13868 KB	Output is correct
36	Correct	337 ms	13868 KB	Output is correct
37	Correct	369 ms	13868 KB	Output is correct
38	Correct	367 ms	13868 KB	Output is correct
39	Correct	424 ms	13868 KB	Output is correct
40	Correct	596 ms	13868 KB	Output is correct

Subtask #4
53.0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	4472 KB	Output is correct
2	Correct	6 ms	4472 KB	Output is correct
3	Correct	6 ms	4680 KB	Output is correct
4	Correct	6 ms	4680 KB	Output is correct
5	Correct	7 ms	4684 KB	Output is correct
6	Correct	9 ms	4796 KB	Output is correct
7	Correct	8 ms	4796 KB	Output is correct
8	Correct	7 ms	4892 KB	Output is correct
9	Correct	8 ms	4892 KB	Output is correct
10	Correct	8 ms	4892 KB	Output is correct
11	Correct	86 ms	19032 KB	Output is correct
12	Correct	74 ms	19032 KB	Output is correct
13	Correct	92 ms	19036 KB	Output is correct
14	Correct	105 ms	19120 KB	Output is correct
15	Correct	83 ms	19160 KB	Output is correct
16	Correct	107 ms	19180 KB	Output is correct
17	Correct	104 ms	19180 KB	Output is correct
18	Correct	67 ms	19180 KB	Output is correct
19	Correct	93 ms	19180 KB	Output is correct
20	Correct	88 ms	19180 KB	Output is correct
21	Correct	93 ms	19208 KB	Output is correct
22	Correct	118 ms	19208 KB	Output is correct
23	Correct	87 ms	19208 KB	Output is correct
24	Correct	124 ms	19208 KB	Output is correct
25	Correct	118 ms	19208 KB	Output is correct
26	Correct	72 ms	19208 KB	Output is correct
27	Correct	80 ms	19208 KB	Output is correct
28	Correct	87 ms	19208 KB	Output is correct
29	Correct	120 ms	19352 KB	Output is correct
30	Correct	102 ms	19352 KB	Output is correct
31	Correct	85 ms	19352 KB	Output is correct
32	Correct	122 ms	19352 KB	Output is correct
33	Correct	112 ms	19384 KB	Output is correct
34	Correct	104 ms	19384 KB	Output is correct
35	Correct	119 ms	19384 KB	Output is correct
36	Correct	111 ms	19384 KB	Output is correct
37	Correct	110 ms	19384 KB	Output is correct
38	Correct	119 ms	19384 KB	Output is correct
39	Correct	139 ms	19392 KB	Output is correct
40	Correct	90 ms	19464 KB	Output is correct

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	4472 KB	Output is correct
2	Correct	6 ms	4472 KB	Output is correct
3	Correct	6 ms	4680 KB	Output is correct
4	Correct	6 ms	4680 KB	Output is correct
5	Correct	7 ms	4684 KB	Output is correct
6	Correct	9 ms	4796 KB	Output is correct
7	Correct	8 ms	4796 KB	Output is correct
8	Correct	7 ms	4892 KB	Output is correct
9	Correct	8 ms	4892 KB	Output is correct
10	Correct	8 ms	4892 KB	Output is correct
11	Correct	354 ms	10068 KB	Output is correct
12	Correct	357 ms	10520 KB	Output is correct
13	Correct	393 ms	10520 KB	Output is correct
14	Correct	362 ms	10520 KB	Output is correct
15	Correct	339 ms	10764 KB	Output is correct
16	Correct	377 ms	10764 KB	Output is correct
17	Correct	397 ms	10764 KB	Output is correct
18	Correct	291 ms	11856 KB	Output is correct
19	Correct	265 ms	11856 KB	Output is correct
20	Correct	347 ms	11856 KB	Output is correct
21	Correct	397 ms	11856 KB	Output is correct
22	Correct	421 ms	11856 KB	Output is correct
23	Correct	447 ms	11856 KB	Output is correct
24	Correct	435 ms	11856 KB	Output is correct
25	Correct	392 ms	12932 KB	Output is correct
26	Correct	427 ms	12932 KB	Output is correct
27	Correct	399 ms	12932 KB	Output is correct
28	Correct	249 ms	13868 KB	Output is correct
29	Correct	386 ms	13868 KB	Output is correct
30	Correct	359 ms	13868 KB	Output is correct
31	Correct	369 ms	13868 KB	Output is correct
32	Correct	413 ms	13868 KB	Output is correct
33	Correct	391 ms	13868 KB	Output is correct
34	Correct	403 ms	13868 KB	Output is correct
35	Correct	431 ms	13868 KB	Output is correct
36	Correct	337 ms	13868 KB	Output is correct
37	Correct	369 ms	13868 KB	Output is correct
38	Correct	367 ms	13868 KB	Output is correct
39	Correct	424 ms	13868 KB	Output is correct
40	Correct	596 ms	13868 KB	Output is correct
41	Correct	86 ms	19032 KB	Output is correct
42	Correct	74 ms	19032 KB	Output is correct
43	Correct	92 ms	19036 KB	Output is correct
44	Correct	105 ms	19120 KB	Output is correct
45	Correct	83 ms	19160 KB	Output is correct
46	Correct	107 ms	19180 KB	Output is correct
47	Correct	104 ms	19180 KB	Output is correct
48	Correct	67 ms	19180 KB	Output is correct
49	Correct	93 ms	19180 KB	Output is correct
50	Correct	88 ms	19180 KB	Output is correct
51	Correct	93 ms	19208 KB	Output is correct
52	Correct	118 ms	19208 KB	Output is correct
53	Correct	87 ms	19208 KB	Output is correct
54	Correct	124 ms	19208 KB	Output is correct
55	Correct	118 ms	19208 KB	Output is correct
56	Correct	72 ms	19208 KB	Output is correct
57	Correct	80 ms	19208 KB	Output is correct
58	Correct	87 ms	19208 KB	Output is correct
59	Correct	120 ms	19352 KB	Output is correct
60	Correct	102 ms	19352 KB	Output is correct
61	Correct	85 ms	19352 KB	Output is correct
62	Correct	122 ms	19352 KB	Output is correct
63	Correct	112 ms	19384 KB	Output is correct
64	Correct	104 ms	19384 KB	Output is correct
65	Correct	119 ms	19384 KB	Output is correct
66	Correct	111 ms	19384 KB	Output is correct
67	Correct	110 ms	19384 KB	Output is correct
68	Correct	119 ms	19384 KB	Output is correct
69	Correct	139 ms	19392 KB	Output is correct
70	Correct	90 ms	19464 KB	Output is correct
71	Correct	616 ms	24148 KB	Output is correct
72	Correct	674 ms	24712 KB	Output is correct
73	Correct	976 ms	24712 KB	Output is correct
74	Correct	1506 ms	24712 KB	Output is correct
75	Correct	743 ms	26060 KB	Output is correct
76	Correct	1562 ms	26060 KB	Output is correct
77	Correct	1386 ms	26060 KB	Output is correct
78	Correct	448 ms	27940 KB	Output is correct
79	Correct	618 ms	27940 KB	Output is correct
80	Correct	670 ms	27940 KB	Output is correct
81	Correct	912 ms	27940 KB	Output is correct
82	Correct	1427 ms	27940 KB	Output is correct
83	Correct	726 ms	36524 KB	Output is correct
84	Correct	1519 ms	37308 KB	Output is correct
85	Correct	998 ms	37436 KB	Output is correct
86	Correct	407 ms	37436 KB	Output is correct
87	Correct	652 ms	38160 KB	Output is correct
88	Correct	635 ms	56892 KB	Output is correct
89	Correct	1014 ms	58944 KB	Output is correct
90	Runtime error	902 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.
91	Halted	0 ms	0 KB	-

Submission #58963

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