Submission #68764

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
68764	2018-08-18T10:45:30 Z	tmwilliamlin168	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	1774 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	376 KB	Output is correct
2	Correct	3 ms	448 KB	Output is correct
3	Correct	3 ms	448 KB	Output is correct
4	Correct	4 ms	488 KB	Output is correct
5	Correct	3 ms	488 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	4 ms	636 KB	Output is correct
8	Correct	4 ms	636 KB	Output is correct
9	Correct	3 ms	636 KB	Output is correct
10	Correct	3 ms	704 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	448 KB	Output is correct
3	Correct	3 ms	448 KB	Output is correct
4	Correct	4 ms	488 KB	Output is correct
5	Correct	3 ms	488 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	4 ms	636 KB	Output is correct
8	Correct	4 ms	636 KB	Output is correct
9	Correct	3 ms	636 KB	Output is correct
10	Correct	3 ms	704 KB	Output is correct
11	Correct	252 ms	5900 KB	Output is correct
12	Correct	251 ms	5900 KB	Output is correct
13	Correct	295 ms	5900 KB	Output is correct
14	Correct	253 ms	5900 KB	Output is correct
15	Correct	244 ms	6156 KB	Output is correct
16	Correct	272 ms	6156 KB	Output is correct
17	Correct	283 ms	6156 KB	Output is correct
18	Correct	195 ms	8864 KB	Output is correct
19	Correct	194 ms	8864 KB	Output is correct
20	Correct	250 ms	8864 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	448 KB	Output is correct
3	Correct	3 ms	448 KB	Output is correct
4	Correct	4 ms	488 KB	Output is correct
5	Correct	3 ms	488 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	4 ms	636 KB	Output is correct
8	Correct	4 ms	636 KB	Output is correct
9	Correct	3 ms	636 KB	Output is correct
10	Correct	3 ms	704 KB	Output is correct
11	Correct	252 ms	5900 KB	Output is correct
12	Correct	251 ms	5900 KB	Output is correct
13	Correct	295 ms	5900 KB	Output is correct
14	Correct	253 ms	5900 KB	Output is correct
15	Correct	244 ms	6156 KB	Output is correct
16	Correct	272 ms	6156 KB	Output is correct
17	Correct	283 ms	6156 KB	Output is correct
18	Correct	195 ms	8864 KB	Output is correct
19	Correct	194 ms	8864 KB	Output is correct
20	Correct	250 ms	8864 KB	Output is correct
21	Correct	337 ms	8864 KB	Output is correct
22	Correct	311 ms	8864 KB	Output is correct
23	Correct	324 ms	8864 KB	Output is correct
24	Correct	324 ms	8864 KB	Output is correct
25	Correct	339 ms	9040 KB	Output is correct
26	Correct	347 ms	9040 KB	Output is correct
27	Correct	382 ms	9040 KB	Output is correct
28	Correct	264 ms	10952 KB	Output is correct
29	Correct	263 ms	10952 KB	Output is correct
30	Correct	336 ms	10952 KB	Output is correct
31	Correct	350 ms	10952 KB	Output is correct
32	Correct	475 ms	10952 KB	Output is correct
33	Correct	327 ms	10952 KB	Output is correct
34	Correct	356 ms	10952 KB	Output is correct
35	Correct	352 ms	10952 KB	Output is correct
36	Correct	221 ms	10952 KB	Output is correct
37	Correct	347 ms	10952 KB	Output is correct
38	Correct	247 ms	10952 KB	Output is correct
39	Correct	344 ms	10952 KB	Output is correct
40	Correct	372 ms	10952 KB	Output is correct

Subtask #4
53.0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	448 KB	Output is correct
3	Correct	3 ms	448 KB	Output is correct
4	Correct	4 ms	488 KB	Output is correct
5	Correct	3 ms	488 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	4 ms	636 KB	Output is correct
8	Correct	4 ms	636 KB	Output is correct
9	Correct	3 ms	636 KB	Output is correct
10	Correct	3 ms	704 KB	Output is correct
11	Correct	120 ms	15112 KB	Output is correct
12	Correct	121 ms	15240 KB	Output is correct
13	Correct	127 ms	15240 KB	Output is correct
14	Correct	189 ms	15240 KB	Output is correct
15	Correct	138 ms	15240 KB	Output is correct
16	Correct	170 ms	15240 KB	Output is correct
17	Correct	156 ms	15240 KB	Output is correct
18	Correct	118 ms	15492 KB	Output is correct
19	Correct	122 ms	15492 KB	Output is correct
20	Correct	131 ms	15492 KB	Output is correct
21	Correct	201 ms	15492 KB	Output is correct
22	Correct	147 ms	15492 KB	Output is correct
23	Correct	120 ms	15492 KB	Output is correct
24	Correct	152 ms	15492 KB	Output is correct
25	Correct	152 ms	15492 KB	Output is correct
26	Correct	114 ms	15492 KB	Output is correct
27	Correct	137 ms	15492 KB	Output is correct
28	Correct	111 ms	15492 KB	Output is correct
29	Correct	118 ms	15492 KB	Output is correct
30	Correct	130 ms	15492 KB	Output is correct
31	Correct	128 ms	15492 KB	Output is correct
32	Correct	160 ms	15492 KB	Output is correct
33	Correct	144 ms	15492 KB	Output is correct
34	Correct	103 ms	15492 KB	Output is correct
35	Correct	137 ms	15492 KB	Output is correct
36	Correct	148 ms	15492 KB	Output is correct
37	Correct	123 ms	15492 KB	Output is correct
38	Correct	159 ms	15492 KB	Output is correct
39	Correct	162 ms	15492 KB	Output is correct
40	Correct	151 ms	15492 KB	Output is correct

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	448 KB	Output is correct
3	Correct	3 ms	448 KB	Output is correct
4	Correct	4 ms	488 KB	Output is correct
5	Correct	3 ms	488 KB	Output is correct
6	Correct	3 ms	636 KB	Output is correct
7	Correct	4 ms	636 KB	Output is correct
8	Correct	4 ms	636 KB	Output is correct
9	Correct	3 ms	636 KB	Output is correct
10	Correct	3 ms	704 KB	Output is correct
11	Correct	252 ms	5900 KB	Output is correct
12	Correct	251 ms	5900 KB	Output is correct
13	Correct	295 ms	5900 KB	Output is correct
14	Correct	253 ms	5900 KB	Output is correct
15	Correct	244 ms	6156 KB	Output is correct
16	Correct	272 ms	6156 KB	Output is correct
17	Correct	283 ms	6156 KB	Output is correct
18	Correct	195 ms	8864 KB	Output is correct
19	Correct	194 ms	8864 KB	Output is correct
20	Correct	250 ms	8864 KB	Output is correct
21	Correct	337 ms	8864 KB	Output is correct
22	Correct	311 ms	8864 KB	Output is correct
23	Correct	324 ms	8864 KB	Output is correct
24	Correct	324 ms	8864 KB	Output is correct
25	Correct	339 ms	9040 KB	Output is correct
26	Correct	347 ms	9040 KB	Output is correct
27	Correct	382 ms	9040 KB	Output is correct
28	Correct	264 ms	10952 KB	Output is correct
29	Correct	263 ms	10952 KB	Output is correct
30	Correct	336 ms	10952 KB	Output is correct
31	Correct	350 ms	10952 KB	Output is correct
32	Correct	475 ms	10952 KB	Output is correct
33	Correct	327 ms	10952 KB	Output is correct
34	Correct	356 ms	10952 KB	Output is correct
35	Correct	352 ms	10952 KB	Output is correct
36	Correct	221 ms	10952 KB	Output is correct
37	Correct	347 ms	10952 KB	Output is correct
38	Correct	247 ms	10952 KB	Output is correct
39	Correct	344 ms	10952 KB	Output is correct
40	Correct	372 ms	10952 KB	Output is correct
41	Correct	120 ms	15112 KB	Output is correct
42	Correct	121 ms	15240 KB	Output is correct
43	Correct	127 ms	15240 KB	Output is correct
44	Correct	189 ms	15240 KB	Output is correct
45	Correct	138 ms	15240 KB	Output is correct
46	Correct	170 ms	15240 KB	Output is correct
47	Correct	156 ms	15240 KB	Output is correct
48	Correct	118 ms	15492 KB	Output is correct
49	Correct	122 ms	15492 KB	Output is correct
50	Correct	131 ms	15492 KB	Output is correct
51	Correct	201 ms	15492 KB	Output is correct
52	Correct	147 ms	15492 KB	Output is correct
53	Correct	120 ms	15492 KB	Output is correct
54	Correct	152 ms	15492 KB	Output is correct
55	Correct	152 ms	15492 KB	Output is correct
56	Correct	114 ms	15492 KB	Output is correct
57	Correct	137 ms	15492 KB	Output is correct
58	Correct	111 ms	15492 KB	Output is correct
59	Correct	118 ms	15492 KB	Output is correct
60	Correct	130 ms	15492 KB	Output is correct
61	Correct	128 ms	15492 KB	Output is correct
62	Correct	160 ms	15492 KB	Output is correct
63	Correct	144 ms	15492 KB	Output is correct
64	Correct	103 ms	15492 KB	Output is correct
65	Correct	137 ms	15492 KB	Output is correct
66	Correct	148 ms	15492 KB	Output is correct
67	Correct	123 ms	15492 KB	Output is correct
68	Correct	159 ms	15492 KB	Output is correct
69	Correct	162 ms	15492 KB	Output is correct
70	Correct	151 ms	15492 KB	Output is correct
71	Correct	700 ms	20072 KB	Output is correct
72	Correct	695 ms	21096 KB	Output is correct
73	Correct	771 ms	21096 KB	Output is correct
74	Correct	1774 ms	21096 KB	Output is correct
75	Correct	659 ms	21776 KB	Output is correct
76	Correct	1422 ms	21776 KB	Output is correct
77	Correct	1122 ms	21776 KB	Output is correct
78	Correct	485 ms	23900 KB	Output is correct
79	Correct	490 ms	23900 KB	Output is correct
80	Correct	764 ms	23900 KB	Output is correct
81	Correct	1100 ms	23900 KB	Output is correct
82	Correct	1730 ms	23900 KB	Output is correct
83	Correct	592 ms	23900 KB	Output is correct
84	Correct	1036 ms	23900 KB	Output is correct
85	Correct	1254 ms	23900 KB	Output is correct
86	Correct	397 ms	23900 KB	Output is correct
87	Correct	618 ms	23900 KB	Output is correct
88	Correct	567 ms	41124 KB	Output is correct
89	Correct	739 ms	42640 KB	Output is correct
90	Correct	774 ms	64624 KB	Output is correct
91	Runtime error	661 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.
92	Halted	0 ms	0 KB	-

Submission #68764

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