Submission #58961

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
58961	2018-07-19T21:35:53 Z	TadijaSebez	Snake Escaping (JOI18_snake_escaping)	C++11	75 / 100	1624 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	4596 KB	Output is correct
3	Correct	7 ms	4644 KB	Output is correct
4	Correct	7 ms	4644 KB	Output is correct
5	Correct	7 ms	4644 KB	Output is correct
6	Correct	8 ms	4664 KB	Output is correct
7	Correct	8 ms	4664 KB	Output is correct
8	Correct	8 ms	4664 KB	Output is correct
9	Correct	8 ms	4696 KB	Output is correct
10	Correct	10 ms	4708 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	4596 KB	Output is correct
3	Correct	7 ms	4644 KB	Output is correct
4	Correct	7 ms	4644 KB	Output is correct
5	Correct	7 ms	4644 KB	Output is correct
6	Correct	8 ms	4664 KB	Output is correct
7	Correct	8 ms	4664 KB	Output is correct
8	Correct	8 ms	4664 KB	Output is correct
9	Correct	8 ms	4696 KB	Output is correct
10	Correct	10 ms	4708 KB	Output is correct
11	Correct	386 ms	9776 KB	Output is correct
12	Correct	322 ms	9948 KB	Output is correct
13	Correct	349 ms	9948 KB	Output is correct
14	Correct	380 ms	9948 KB	Output is correct
15	Correct	375 ms	10276 KB	Output is correct
16	Correct	407 ms	10276 KB	Output is correct
17	Correct	351 ms	10276 KB	Output is correct
18	Correct	233 ms	11216 KB	Output is correct
19	Correct	270 ms	11216 KB	Output is correct
20	Correct	398 ms	11216 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	4596 KB	Output is correct
3	Correct	7 ms	4644 KB	Output is correct
4	Correct	7 ms	4644 KB	Output is correct
5	Correct	7 ms	4644 KB	Output is correct
6	Correct	8 ms	4664 KB	Output is correct
7	Correct	8 ms	4664 KB	Output is correct
8	Correct	8 ms	4664 KB	Output is correct
9	Correct	8 ms	4696 KB	Output is correct
10	Correct	10 ms	4708 KB	Output is correct
11	Correct	386 ms	9776 KB	Output is correct
12	Correct	322 ms	9948 KB	Output is correct
13	Correct	349 ms	9948 KB	Output is correct
14	Correct	380 ms	9948 KB	Output is correct
15	Correct	375 ms	10276 KB	Output is correct
16	Correct	407 ms	10276 KB	Output is correct
17	Correct	351 ms	10276 KB	Output is correct
18	Correct	233 ms	11216 KB	Output is correct
19	Correct	270 ms	11216 KB	Output is correct
20	Correct	398 ms	11216 KB	Output is correct
21	Correct	372 ms	11216 KB	Output is correct
22	Correct	394 ms	11216 KB	Output is correct
23	Correct	616 ms	11216 KB	Output is correct
24	Correct	468 ms	11216 KB	Output is correct
25	Correct	362 ms	12216 KB	Output is correct
26	Correct	447 ms	12216 KB	Output is correct
27	Correct	529 ms	12216 KB	Output is correct
28	Correct	311 ms	13244 KB	Output is correct
29	Correct	417 ms	13244 KB	Output is correct
30	Correct	398 ms	13244 KB	Output is correct
31	Correct	472 ms	13244 KB	Output is correct
32	Correct	423 ms	13244 KB	Output is correct
33	Correct	384 ms	13244 KB	Output is correct
34	Correct	512 ms	13244 KB	Output is correct
35	Correct	418 ms	13244 KB	Output is correct
36	Correct	269 ms	13244 KB	Output is correct
37	Correct	433 ms	13244 KB	Output is correct
38	Correct	369 ms	13244 KB	Output is correct
39	Correct	378 ms	13244 KB	Output is correct
40	Correct	446 ms	13244 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	4596 KB	Output is correct
3	Correct	7 ms	4644 KB	Output is correct
4	Correct	7 ms	4644 KB	Output is correct
5	Correct	7 ms	4644 KB	Output is correct
6	Correct	8 ms	4664 KB	Output is correct
7	Correct	8 ms	4664 KB	Output is correct
8	Correct	8 ms	4664 KB	Output is correct
9	Correct	8 ms	4696 KB	Output is correct
10	Correct	10 ms	4708 KB	Output is correct
11	Correct	118 ms	17648 KB	Output is correct
12	Correct	88 ms	17648 KB	Output is correct
13	Correct	102 ms	17648 KB	Output is correct
14	Correct	156 ms	17648 KB	Output is correct
15	Correct	103 ms	17752 KB	Output is correct
16	Correct	131 ms	17756 KB	Output is correct
17	Correct	117 ms	17756 KB	Output is correct
18	Correct	72 ms	17884 KB	Output is correct
19	Correct	91 ms	17884 KB	Output is correct
20	Correct	89 ms	17884 KB	Output is correct
21	Correct	137 ms	17884 KB	Output is correct
22	Correct	112 ms	17884 KB	Output is correct
23	Correct	93 ms	17884 KB	Output is correct
24	Correct	104 ms	17884 KB	Output is correct
25	Correct	135 ms	17884 KB	Output is correct
26	Correct	84 ms	17884 KB	Output is correct
27	Correct	88 ms	17884 KB	Output is correct
28	Correct	89 ms	17884 KB	Output is correct
29	Correct	160 ms	17884 KB	Output is correct
30	Correct	135 ms	17884 KB	Output is correct
31	Correct	91 ms	17884 KB	Output is correct
32	Correct	115 ms	17916 KB	Output is correct
33	Correct	107 ms	17944 KB	Output is correct
34	Correct	69 ms	17944 KB	Output is correct
35	Correct	94 ms	17944 KB	Output is correct
36	Correct	107 ms	17944 KB	Output is correct
37	Correct	104 ms	17944 KB	Output is correct
38	Correct	123 ms	17944 KB	Output is correct
39	Correct	125 ms	17944 KB	Output is correct
40	Correct	101 ms	17944 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	4596 KB	Output is correct
3	Correct	7 ms	4644 KB	Output is correct
4	Correct	7 ms	4644 KB	Output is correct
5	Correct	7 ms	4644 KB	Output is correct
6	Correct	8 ms	4664 KB	Output is correct
7	Correct	8 ms	4664 KB	Output is correct
8	Correct	8 ms	4664 KB	Output is correct
9	Correct	8 ms	4696 KB	Output is correct
10	Correct	10 ms	4708 KB	Output is correct
11	Correct	386 ms	9776 KB	Output is correct
12	Correct	322 ms	9948 KB	Output is correct
13	Correct	349 ms	9948 KB	Output is correct
14	Correct	380 ms	9948 KB	Output is correct
15	Correct	375 ms	10276 KB	Output is correct
16	Correct	407 ms	10276 KB	Output is correct
17	Correct	351 ms	10276 KB	Output is correct
18	Correct	233 ms	11216 KB	Output is correct
19	Correct	270 ms	11216 KB	Output is correct
20	Correct	398 ms	11216 KB	Output is correct
21	Correct	372 ms	11216 KB	Output is correct
22	Correct	394 ms	11216 KB	Output is correct
23	Correct	616 ms	11216 KB	Output is correct
24	Correct	468 ms	11216 KB	Output is correct
25	Correct	362 ms	12216 KB	Output is correct
26	Correct	447 ms	12216 KB	Output is correct
27	Correct	529 ms	12216 KB	Output is correct
28	Correct	311 ms	13244 KB	Output is correct
29	Correct	417 ms	13244 KB	Output is correct
30	Correct	398 ms	13244 KB	Output is correct
31	Correct	472 ms	13244 KB	Output is correct
32	Correct	423 ms	13244 KB	Output is correct
33	Correct	384 ms	13244 KB	Output is correct
34	Correct	512 ms	13244 KB	Output is correct
35	Correct	418 ms	13244 KB	Output is correct
36	Correct	269 ms	13244 KB	Output is correct
37	Correct	433 ms	13244 KB	Output is correct
38	Correct	369 ms	13244 KB	Output is correct
39	Correct	378 ms	13244 KB	Output is correct
40	Correct	446 ms	13244 KB	Output is correct
41	Correct	118 ms	17648 KB	Output is correct
42	Correct	88 ms	17648 KB	Output is correct
43	Correct	102 ms	17648 KB	Output is correct
44	Correct	156 ms	17648 KB	Output is correct
45	Correct	103 ms	17752 KB	Output is correct
46	Correct	131 ms	17756 KB	Output is correct
47	Correct	117 ms	17756 KB	Output is correct
48	Correct	72 ms	17884 KB	Output is correct
49	Correct	91 ms	17884 KB	Output is correct
50	Correct	89 ms	17884 KB	Output is correct
51	Correct	137 ms	17884 KB	Output is correct
52	Correct	112 ms	17884 KB	Output is correct
53	Correct	93 ms	17884 KB	Output is correct
54	Correct	104 ms	17884 KB	Output is correct
55	Correct	135 ms	17884 KB	Output is correct
56	Correct	84 ms	17884 KB	Output is correct
57	Correct	88 ms	17884 KB	Output is correct
58	Correct	89 ms	17884 KB	Output is correct
59	Correct	160 ms	17884 KB	Output is correct
60	Correct	135 ms	17884 KB	Output is correct
61	Correct	91 ms	17884 KB	Output is correct
62	Correct	115 ms	17916 KB	Output is correct
63	Correct	107 ms	17944 KB	Output is correct
64	Correct	69 ms	17944 KB	Output is correct
65	Correct	94 ms	17944 KB	Output is correct
66	Correct	107 ms	17944 KB	Output is correct
67	Correct	104 ms	17944 KB	Output is correct
68	Correct	123 ms	17944 KB	Output is correct
69	Correct	125 ms	17944 KB	Output is correct
70	Correct	101 ms	17944 KB	Output is correct
71	Correct	686 ms	22664 KB	Output is correct
72	Correct	678 ms	23548 KB	Output is correct
73	Correct	1010 ms	23548 KB	Output is correct
74	Correct	1624 ms	23548 KB	Output is correct
75	Correct	698 ms	25424 KB	Output is correct
76	Correct	1165 ms	25424 KB	Output is correct
77	Correct	1093 ms	25424 KB	Output is correct
78	Correct	414 ms	27464 KB	Output is correct
79	Correct	649 ms	27464 KB	Output is correct
80	Correct	705 ms	27464 KB	Output is correct
81	Correct	962 ms	46168 KB	Output is correct
82	Runtime error	1483 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.
83	Halted	0 ms	0 KB	-

Submission #58961

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