Submission #68765

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
68765	2018-08-18T10:46:38 Z	tmwilliamlin168	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	1674 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	2 ms	380 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	660 KB	Output is correct
5	Correct	2 ms	660 KB	Output is correct
6	Correct	2 ms	660 KB	Output is correct
7	Correct	3 ms	752 KB	Output is correct
8	Correct	2 ms	752 KB	Output is correct
9	Correct	3 ms	820 KB	Output is correct
10	Correct	2 ms	820 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	660 KB	Output is correct
5	Correct	2 ms	660 KB	Output is correct
6	Correct	2 ms	660 KB	Output is correct
7	Correct	3 ms	752 KB	Output is correct
8	Correct	2 ms	752 KB	Output is correct
9	Correct	3 ms	820 KB	Output is correct
10	Correct	2 ms	820 KB	Output is correct
11	Correct	232 ms	6628 KB	Output is correct
12	Correct	237 ms	6680 KB	Output is correct
13	Correct	251 ms	6680 KB	Output is correct
14	Correct	244 ms	6680 KB	Output is correct
15	Correct	251 ms	7320 KB	Output is correct
16	Correct	267 ms	7320 KB	Output is correct
17	Correct	278 ms	7764 KB	Output is correct
18	Correct	275 ms	10568 KB	Output is correct
19	Correct	204 ms	10568 KB	Output is correct
20	Correct	292 ms	10568 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	660 KB	Output is correct
5	Correct	2 ms	660 KB	Output is correct
6	Correct	2 ms	660 KB	Output is correct
7	Correct	3 ms	752 KB	Output is correct
8	Correct	2 ms	752 KB	Output is correct
9	Correct	3 ms	820 KB	Output is correct
10	Correct	2 ms	820 KB	Output is correct
11	Correct	232 ms	6628 KB	Output is correct
12	Correct	237 ms	6680 KB	Output is correct
13	Correct	251 ms	6680 KB	Output is correct
14	Correct	244 ms	6680 KB	Output is correct
15	Correct	251 ms	7320 KB	Output is correct
16	Correct	267 ms	7320 KB	Output is correct
17	Correct	278 ms	7764 KB	Output is correct
18	Correct	275 ms	10568 KB	Output is correct
19	Correct	204 ms	10568 KB	Output is correct
20	Correct	292 ms	10568 KB	Output is correct
21	Correct	339 ms	10568 KB	Output is correct
22	Correct	342 ms	10568 KB	Output is correct
23	Correct	370 ms	10568 KB	Output is correct
24	Correct	312 ms	10568 KB	Output is correct
25	Correct	317 ms	11148 KB	Output is correct
26	Correct	341 ms	11148 KB	Output is correct
27	Correct	341 ms	11148 KB	Output is correct
28	Correct	261 ms	12940 KB	Output is correct
29	Correct	244 ms	12940 KB	Output is correct
30	Correct	305 ms	12940 KB	Output is correct
31	Correct	368 ms	12940 KB	Output is correct
32	Correct	392 ms	12940 KB	Output is correct
33	Correct	277 ms	12940 KB	Output is correct
34	Correct	325 ms	12940 KB	Output is correct
35	Correct	370 ms	12940 KB	Output is correct
36	Correct	188 ms	12940 KB	Output is correct
37	Correct	282 ms	12940 KB	Output is correct
38	Correct	249 ms	12940 KB	Output is correct
39	Correct	309 ms	12940 KB	Output is correct
40	Correct	340 ms	12940 KB	Output is correct

Subtask #4
53.0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	660 KB	Output is correct
5	Correct	2 ms	660 KB	Output is correct
6	Correct	2 ms	660 KB	Output is correct
7	Correct	3 ms	752 KB	Output is correct
8	Correct	2 ms	752 KB	Output is correct
9	Correct	3 ms	820 KB	Output is correct
10	Correct	2 ms	820 KB	Output is correct
11	Correct	115 ms	17980 KB	Output is correct
12	Correct	116 ms	17980 KB	Output is correct
13	Correct	160 ms	17980 KB	Output is correct
14	Correct	172 ms	17980 KB	Output is correct
15	Correct	117 ms	17996 KB	Output is correct
16	Correct	160 ms	17996 KB	Output is correct
17	Correct	135 ms	17996 KB	Output is correct
18	Correct	112 ms	18160 KB	Output is correct
19	Correct	137 ms	18160 KB	Output is correct
20	Correct	132 ms	18160 KB	Output is correct
21	Correct	130 ms	18160 KB	Output is correct
22	Correct	151 ms	18160 KB	Output is correct
23	Correct	111 ms	18160 KB	Output is correct
24	Correct	129 ms	18160 KB	Output is correct
25	Correct	181 ms	18160 KB	Output is correct
26	Correct	118 ms	18160 KB	Output is correct
27	Correct	117 ms	18292 KB	Output is correct
28	Correct	113 ms	18292 KB	Output is correct
29	Correct	123 ms	18292 KB	Output is correct
30	Correct	131 ms	18292 KB	Output is correct
31	Correct	126 ms	18292 KB	Output is correct
32	Correct	148 ms	18292 KB	Output is correct
33	Correct	140 ms	18292 KB	Output is correct
34	Correct	101 ms	18292 KB	Output is correct
35	Correct	140 ms	18292 KB	Output is correct
36	Correct	125 ms	18292 KB	Output is correct
37	Correct	128 ms	18292 KB	Output is correct
38	Correct	132 ms	18292 KB	Output is correct
39	Correct	127 ms	18292 KB	Output is correct
40	Correct	126 ms	18292 KB	Output is correct

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	660 KB	Output is correct
5	Correct	2 ms	660 KB	Output is correct
6	Correct	2 ms	660 KB	Output is correct
7	Correct	3 ms	752 KB	Output is correct
8	Correct	2 ms	752 KB	Output is correct
9	Correct	3 ms	820 KB	Output is correct
10	Correct	2 ms	820 KB	Output is correct
11	Correct	232 ms	6628 KB	Output is correct
12	Correct	237 ms	6680 KB	Output is correct
13	Correct	251 ms	6680 KB	Output is correct
14	Correct	244 ms	6680 KB	Output is correct
15	Correct	251 ms	7320 KB	Output is correct
16	Correct	267 ms	7320 KB	Output is correct
17	Correct	278 ms	7764 KB	Output is correct
18	Correct	275 ms	10568 KB	Output is correct
19	Correct	204 ms	10568 KB	Output is correct
20	Correct	292 ms	10568 KB	Output is correct
21	Correct	339 ms	10568 KB	Output is correct
22	Correct	342 ms	10568 KB	Output is correct
23	Correct	370 ms	10568 KB	Output is correct
24	Correct	312 ms	10568 KB	Output is correct
25	Correct	317 ms	11148 KB	Output is correct
26	Correct	341 ms	11148 KB	Output is correct
27	Correct	341 ms	11148 KB	Output is correct
28	Correct	261 ms	12940 KB	Output is correct
29	Correct	244 ms	12940 KB	Output is correct
30	Correct	305 ms	12940 KB	Output is correct
31	Correct	368 ms	12940 KB	Output is correct
32	Correct	392 ms	12940 KB	Output is correct
33	Correct	277 ms	12940 KB	Output is correct
34	Correct	325 ms	12940 KB	Output is correct
35	Correct	370 ms	12940 KB	Output is correct
36	Correct	188 ms	12940 KB	Output is correct
37	Correct	282 ms	12940 KB	Output is correct
38	Correct	249 ms	12940 KB	Output is correct
39	Correct	309 ms	12940 KB	Output is correct
40	Correct	340 ms	12940 KB	Output is correct
41	Correct	115 ms	17980 KB	Output is correct
42	Correct	116 ms	17980 KB	Output is correct
43	Correct	160 ms	17980 KB	Output is correct
44	Correct	172 ms	17980 KB	Output is correct
45	Correct	117 ms	17996 KB	Output is correct
46	Correct	160 ms	17996 KB	Output is correct
47	Correct	135 ms	17996 KB	Output is correct
48	Correct	112 ms	18160 KB	Output is correct
49	Correct	137 ms	18160 KB	Output is correct
50	Correct	132 ms	18160 KB	Output is correct
51	Correct	130 ms	18160 KB	Output is correct
52	Correct	151 ms	18160 KB	Output is correct
53	Correct	111 ms	18160 KB	Output is correct
54	Correct	129 ms	18160 KB	Output is correct
55	Correct	181 ms	18160 KB	Output is correct
56	Correct	118 ms	18160 KB	Output is correct
57	Correct	117 ms	18292 KB	Output is correct
58	Correct	113 ms	18292 KB	Output is correct
59	Correct	123 ms	18292 KB	Output is correct
60	Correct	131 ms	18292 KB	Output is correct
61	Correct	126 ms	18292 KB	Output is correct
62	Correct	148 ms	18292 KB	Output is correct
63	Correct	140 ms	18292 KB	Output is correct
64	Correct	101 ms	18292 KB	Output is correct
65	Correct	140 ms	18292 KB	Output is correct
66	Correct	125 ms	18292 KB	Output is correct
67	Correct	128 ms	18292 KB	Output is correct
68	Correct	132 ms	18292 KB	Output is correct
69	Correct	127 ms	18292 KB	Output is correct
70	Correct	126 ms	18292 KB	Output is correct
71	Correct	625 ms	22900 KB	Output is correct
72	Correct	656 ms	24556 KB	Output is correct
73	Correct	774 ms	24556 KB	Output is correct
74	Correct	1674 ms	24556 KB	Output is correct
75	Correct	711 ms	25384 KB	Output is correct
76	Correct	1283 ms	25384 KB	Output is correct
77	Correct	1057 ms	25384 KB	Output is correct
78	Correct	462 ms	27560 KB	Output is correct
79	Correct	486 ms	27560 KB	Output is correct
80	Correct	631 ms	27560 KB	Output is correct
81	Correct	861 ms	27560 KB	Output is correct
82	Correct	1612 ms	27560 KB	Output is correct
83	Correct	530 ms	27560 KB	Output is correct
84	Correct	1032 ms	27560 KB	Output is correct
85	Correct	1006 ms	27560 KB	Output is correct
86	Correct	346 ms	27560 KB	Output is correct
87	Correct	572 ms	27560 KB	Output is correct
88	Correct	498 ms	35044 KB	Output is correct
89	Correct	675 ms	36820 KB	Output is correct
90	Correct	706 ms	37092 KB	Output is correct
91	Correct	556 ms	37092 KB	Output is correct
92	Correct	1197 ms	59116 KB	Output is correct
93	Runtime error	1101 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.
94	Halted	0 ms	0 KB	-

Submission #68765

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