Submission #58960

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
58960	2018-07-19T21:34:56 Z	TadijaSebez	Snake Escaping (JOI18_snake_escaping)	C++11	75 / 100	1524 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	8 ms	4592 KB	Output is correct
3	Correct	7 ms	4592 KB	Output is correct
4	Correct	7 ms	4672 KB	Output is correct
5	Correct	8 ms	4672 KB	Output is correct
6	Correct	7 ms	4672 KB	Output is correct
7	Correct	7 ms	4676 KB	Output is correct
8	Correct	7 ms	4736 KB	Output is correct
9	Correct	6 ms	4748 KB	Output is correct
10	Correct	7 ms	4808 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	8 ms	4592 KB	Output is correct
3	Correct	7 ms	4592 KB	Output is correct
4	Correct	7 ms	4672 KB	Output is correct
5	Correct	8 ms	4672 KB	Output is correct
6	Correct	7 ms	4672 KB	Output is correct
7	Correct	7 ms	4676 KB	Output is correct
8	Correct	7 ms	4736 KB	Output is correct
9	Correct	6 ms	4748 KB	Output is correct
10	Correct	7 ms	4808 KB	Output is correct
11	Correct	306 ms	9168 KB	Output is correct
12	Correct	300 ms	9168 KB	Output is correct
13	Correct	364 ms	9168 KB	Output is correct
14	Correct	314 ms	9168 KB	Output is correct
15	Correct	293 ms	9412 KB	Output is correct
16	Correct	421 ms	9412 KB	Output is correct
17	Correct	465 ms	9412 KB	Output is correct
18	Correct	238 ms	10436 KB	Output is correct
19	Correct	334 ms	10436 KB	Output is correct
20	Correct	344 ms	10436 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	8 ms	4592 KB	Output is correct
3	Correct	7 ms	4592 KB	Output is correct
4	Correct	7 ms	4672 KB	Output is correct
5	Correct	8 ms	4672 KB	Output is correct
6	Correct	7 ms	4672 KB	Output is correct
7	Correct	7 ms	4676 KB	Output is correct
8	Correct	7 ms	4736 KB	Output is correct
9	Correct	6 ms	4748 KB	Output is correct
10	Correct	7 ms	4808 KB	Output is correct
11	Correct	306 ms	9168 KB	Output is correct
12	Correct	300 ms	9168 KB	Output is correct
13	Correct	364 ms	9168 KB	Output is correct
14	Correct	314 ms	9168 KB	Output is correct
15	Correct	293 ms	9412 KB	Output is correct
16	Correct	421 ms	9412 KB	Output is correct
17	Correct	465 ms	9412 KB	Output is correct
18	Correct	238 ms	10436 KB	Output is correct
19	Correct	334 ms	10436 KB	Output is correct
20	Correct	344 ms	10436 KB	Output is correct
21	Correct	367 ms	10436 KB	Output is correct
22	Correct	383 ms	10436 KB	Output is correct
23	Correct	384 ms	10436 KB	Output is correct
24	Correct	410 ms	10436 KB	Output is correct
25	Correct	396 ms	10916 KB	Output is correct
26	Correct	435 ms	10916 KB	Output is correct
27	Correct	535 ms	10916 KB	Output is correct
28	Correct	288 ms	11760 KB	Output is correct
29	Correct	435 ms	11760 KB	Output is correct
30	Correct	423 ms	11760 KB	Output is correct
31	Correct	430 ms	11760 KB	Output is correct
32	Correct	454 ms	11760 KB	Output is correct
33	Correct	433 ms	11760 KB	Output is correct
34	Correct	479 ms	11760 KB	Output is correct
35	Correct	512 ms	11760 KB	Output is correct
36	Correct	310 ms	11760 KB	Output is correct
37	Correct	357 ms	11760 KB	Output is correct
38	Correct	403 ms	11760 KB	Output is correct
39	Correct	556 ms	11760 KB	Output is correct
40	Correct	472 ms	11760 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	8 ms	4592 KB	Output is correct
3	Correct	7 ms	4592 KB	Output is correct
4	Correct	7 ms	4672 KB	Output is correct
5	Correct	8 ms	4672 KB	Output is correct
6	Correct	7 ms	4672 KB	Output is correct
7	Correct	7 ms	4676 KB	Output is correct
8	Correct	7 ms	4736 KB	Output is correct
9	Correct	6 ms	4748 KB	Output is correct
10	Correct	7 ms	4808 KB	Output is correct
11	Correct	80 ms	16288 KB	Output is correct
12	Correct	88 ms	16288 KB	Output is correct
13	Correct	89 ms	16288 KB	Output is correct
14	Correct	114 ms	16288 KB	Output is correct
15	Correct	84 ms	16288 KB	Output is correct
16	Correct	135 ms	16308 KB	Output is correct
17	Correct	112 ms	16384 KB	Output is correct
18	Correct	72 ms	16384 KB	Output is correct
19	Correct	84 ms	16384 KB	Output is correct
20	Correct	98 ms	16384 KB	Output is correct
21	Correct	100 ms	16384 KB	Output is correct
22	Correct	130 ms	16384 KB	Output is correct
23	Correct	118 ms	16384 KB	Output is correct
24	Correct	120 ms	16384 KB	Output is correct
25	Correct	105 ms	16384 KB	Output is correct
26	Correct	72 ms	16384 KB	Output is correct
27	Correct	81 ms	16384 KB	Output is correct
28	Correct	88 ms	16384 KB	Output is correct
29	Correct	97 ms	16384 KB	Output is correct
30	Correct	135 ms	16384 KB	Output is correct
31	Correct	90 ms	16384 KB	Output is correct
32	Correct	128 ms	16384 KB	Output is correct
33	Correct	130 ms	16384 KB	Output is correct
34	Correct	70 ms	16384 KB	Output is correct
35	Correct	105 ms	16384 KB	Output is correct
36	Correct	89 ms	16384 KB	Output is correct
37	Correct	107 ms	16384 KB	Output is correct
38	Correct	101 ms	16384 KB	Output is correct
39	Correct	94 ms	16384 KB	Output is correct
40	Correct	92 ms	16384 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	8 ms	4592 KB	Output is correct
3	Correct	7 ms	4592 KB	Output is correct
4	Correct	7 ms	4672 KB	Output is correct
5	Correct	8 ms	4672 KB	Output is correct
6	Correct	7 ms	4672 KB	Output is correct
7	Correct	7 ms	4676 KB	Output is correct
8	Correct	7 ms	4736 KB	Output is correct
9	Correct	6 ms	4748 KB	Output is correct
10	Correct	7 ms	4808 KB	Output is correct
11	Correct	306 ms	9168 KB	Output is correct
12	Correct	300 ms	9168 KB	Output is correct
13	Correct	364 ms	9168 KB	Output is correct
14	Correct	314 ms	9168 KB	Output is correct
15	Correct	293 ms	9412 KB	Output is correct
16	Correct	421 ms	9412 KB	Output is correct
17	Correct	465 ms	9412 KB	Output is correct
18	Correct	238 ms	10436 KB	Output is correct
19	Correct	334 ms	10436 KB	Output is correct
20	Correct	344 ms	10436 KB	Output is correct
21	Correct	367 ms	10436 KB	Output is correct
22	Correct	383 ms	10436 KB	Output is correct
23	Correct	384 ms	10436 KB	Output is correct
24	Correct	410 ms	10436 KB	Output is correct
25	Correct	396 ms	10916 KB	Output is correct
26	Correct	435 ms	10916 KB	Output is correct
27	Correct	535 ms	10916 KB	Output is correct
28	Correct	288 ms	11760 KB	Output is correct
29	Correct	435 ms	11760 KB	Output is correct
30	Correct	423 ms	11760 KB	Output is correct
31	Correct	430 ms	11760 KB	Output is correct
32	Correct	454 ms	11760 KB	Output is correct
33	Correct	433 ms	11760 KB	Output is correct
34	Correct	479 ms	11760 KB	Output is correct
35	Correct	512 ms	11760 KB	Output is correct
36	Correct	310 ms	11760 KB	Output is correct
37	Correct	357 ms	11760 KB	Output is correct
38	Correct	403 ms	11760 KB	Output is correct
39	Correct	556 ms	11760 KB	Output is correct
40	Correct	472 ms	11760 KB	Output is correct
41	Correct	80 ms	16288 KB	Output is correct
42	Correct	88 ms	16288 KB	Output is correct
43	Correct	89 ms	16288 KB	Output is correct
44	Correct	114 ms	16288 KB	Output is correct
45	Correct	84 ms	16288 KB	Output is correct
46	Correct	135 ms	16308 KB	Output is correct
47	Correct	112 ms	16384 KB	Output is correct
48	Correct	72 ms	16384 KB	Output is correct
49	Correct	84 ms	16384 KB	Output is correct
50	Correct	98 ms	16384 KB	Output is correct
51	Correct	100 ms	16384 KB	Output is correct
52	Correct	130 ms	16384 KB	Output is correct
53	Correct	118 ms	16384 KB	Output is correct
54	Correct	120 ms	16384 KB	Output is correct
55	Correct	105 ms	16384 KB	Output is correct
56	Correct	72 ms	16384 KB	Output is correct
57	Correct	81 ms	16384 KB	Output is correct
58	Correct	88 ms	16384 KB	Output is correct
59	Correct	97 ms	16384 KB	Output is correct
60	Correct	135 ms	16384 KB	Output is correct
61	Correct	90 ms	16384 KB	Output is correct
62	Correct	128 ms	16384 KB	Output is correct
63	Correct	130 ms	16384 KB	Output is correct
64	Correct	70 ms	16384 KB	Output is correct
65	Correct	105 ms	16384 KB	Output is correct
66	Correct	89 ms	16384 KB	Output is correct
67	Correct	107 ms	16384 KB	Output is correct
68	Correct	101 ms	16384 KB	Output is correct
69	Correct	94 ms	16384 KB	Output is correct
70	Correct	92 ms	16384 KB	Output is correct
71	Correct	645 ms	20916 KB	Output is correct
72	Correct	687 ms	21792 KB	Output is correct
73	Correct	1012 ms	21792 KB	Output is correct
74	Correct	1524 ms	21792 KB	Output is correct
75	Correct	723 ms	23492 KB	Output is correct
76	Correct	1424 ms	23492 KB	Output is correct
77	Correct	1169 ms	23492 KB	Output is correct
78	Correct	387 ms	25420 KB	Output is correct
79	Correct	664 ms	25420 KB	Output is correct
80	Correct	727 ms	25420 KB	Output is correct
81	Correct	936 ms	44248 KB	Output is correct
82	Correct	1301 ms	64932 KB	Output is correct
83	Correct	699 ms	64932 KB	Output is correct
84	Correct	1370 ms	64932 KB	Output is correct
85	Runtime error	1295 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.
86	Halted	0 ms	0 KB	-

Submission #58960

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