Submission #58951

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
58951	2018-07-19T21:27:36 Z	TadijaSebez	Snake Escaping (JOI18_snake_escaping)	C++11	22 / 100	583 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[i]=s[i]-'0';
	}
	for(i=0;i<n;i++)
	{
		for(mask=0;mask<(1<<n);mask++)
		{
			if((mask>>i)&1) dp0[mask^(1<<i)]+=dp0[mask];
			else dp1[mask^(1<<i)]+=dp1[mask];
		}
	}
	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);
				int go=((1<<n)-1)^mask^c;
				if((pc[mask]&1)==(pc[a]&1)) ans+=dp0[go];
				else ans-=dp0[go];
				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:27: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	4472 KB	Output is correct
2	Correct	7 ms	4552 KB	Output is correct
3	Correct	8 ms	4552 KB	Output is correct
4	Correct	8 ms	4552 KB	Output is correct
5	Correct	8 ms	4612 KB	Output is correct
6	Correct	8 ms	4636 KB	Output is correct
7	Correct	9 ms	4648 KB	Output is correct
8	Correct	7 ms	4788 KB	Output is correct
9	Correct	8 ms	4804 KB	Output is correct
10	Correct	8 ms	4804 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4472 KB	Output is correct
2	Correct	7 ms	4552 KB	Output is correct
3	Correct	8 ms	4552 KB	Output is correct
4	Correct	8 ms	4552 KB	Output is correct
5	Correct	8 ms	4612 KB	Output is correct
6	Correct	8 ms	4636 KB	Output is correct
7	Correct	9 ms	4648 KB	Output is correct
8	Correct	7 ms	4788 KB	Output is correct
9	Correct	8 ms	4804 KB	Output is correct
10	Correct	8 ms	4804 KB	Output is correct
11	Correct	345 ms	13724 KB	Output is correct
12	Correct	405 ms	13724 KB	Output is correct
13	Correct	358 ms	13724 KB	Output is correct
14	Correct	383 ms	13724 KB	Output is correct
15	Correct	381 ms	14000 KB	Output is correct
16	Correct	372 ms	14000 KB	Output is correct
17	Correct	420 ms	14000 KB	Output is correct
18	Correct	288 ms	14816 KB	Output is correct
19	Correct	308 ms	14816 KB	Output is correct
20	Correct	363 ms	14816 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4472 KB	Output is correct
2	Correct	7 ms	4552 KB	Output is correct
3	Correct	8 ms	4552 KB	Output is correct
4	Correct	8 ms	4552 KB	Output is correct
5	Correct	8 ms	4612 KB	Output is correct
6	Correct	8 ms	4636 KB	Output is correct
7	Correct	9 ms	4648 KB	Output is correct
8	Correct	7 ms	4788 KB	Output is correct
9	Correct	8 ms	4804 KB	Output is correct
10	Correct	8 ms	4804 KB	Output is correct
11	Correct	345 ms	13724 KB	Output is correct
12	Correct	405 ms	13724 KB	Output is correct
13	Correct	358 ms	13724 KB	Output is correct
14	Correct	383 ms	13724 KB	Output is correct
15	Correct	381 ms	14000 KB	Output is correct
16	Correct	372 ms	14000 KB	Output is correct
17	Correct	420 ms	14000 KB	Output is correct
18	Correct	288 ms	14816 KB	Output is correct
19	Correct	308 ms	14816 KB	Output is correct
20	Correct	363 ms	14816 KB	Output is correct
21	Correct	453 ms	16488 KB	Output is correct
22	Correct	456 ms	16744 KB	Output is correct
23	Correct	479 ms	16744 KB	Output is correct
24	Correct	530 ms	16744 KB	Output is correct
25	Correct	464 ms	19904 KB	Output is correct
26	Correct	494 ms	19904 KB	Output is correct
27	Correct	484 ms	19904 KB	Output is correct
28	Correct	313 ms	20920 KB	Output is correct
29	Correct	431 ms	20920 KB	Output is correct
30	Correct	454 ms	21648 KB	Output is correct
31	Correct	490 ms	21648 KB	Output is correct
32	Correct	583 ms	21648 KB	Output is correct
33	Correct	517 ms	23016 KB	Output is correct
34	Correct	485 ms	23100 KB	Output is correct
35	Correct	524 ms	23616 KB	Output is correct
36	Correct	329 ms	23616 KB	Output is correct
37	Correct	436 ms	26648 KB	Output is correct
38	Correct	419 ms	26648 KB	Output is correct
39	Correct	556 ms	26648 KB	Output is correct
40	Correct	540 ms	26648 KB	Output is correct

Subtask #4
0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4472 KB	Output is correct
2	Correct	7 ms	4552 KB	Output is correct
3	Correct	8 ms	4552 KB	Output is correct
4	Correct	8 ms	4552 KB	Output is correct
5	Correct	8 ms	4612 KB	Output is correct
6	Correct	8 ms	4636 KB	Output is correct
7	Correct	9 ms	4648 KB	Output is correct
8	Correct	7 ms	4788 KB	Output is correct
9	Correct	8 ms	4804 KB	Output is correct
10	Correct	8 ms	4804 KB	Output is correct
11	Correct	110 ms	32120 KB	Output is correct
12	Correct	99 ms	34288 KB	Output is correct
13	Correct	147 ms	36156 KB	Output is correct
14	Correct	192 ms	38420 KB	Output is correct
15	Correct	116 ms	40368 KB	Output is correct
16	Correct	182 ms	42344 KB	Output is correct
17	Correct	130 ms	44548 KB	Output is correct
18	Correct	87 ms	46728 KB	Output is correct
19	Correct	113 ms	48468 KB	Output is correct
20	Correct	106 ms	50688 KB	Output is correct
21	Correct	124 ms	52644 KB	Output is correct
22	Correct	154 ms	54660 KB	Output is correct
23	Correct	104 ms	56736 KB	Output is correct
24	Correct	178 ms	58764 KB	Output is correct
25	Correct	141 ms	60856 KB	Output is correct
26	Correct	78 ms	62792 KB	Output is correct
27	Correct	97 ms	65016 KB	Output is correct
28	Runtime error	102 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.
29	Halted	0 ms	0 KB	-

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	4472 KB	Output is correct
2	Correct	7 ms	4552 KB	Output is correct
3	Correct	8 ms	4552 KB	Output is correct
4	Correct	8 ms	4552 KB	Output is correct
5	Correct	8 ms	4612 KB	Output is correct
6	Correct	8 ms	4636 KB	Output is correct
7	Correct	9 ms	4648 KB	Output is correct
8	Correct	7 ms	4788 KB	Output is correct
9	Correct	8 ms	4804 KB	Output is correct
10	Correct	8 ms	4804 KB	Output is correct
11	Correct	345 ms	13724 KB	Output is correct
12	Correct	405 ms	13724 KB	Output is correct
13	Correct	358 ms	13724 KB	Output is correct
14	Correct	383 ms	13724 KB	Output is correct
15	Correct	381 ms	14000 KB	Output is correct
16	Correct	372 ms	14000 KB	Output is correct
17	Correct	420 ms	14000 KB	Output is correct
18	Correct	288 ms	14816 KB	Output is correct
19	Correct	308 ms	14816 KB	Output is correct
20	Correct	363 ms	14816 KB	Output is correct
21	Correct	453 ms	16488 KB	Output is correct
22	Correct	456 ms	16744 KB	Output is correct
23	Correct	479 ms	16744 KB	Output is correct
24	Correct	530 ms	16744 KB	Output is correct
25	Correct	464 ms	19904 KB	Output is correct
26	Correct	494 ms	19904 KB	Output is correct
27	Correct	484 ms	19904 KB	Output is correct
28	Correct	313 ms	20920 KB	Output is correct
29	Correct	431 ms	20920 KB	Output is correct
30	Correct	454 ms	21648 KB	Output is correct
31	Correct	490 ms	21648 KB	Output is correct
32	Correct	583 ms	21648 KB	Output is correct
33	Correct	517 ms	23016 KB	Output is correct
34	Correct	485 ms	23100 KB	Output is correct
35	Correct	524 ms	23616 KB	Output is correct
36	Correct	329 ms	23616 KB	Output is correct
37	Correct	436 ms	26648 KB	Output is correct
38	Correct	419 ms	26648 KB	Output is correct
39	Correct	556 ms	26648 KB	Output is correct
40	Correct	540 ms	26648 KB	Output is correct
41	Correct	110 ms	32120 KB	Output is correct
42	Correct	99 ms	34288 KB	Output is correct
43	Correct	147 ms	36156 KB	Output is correct
44	Correct	192 ms	38420 KB	Output is correct
45	Correct	116 ms	40368 KB	Output is correct
46	Correct	182 ms	42344 KB	Output is correct
47	Correct	130 ms	44548 KB	Output is correct
48	Correct	87 ms	46728 KB	Output is correct
49	Correct	113 ms	48468 KB	Output is correct
50	Correct	106 ms	50688 KB	Output is correct
51	Correct	124 ms	52644 KB	Output is correct
52	Correct	154 ms	54660 KB	Output is correct
53	Correct	104 ms	56736 KB	Output is correct
54	Correct	178 ms	58764 KB	Output is correct
55	Correct	141 ms	60856 KB	Output is correct
56	Correct	78 ms	62792 KB	Output is correct
57	Correct	97 ms	65016 KB	Output is correct
58	Runtime error	102 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.
59	Halted	0 ms	0 KB	-

Submission #58951

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 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
0 / 53.0

Subtask #5
0 / 25.0