Submission #68766

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
68766	2018-08-18T10:48:28 Z	tmwilliamlin168	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	1790 ms	66560 KB

snake_escaping

#include <bits/stdc++.h>
using namespace std;

#define getchar_unlocked getchar
#define putchar_unlocked putchar

inline int in() {
	int result = 0;
	char ch = getchar_unlocked();
	while(true) {
		if(ch >= '0' && ch <= '9')
			break;
		ch = getchar_unlocked();
	}
	result = ch-'0';
	while(true) {
		ch = getchar_unlocked();
		if (ch < '0' || ch > '9')
			break;
		result = result*10 + (ch - '0');
	}
	return result;
}
inline void out(int x) {
	if(!x) {
		putchar_unlocked('0');
		return;
	}
	int rev=x, c=0;
	while(!(rev%10)) {
		++c;
		rev/=10;
	}
	rev=0;
	while(x) {
		rev=rev*10+x%10;
		x/=10;
	}
	while(rev) {
		putchar_unlocked(rev%10+'0');
		rev/=10;
	}
	while(c--)
		putchar_unlocked('0');
}

const int mxL=20, mxQ=1e6;
int l, q, dp[2][1<<mxL];
char s[1<<mxL];

int main() {
	l=in(), q=in();
	for(int i=0; i<1<<l; ++i)
		while(s[i]<'0'||s[i]>'9')
			s[i]=getchar_unlocked();
	for(int j=0; j<2; ++j) {
		for(int i=0; i<1<<l; ++i)
			dp[j][i]=s[i]-'0';
		for(int k=0; k<l; ++k)
			for(int i=0; i<1<<l; ++i)
				if(i>>k&1^j)
					dp[j][i]+=dp[j][i^1<<k];
	}
	while(q--) {
		int na=0, nb=0, nc=0, ma=0, mb=0, mc=0, ans=0;
		for(int i=0; i<l; ++i) {
			char c=getchar_unlocked();
			if(c=='0') {
				++na;
				ma|=1<<(l-1-i);
			} else if(c=='1') {
				++nb;
				mb|=1<<(l-1-i);
			} else if(c=='?') {
				++nc;
				mc|=1<<(l-1-i);
			} else
				--i;
		}
		if(na<nc||nb<nc) {
			bool sw=0;
			if(nb>na) {
				swap(mb, ma);
				sw=1;
			}
			for(int i=mb; ; i=(i-1)&mb) {
				ans+=dp[sw][(sw?(1<<l)-1:0)^i^mb^mc]*(__builtin_popcount(i)&1?-1:1);
				if(!i)
					break;
			}
		} else {
			for(int i=mc; ; i=(i-1)&mc) {
				ans+=s[i|mb]-'0';
				if(!i)
					break;
			}
		}
		out(ans);
		putchar_unlocked('\n');
	}
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:61:12: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
     if(i>>k&1^j)
        ~~~~^~

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	3 ms	568 KB	Output is correct
3	Correct	4 ms	568 KB	Output is correct
4	Correct	3 ms	568 KB	Output is correct
5	Correct	3 ms	568 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	3 ms	648 KB	Output is correct
8	Correct	3 ms	648 KB	Output is correct
9	Correct	3 ms	648 KB	Output is correct
10	Correct	4 ms	656 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	3 ms	568 KB	Output is correct
3	Correct	4 ms	568 KB	Output is correct
4	Correct	3 ms	568 KB	Output is correct
5	Correct	3 ms	568 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	3 ms	648 KB	Output is correct
8	Correct	3 ms	648 KB	Output is correct
9	Correct	3 ms	648 KB	Output is correct
10	Correct	4 ms	656 KB	Output is correct
11	Correct	304 ms	6732 KB	Output is correct
12	Correct	302 ms	6732 KB	Output is correct
13	Correct	295 ms	6732 KB	Output is correct
14	Correct	298 ms	6732 KB	Output is correct
15	Correct	323 ms	7252 KB	Output is correct
16	Correct	307 ms	7252 KB	Output is correct
17	Correct	331 ms	7904 KB	Output is correct
18	Correct	251 ms	10664 KB	Output is correct
19	Correct	236 ms	10664 KB	Output is correct
20	Correct	342 ms	10664 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	3 ms	568 KB	Output is correct
3	Correct	4 ms	568 KB	Output is correct
4	Correct	3 ms	568 KB	Output is correct
5	Correct	3 ms	568 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	3 ms	648 KB	Output is correct
8	Correct	3 ms	648 KB	Output is correct
9	Correct	3 ms	648 KB	Output is correct
10	Correct	4 ms	656 KB	Output is correct
11	Correct	304 ms	6732 KB	Output is correct
12	Correct	302 ms	6732 KB	Output is correct
13	Correct	295 ms	6732 KB	Output is correct
14	Correct	298 ms	6732 KB	Output is correct
15	Correct	323 ms	7252 KB	Output is correct
16	Correct	307 ms	7252 KB	Output is correct
17	Correct	331 ms	7904 KB	Output is correct
18	Correct	251 ms	10664 KB	Output is correct
19	Correct	236 ms	10664 KB	Output is correct
20	Correct	342 ms	10664 KB	Output is correct
21	Correct	371 ms	10664 KB	Output is correct
22	Correct	394 ms	10664 KB	Output is correct
23	Correct	428 ms	10664 KB	Output is correct
24	Correct	348 ms	10664 KB	Output is correct
25	Correct	318 ms	11080 KB	Output is correct
26	Correct	343 ms	11080 KB	Output is correct
27	Correct	340 ms	11080 KB	Output is correct
28	Correct	261 ms	13068 KB	Output is correct
29	Correct	249 ms	13068 KB	Output is correct
30	Correct	304 ms	13068 KB	Output is correct
31	Correct	347 ms	13068 KB	Output is correct
32	Correct	406 ms	13068 KB	Output is correct
33	Correct	272 ms	13068 KB	Output is correct
34	Correct	354 ms	13068 KB	Output is correct
35	Correct	349 ms	13068 KB	Output is correct
36	Correct	195 ms	13068 KB	Output is correct
37	Correct	284 ms	13068 KB	Output is correct
38	Correct	265 ms	13068 KB	Output is correct
39	Correct	313 ms	13068 KB	Output is correct
40	Correct	310 ms	13068 KB	Output is correct

Subtask #4
53.0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	3 ms	568 KB	Output is correct
3	Correct	4 ms	568 KB	Output is correct
4	Correct	3 ms	568 KB	Output is correct
5	Correct	3 ms	568 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	3 ms	648 KB	Output is correct
8	Correct	3 ms	648 KB	Output is correct
9	Correct	3 ms	648 KB	Output is correct
10	Correct	4 ms	656 KB	Output is correct
11	Correct	120 ms	17980 KB	Output is correct
12	Correct	129 ms	17980 KB	Output is correct
13	Correct	149 ms	17980 KB	Output is correct
14	Correct	158 ms	18008 KB	Output is correct
15	Correct	117 ms	18008 KB	Output is correct
16	Correct	160 ms	18008 KB	Output is correct
17	Correct	143 ms	18008 KB	Output is correct
18	Correct	120 ms	18236 KB	Output is correct
19	Correct	114 ms	18236 KB	Output is correct
20	Correct	119 ms	18236 KB	Output is correct
21	Correct	138 ms	18236 KB	Output is correct
22	Correct	169 ms	18236 KB	Output is correct
23	Correct	148 ms	18236 KB	Output is correct
24	Correct	138 ms	18236 KB	Output is correct
25	Correct	168 ms	18236 KB	Output is correct
26	Correct	108 ms	18236 KB	Output is correct
27	Correct	121 ms	18236 KB	Output is correct
28	Correct	114 ms	18236 KB	Output is correct
29	Correct	124 ms	18236 KB	Output is correct
30	Correct	121 ms	18236 KB	Output is correct
31	Correct	119 ms	18236 KB	Output is correct
32	Correct	161 ms	18236 KB	Output is correct
33	Correct	148 ms	18236 KB	Output is correct
34	Correct	140 ms	18236 KB	Output is correct
35	Correct	143 ms	18312 KB	Output is correct
36	Correct	137 ms	18312 KB	Output is correct
37	Correct	145 ms	18312 KB	Output is correct
38	Correct	146 ms	18312 KB	Output is correct
39	Correct	139 ms	18312 KB	Output is correct
40	Correct	137 ms	18312 KB	Output is correct

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	3 ms	568 KB	Output is correct
3	Correct	4 ms	568 KB	Output is correct
4	Correct	3 ms	568 KB	Output is correct
5	Correct	3 ms	568 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	3 ms	648 KB	Output is correct
8	Correct	3 ms	648 KB	Output is correct
9	Correct	3 ms	648 KB	Output is correct
10	Correct	4 ms	656 KB	Output is correct
11	Correct	304 ms	6732 KB	Output is correct
12	Correct	302 ms	6732 KB	Output is correct
13	Correct	295 ms	6732 KB	Output is correct
14	Correct	298 ms	6732 KB	Output is correct
15	Correct	323 ms	7252 KB	Output is correct
16	Correct	307 ms	7252 KB	Output is correct
17	Correct	331 ms	7904 KB	Output is correct
18	Correct	251 ms	10664 KB	Output is correct
19	Correct	236 ms	10664 KB	Output is correct
20	Correct	342 ms	10664 KB	Output is correct
21	Correct	371 ms	10664 KB	Output is correct
22	Correct	394 ms	10664 KB	Output is correct
23	Correct	428 ms	10664 KB	Output is correct
24	Correct	348 ms	10664 KB	Output is correct
25	Correct	318 ms	11080 KB	Output is correct
26	Correct	343 ms	11080 KB	Output is correct
27	Correct	340 ms	11080 KB	Output is correct
28	Correct	261 ms	13068 KB	Output is correct
29	Correct	249 ms	13068 KB	Output is correct
30	Correct	304 ms	13068 KB	Output is correct
31	Correct	347 ms	13068 KB	Output is correct
32	Correct	406 ms	13068 KB	Output is correct
33	Correct	272 ms	13068 KB	Output is correct
34	Correct	354 ms	13068 KB	Output is correct
35	Correct	349 ms	13068 KB	Output is correct
36	Correct	195 ms	13068 KB	Output is correct
37	Correct	284 ms	13068 KB	Output is correct
38	Correct	265 ms	13068 KB	Output is correct
39	Correct	313 ms	13068 KB	Output is correct
40	Correct	310 ms	13068 KB	Output is correct
41	Correct	120 ms	17980 KB	Output is correct
42	Correct	129 ms	17980 KB	Output is correct
43	Correct	149 ms	17980 KB	Output is correct
44	Correct	158 ms	18008 KB	Output is correct
45	Correct	117 ms	18008 KB	Output is correct
46	Correct	160 ms	18008 KB	Output is correct
47	Correct	143 ms	18008 KB	Output is correct
48	Correct	120 ms	18236 KB	Output is correct
49	Correct	114 ms	18236 KB	Output is correct
50	Correct	119 ms	18236 KB	Output is correct
51	Correct	138 ms	18236 KB	Output is correct
52	Correct	169 ms	18236 KB	Output is correct
53	Correct	148 ms	18236 KB	Output is correct
54	Correct	138 ms	18236 KB	Output is correct
55	Correct	168 ms	18236 KB	Output is correct
56	Correct	108 ms	18236 KB	Output is correct
57	Correct	121 ms	18236 KB	Output is correct
58	Correct	114 ms	18236 KB	Output is correct
59	Correct	124 ms	18236 KB	Output is correct
60	Correct	121 ms	18236 KB	Output is correct
61	Correct	119 ms	18236 KB	Output is correct
62	Correct	161 ms	18236 KB	Output is correct
63	Correct	148 ms	18236 KB	Output is correct
64	Correct	140 ms	18236 KB	Output is correct
65	Correct	143 ms	18312 KB	Output is correct
66	Correct	137 ms	18312 KB	Output is correct
67	Correct	145 ms	18312 KB	Output is correct
68	Correct	146 ms	18312 KB	Output is correct
69	Correct	139 ms	18312 KB	Output is correct
70	Correct	137 ms	18312 KB	Output is correct
71	Correct	690 ms	22996 KB	Output is correct
72	Correct	630 ms	24576 KB	Output is correct
73	Correct	720 ms	24576 KB	Output is correct
74	Correct	1790 ms	24576 KB	Output is correct
75	Correct	822 ms	25432 KB	Output is correct
76	Correct	1455 ms	25432 KB	Output is correct
77	Correct	1143 ms	25432 KB	Output is correct
78	Correct	454 ms	27544 KB	Output is correct
79	Correct	591 ms	27544 KB	Output is correct
80	Correct	642 ms	27544 KB	Output is correct
81	Correct	996 ms	27544 KB	Output is correct
82	Correct	1551 ms	27544 KB	Output is correct
83	Correct	611 ms	27544 KB	Output is correct
84	Correct	1144 ms	27544 KB	Output is correct
85	Correct	1252 ms	27544 KB	Output is correct
86	Correct	420 ms	27544 KB	Output is correct
87	Correct	674 ms	27544 KB	Output is correct
88	Correct	536 ms	27544 KB	Output is correct
89	Correct	708 ms	27544 KB	Output is correct
90	Correct	697 ms	27800 KB	Output is correct
91	Correct	585 ms	27800 KB	Output is correct
92	Correct	1298 ms	28052 KB	Output is correct
93	Correct	1083 ms	28052 KB	Output is correct
94	Correct	341 ms	47256 KB	Output is correct
95	Runtime error	1054 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.
96	Halted	0 ms	0 KB	-

Submission #68766

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