Submission #68767

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
68767	2018-08-18T10:50:57 Z	tmwilliamlin168	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	1866 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	3 ms	368 KB	Output is correct
2	Correct	3 ms	368 KB	Output is correct
3	Correct	2 ms	456 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	3 ms	480 KB	Output is correct
6	Correct	3 ms	492 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	3 ms	648 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	368 KB	Output is correct
2	Correct	3 ms	368 KB	Output is correct
3	Correct	2 ms	456 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	3 ms	480 KB	Output is correct
6	Correct	3 ms	492 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	3 ms	648 KB	Output is correct
11	Correct	276 ms	5916 KB	Output is correct
12	Correct	266 ms	5916 KB	Output is correct
13	Correct	281 ms	5916 KB	Output is correct
14	Correct	284 ms	5916 KB	Output is correct
15	Correct	251 ms	6220 KB	Output is correct
16	Correct	285 ms	6220 KB	Output is correct
17	Correct	314 ms	6220 KB	Output is correct
18	Correct	270 ms	8460 KB	Output is correct
19	Correct	220 ms	8460 KB	Output is correct
20	Correct	352 ms	8460 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	368 KB	Output is correct
2	Correct	3 ms	368 KB	Output is correct
3	Correct	2 ms	456 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	3 ms	480 KB	Output is correct
6	Correct	3 ms	492 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	3 ms	648 KB	Output is correct
11	Correct	276 ms	5916 KB	Output is correct
12	Correct	266 ms	5916 KB	Output is correct
13	Correct	281 ms	5916 KB	Output is correct
14	Correct	284 ms	5916 KB	Output is correct
15	Correct	251 ms	6220 KB	Output is correct
16	Correct	285 ms	6220 KB	Output is correct
17	Correct	314 ms	6220 KB	Output is correct
18	Correct	270 ms	8460 KB	Output is correct
19	Correct	220 ms	8460 KB	Output is correct
20	Correct	352 ms	8460 KB	Output is correct
21	Correct	369 ms	8460 KB	Output is correct
22	Correct	403 ms	8460 KB	Output is correct
23	Correct	348 ms	8460 KB	Output is correct
24	Correct	337 ms	8460 KB	Output is correct
25	Correct	357 ms	8476 KB	Output is correct
26	Correct	357 ms	8476 KB	Output is correct
27	Correct	375 ms	8476 KB	Output is correct
28	Correct	309 ms	11636 KB	Output is correct
29	Correct	270 ms	11636 KB	Output is correct
30	Correct	347 ms	11636 KB	Output is correct
31	Correct	384 ms	11636 KB	Output is correct
32	Correct	463 ms	11636 KB	Output is correct
33	Correct	306 ms	11636 KB	Output is correct
34	Correct	445 ms	11636 KB	Output is correct
35	Correct	448 ms	11636 KB	Output is correct
36	Correct	212 ms	11636 KB	Output is correct
37	Correct	318 ms	11636 KB	Output is correct
38	Correct	255 ms	11636 KB	Output is correct
39	Correct	307 ms	11636 KB	Output is correct
40	Correct	301 ms	11636 KB	Output is correct

Subtask #4
53.0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	368 KB	Output is correct
2	Correct	3 ms	368 KB	Output is correct
3	Correct	2 ms	456 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	3 ms	480 KB	Output is correct
6	Correct	3 ms	492 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	3 ms	648 KB	Output is correct
11	Correct	133 ms	16496 KB	Output is correct
12	Correct	125 ms	16500 KB	Output is correct
13	Correct	116 ms	16500 KB	Output is correct
14	Correct	167 ms	16500 KB	Output is correct
15	Correct	178 ms	16500 KB	Output is correct
16	Correct	151 ms	16500 KB	Output is correct
17	Correct	135 ms	16500 KB	Output is correct
18	Correct	110 ms	16628 KB	Output is correct
19	Correct	108 ms	16628 KB	Output is correct
20	Correct	129 ms	16628 KB	Output is correct
21	Correct	172 ms	16628 KB	Output is correct
22	Correct	231 ms	16628 KB	Output is correct
23	Correct	131 ms	16628 KB	Output is correct
24	Correct	176 ms	16628 KB	Output is correct
25	Correct	167 ms	16628 KB	Output is correct
26	Correct	138 ms	16628 KB	Output is correct
27	Correct	127 ms	16628 KB	Output is correct
28	Correct	139 ms	16628 KB	Output is correct
29	Correct	119 ms	16628 KB	Output is correct
30	Correct	133 ms	16628 KB	Output is correct
31	Correct	126 ms	16628 KB	Output is correct
32	Correct	152 ms	16628 KB	Output is correct
33	Correct	145 ms	16628 KB	Output is correct
34	Correct	102 ms	16628 KB	Output is correct
35	Correct	139 ms	16628 KB	Output is correct
36	Correct	151 ms	16628 KB	Output is correct
37	Correct	168 ms	16628 KB	Output is correct
38	Correct	133 ms	16628 KB	Output is correct
39	Correct	141 ms	16628 KB	Output is correct
40	Correct	145 ms	16628 KB	Output is correct

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	368 KB	Output is correct
2	Correct	3 ms	368 KB	Output is correct
3	Correct	2 ms	456 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	3 ms	480 KB	Output is correct
6	Correct	3 ms	492 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	3 ms	648 KB	Output is correct
11	Correct	276 ms	5916 KB	Output is correct
12	Correct	266 ms	5916 KB	Output is correct
13	Correct	281 ms	5916 KB	Output is correct
14	Correct	284 ms	5916 KB	Output is correct
15	Correct	251 ms	6220 KB	Output is correct
16	Correct	285 ms	6220 KB	Output is correct
17	Correct	314 ms	6220 KB	Output is correct
18	Correct	270 ms	8460 KB	Output is correct
19	Correct	220 ms	8460 KB	Output is correct
20	Correct	352 ms	8460 KB	Output is correct
21	Correct	369 ms	8460 KB	Output is correct
22	Correct	403 ms	8460 KB	Output is correct
23	Correct	348 ms	8460 KB	Output is correct
24	Correct	337 ms	8460 KB	Output is correct
25	Correct	357 ms	8476 KB	Output is correct
26	Correct	357 ms	8476 KB	Output is correct
27	Correct	375 ms	8476 KB	Output is correct
28	Correct	309 ms	11636 KB	Output is correct
29	Correct	270 ms	11636 KB	Output is correct
30	Correct	347 ms	11636 KB	Output is correct
31	Correct	384 ms	11636 KB	Output is correct
32	Correct	463 ms	11636 KB	Output is correct
33	Correct	306 ms	11636 KB	Output is correct
34	Correct	445 ms	11636 KB	Output is correct
35	Correct	448 ms	11636 KB	Output is correct
36	Correct	212 ms	11636 KB	Output is correct
37	Correct	318 ms	11636 KB	Output is correct
38	Correct	255 ms	11636 KB	Output is correct
39	Correct	307 ms	11636 KB	Output is correct
40	Correct	301 ms	11636 KB	Output is correct
41	Correct	133 ms	16496 KB	Output is correct
42	Correct	125 ms	16500 KB	Output is correct
43	Correct	116 ms	16500 KB	Output is correct
44	Correct	167 ms	16500 KB	Output is correct
45	Correct	178 ms	16500 KB	Output is correct
46	Correct	151 ms	16500 KB	Output is correct
47	Correct	135 ms	16500 KB	Output is correct
48	Correct	110 ms	16628 KB	Output is correct
49	Correct	108 ms	16628 KB	Output is correct
50	Correct	129 ms	16628 KB	Output is correct
51	Correct	172 ms	16628 KB	Output is correct
52	Correct	231 ms	16628 KB	Output is correct
53	Correct	131 ms	16628 KB	Output is correct
54	Correct	176 ms	16628 KB	Output is correct
55	Correct	167 ms	16628 KB	Output is correct
56	Correct	138 ms	16628 KB	Output is correct
57	Correct	127 ms	16628 KB	Output is correct
58	Correct	139 ms	16628 KB	Output is correct
59	Correct	119 ms	16628 KB	Output is correct
60	Correct	133 ms	16628 KB	Output is correct
61	Correct	126 ms	16628 KB	Output is correct
62	Correct	152 ms	16628 KB	Output is correct
63	Correct	145 ms	16628 KB	Output is correct
64	Correct	102 ms	16628 KB	Output is correct
65	Correct	139 ms	16628 KB	Output is correct
66	Correct	151 ms	16628 KB	Output is correct
67	Correct	168 ms	16628 KB	Output is correct
68	Correct	133 ms	16628 KB	Output is correct
69	Correct	141 ms	16628 KB	Output is correct
70	Correct	145 ms	16628 KB	Output is correct
71	Correct	701 ms	21216 KB	Output is correct
72	Correct	655 ms	22516 KB	Output is correct
73	Correct	753 ms	22516 KB	Output is correct
74	Correct	1866 ms	22516 KB	Output is correct
75	Correct	823 ms	23428 KB	Output is correct
76	Correct	1619 ms	23428 KB	Output is correct
77	Correct	1428 ms	23428 KB	Output is correct
78	Correct	515 ms	25248 KB	Output is correct
79	Correct	495 ms	25248 KB	Output is correct
80	Correct	672 ms	25248 KB	Output is correct
81	Correct	939 ms	25248 KB	Output is correct
82	Correct	1305 ms	25248 KB	Output is correct
83	Correct	665 ms	25248 KB	Output is correct
84	Correct	1088 ms	25248 KB	Output is correct
85	Correct	1186 ms	25248 KB	Output is correct
86	Correct	412 ms	25248 KB	Output is correct
87	Correct	720 ms	25248 KB	Output is correct
88	Correct	526 ms	25248 KB	Output is correct
89	Correct	724 ms	25248 KB	Output is correct
90	Correct	665 ms	25248 KB	Output is correct
91	Correct	672 ms	25248 KB	Output is correct
92	Correct	1384 ms	25248 KB	Output is correct
93	Correct	1199 ms	25248 KB	Output is correct
94	Correct	369 ms	44344 KB	Output is correct
95	Correct	952 ms	46368 KB	Output is correct
96	Runtime error	1012 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.
97	Halted	0 ms	0 KB	-

Submission #68767

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