Submission #58962

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
58962	2018-07-19T21:36:45 Z	TadijaSebez	Snake Escaping (JOI18_snake_escaping)	C++11	75 / 100	1610 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	8 ms	4344 KB	Output is correct
2	Correct	7 ms	4464 KB	Output is correct
3	Correct	8 ms	4552 KB	Output is correct
4	Correct	8 ms	4592 KB	Output is correct
5	Correct	7 ms	4604 KB	Output is correct
6	Correct	8 ms	4692 KB	Output is correct
7	Correct	8 ms	4704 KB	Output is correct
8	Correct	8 ms	4764 KB	Output is correct
9	Correct	7 ms	4776 KB	Output is correct
10	Correct	8 ms	4888 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4344 KB	Output is correct
2	Correct	7 ms	4464 KB	Output is correct
3	Correct	8 ms	4552 KB	Output is correct
4	Correct	8 ms	4592 KB	Output is correct
5	Correct	7 ms	4604 KB	Output is correct
6	Correct	8 ms	4692 KB	Output is correct
7	Correct	8 ms	4704 KB	Output is correct
8	Correct	8 ms	4764 KB	Output is correct
9	Correct	7 ms	4776 KB	Output is correct
10	Correct	8 ms	4888 KB	Output is correct
11	Correct	317 ms	9792 KB	Output is correct
12	Correct	296 ms	9884 KB	Output is correct
13	Correct	343 ms	9884 KB	Output is correct
14	Correct	321 ms	9884 KB	Output is correct
15	Correct	344 ms	10416 KB	Output is correct
16	Correct	374 ms	10416 KB	Output is correct
17	Correct	360 ms	10416 KB	Output is correct
18	Correct	268 ms	11316 KB	Output is correct
19	Correct	286 ms	11316 KB	Output is correct
20	Correct	338 ms	11316 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4344 KB	Output is correct
2	Correct	7 ms	4464 KB	Output is correct
3	Correct	8 ms	4552 KB	Output is correct
4	Correct	8 ms	4592 KB	Output is correct
5	Correct	7 ms	4604 KB	Output is correct
6	Correct	8 ms	4692 KB	Output is correct
7	Correct	8 ms	4704 KB	Output is correct
8	Correct	8 ms	4764 KB	Output is correct
9	Correct	7 ms	4776 KB	Output is correct
10	Correct	8 ms	4888 KB	Output is correct
11	Correct	317 ms	9792 KB	Output is correct
12	Correct	296 ms	9884 KB	Output is correct
13	Correct	343 ms	9884 KB	Output is correct
14	Correct	321 ms	9884 KB	Output is correct
15	Correct	344 ms	10416 KB	Output is correct
16	Correct	374 ms	10416 KB	Output is correct
17	Correct	360 ms	10416 KB	Output is correct
18	Correct	268 ms	11316 KB	Output is correct
19	Correct	286 ms	11316 KB	Output is correct
20	Correct	338 ms	11316 KB	Output is correct
21	Correct	374 ms	11316 KB	Output is correct
22	Correct	421 ms	11316 KB	Output is correct
23	Correct	514 ms	11316 KB	Output is correct
24	Correct	481 ms	11316 KB	Output is correct
25	Correct	430 ms	12232 KB	Output is correct
26	Correct	442 ms	12232 KB	Output is correct
27	Correct	451 ms	12232 KB	Output is correct
28	Correct	250 ms	13168 KB	Output is correct
29	Correct	349 ms	13168 KB	Output is correct
30	Correct	347 ms	13168 KB	Output is correct
31	Correct	369 ms	13168 KB	Output is correct
32	Correct	449 ms	13168 KB	Output is correct
33	Correct	408 ms	13168 KB	Output is correct
34	Correct	461 ms	13168 KB	Output is correct
35	Correct	420 ms	13168 KB	Output is correct
36	Correct	262 ms	13168 KB	Output is correct
37	Correct	370 ms	13168 KB	Output is correct
38	Correct	348 ms	13168 KB	Output is correct
39	Correct	405 ms	13168 KB	Output is correct
40	Correct	385 ms	13168 KB	Output is correct

Subtask #4
53.0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4344 KB	Output is correct
2	Correct	7 ms	4464 KB	Output is correct
3	Correct	8 ms	4552 KB	Output is correct
4	Correct	8 ms	4592 KB	Output is correct
5	Correct	7 ms	4604 KB	Output is correct
6	Correct	8 ms	4692 KB	Output is correct
7	Correct	8 ms	4704 KB	Output is correct
8	Correct	8 ms	4764 KB	Output is correct
9	Correct	7 ms	4776 KB	Output is correct
10	Correct	8 ms	4888 KB	Output is correct
11	Correct	75 ms	18012 KB	Output is correct
12	Correct	92 ms	18048 KB	Output is correct
13	Correct	108 ms	18048 KB	Output is correct
14	Correct	90 ms	18048 KB	Output is correct
15	Correct	124 ms	18048 KB	Output is correct
16	Correct	101 ms	18048 KB	Output is correct
17	Correct	113 ms	18048 KB	Output is correct
18	Correct	69 ms	18168 KB	Output is correct
19	Correct	115 ms	18168 KB	Output is correct
20	Correct	72 ms	18168 KB	Output is correct
21	Correct	101 ms	18168 KB	Output is correct
22	Correct	158 ms	18168 KB	Output is correct
23	Correct	71 ms	18168 KB	Output is correct
24	Correct	97 ms	18168 KB	Output is correct
25	Correct	121 ms	18168 KB	Output is correct
26	Correct	62 ms	18168 KB	Output is correct
27	Correct	91 ms	18168 KB	Output is correct
28	Correct	98 ms	18168 KB	Output is correct
29	Correct	107 ms	18176 KB	Output is correct
30	Correct	100 ms	18176 KB	Output is correct
31	Correct	90 ms	18176 KB	Output is correct
32	Correct	141 ms	18272 KB	Output is correct
33	Correct	129 ms	18272 KB	Output is correct
34	Correct	75 ms	18272 KB	Output is correct
35	Correct	106 ms	18272 KB	Output is correct
36	Correct	100 ms	18272 KB	Output is correct
37	Correct	108 ms	18272 KB	Output is correct
38	Correct	105 ms	18272 KB	Output is correct
39	Correct	104 ms	18272 KB	Output is correct
40	Correct	132 ms	18272 KB	Output is correct

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4344 KB	Output is correct
2	Correct	7 ms	4464 KB	Output is correct
3	Correct	8 ms	4552 KB	Output is correct
4	Correct	8 ms	4592 KB	Output is correct
5	Correct	7 ms	4604 KB	Output is correct
6	Correct	8 ms	4692 KB	Output is correct
7	Correct	8 ms	4704 KB	Output is correct
8	Correct	8 ms	4764 KB	Output is correct
9	Correct	7 ms	4776 KB	Output is correct
10	Correct	8 ms	4888 KB	Output is correct
11	Correct	317 ms	9792 KB	Output is correct
12	Correct	296 ms	9884 KB	Output is correct
13	Correct	343 ms	9884 KB	Output is correct
14	Correct	321 ms	9884 KB	Output is correct
15	Correct	344 ms	10416 KB	Output is correct
16	Correct	374 ms	10416 KB	Output is correct
17	Correct	360 ms	10416 KB	Output is correct
18	Correct	268 ms	11316 KB	Output is correct
19	Correct	286 ms	11316 KB	Output is correct
20	Correct	338 ms	11316 KB	Output is correct
21	Correct	374 ms	11316 KB	Output is correct
22	Correct	421 ms	11316 KB	Output is correct
23	Correct	514 ms	11316 KB	Output is correct
24	Correct	481 ms	11316 KB	Output is correct
25	Correct	430 ms	12232 KB	Output is correct
26	Correct	442 ms	12232 KB	Output is correct
27	Correct	451 ms	12232 KB	Output is correct
28	Correct	250 ms	13168 KB	Output is correct
29	Correct	349 ms	13168 KB	Output is correct
30	Correct	347 ms	13168 KB	Output is correct
31	Correct	369 ms	13168 KB	Output is correct
32	Correct	449 ms	13168 KB	Output is correct
33	Correct	408 ms	13168 KB	Output is correct
34	Correct	461 ms	13168 KB	Output is correct
35	Correct	420 ms	13168 KB	Output is correct
36	Correct	262 ms	13168 KB	Output is correct
37	Correct	370 ms	13168 KB	Output is correct
38	Correct	348 ms	13168 KB	Output is correct
39	Correct	405 ms	13168 KB	Output is correct
40	Correct	385 ms	13168 KB	Output is correct
41	Correct	75 ms	18012 KB	Output is correct
42	Correct	92 ms	18048 KB	Output is correct
43	Correct	108 ms	18048 KB	Output is correct
44	Correct	90 ms	18048 KB	Output is correct
45	Correct	124 ms	18048 KB	Output is correct
46	Correct	101 ms	18048 KB	Output is correct
47	Correct	113 ms	18048 KB	Output is correct
48	Correct	69 ms	18168 KB	Output is correct
49	Correct	115 ms	18168 KB	Output is correct
50	Correct	72 ms	18168 KB	Output is correct
51	Correct	101 ms	18168 KB	Output is correct
52	Correct	158 ms	18168 KB	Output is correct
53	Correct	71 ms	18168 KB	Output is correct
54	Correct	97 ms	18168 KB	Output is correct
55	Correct	121 ms	18168 KB	Output is correct
56	Correct	62 ms	18168 KB	Output is correct
57	Correct	91 ms	18168 KB	Output is correct
58	Correct	98 ms	18168 KB	Output is correct
59	Correct	107 ms	18176 KB	Output is correct
60	Correct	100 ms	18176 KB	Output is correct
61	Correct	90 ms	18176 KB	Output is correct
62	Correct	141 ms	18272 KB	Output is correct
63	Correct	129 ms	18272 KB	Output is correct
64	Correct	75 ms	18272 KB	Output is correct
65	Correct	106 ms	18272 KB	Output is correct
66	Correct	100 ms	18272 KB	Output is correct
67	Correct	108 ms	18272 KB	Output is correct
68	Correct	105 ms	18272 KB	Output is correct
69	Correct	104 ms	18272 KB	Output is correct
70	Correct	132 ms	18272 KB	Output is correct
71	Correct	680 ms	23020 KB	Output is correct
72	Correct	677 ms	23596 KB	Output is correct
73	Correct	995 ms	23596 KB	Output is correct
74	Correct	1610 ms	23596 KB	Output is correct
75	Correct	640 ms	24700 KB	Output is correct
76	Correct	1294 ms	24700 KB	Output is correct
77	Correct	1267 ms	24700 KB	Output is correct
78	Correct	404 ms	26528 KB	Output is correct
79	Correct	599 ms	26528 KB	Output is correct
80	Correct	690 ms	26528 KB	Output is correct
81	Correct	996 ms	26528 KB	Output is correct
82	Correct	1305 ms	26528 KB	Output is correct
83	Correct	723 ms	39584 KB	Output is correct
84	Correct	1456 ms	40396 KB	Output is correct
85	Correct	1145 ms	40536 KB	Output is correct
86	Correct	373 ms	59916 KB	Output is correct
87	Runtime error	688 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.
88	Halted	0 ms	0 KB	-

Submission #58962

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