Submission #68762

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
68762	2018-08-18T10:44:00 Z	tmwilliamlin168	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	1827 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	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	416 KB	Output is correct
4	Correct	3 ms	428 KB	Output is correct
5	Correct	3 ms	444 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	3 ms	624 KB	Output is correct
8	Correct	4 ms	628 KB	Output is correct
9	Correct	4 ms	640 KB	Output is correct
10	Correct	4 ms	652 KB	Output is correct

Subtask #2
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	416 KB	Output is correct
4	Correct	3 ms	428 KB	Output is correct
5	Correct	3 ms	444 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	3 ms	624 KB	Output is correct
8	Correct	4 ms	628 KB	Output is correct
9	Correct	4 ms	640 KB	Output is correct
10	Correct	4 ms	652 KB	Output is correct
11	Correct	285 ms	7148 KB	Output is correct
12	Correct	316 ms	7180 KB	Output is correct
13	Correct	280 ms	7180 KB	Output is correct
14	Correct	283 ms	7180 KB	Output is correct
15	Correct	255 ms	7912 KB	Output is correct
16	Correct	280 ms	7912 KB	Output is correct
17	Correct	300 ms	7912 KB	Output is correct
18	Correct	237 ms	9748 KB	Output is correct
19	Correct	228 ms	9748 KB	Output is correct
20	Correct	246 ms	9748 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	416 KB	Output is correct
4	Correct	3 ms	428 KB	Output is correct
5	Correct	3 ms	444 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	3 ms	624 KB	Output is correct
8	Correct	4 ms	628 KB	Output is correct
9	Correct	4 ms	640 KB	Output is correct
10	Correct	4 ms	652 KB	Output is correct
11	Correct	285 ms	7148 KB	Output is correct
12	Correct	316 ms	7180 KB	Output is correct
13	Correct	280 ms	7180 KB	Output is correct
14	Correct	283 ms	7180 KB	Output is correct
15	Correct	255 ms	7912 KB	Output is correct
16	Correct	280 ms	7912 KB	Output is correct
17	Correct	300 ms	7912 KB	Output is correct
18	Correct	237 ms	9748 KB	Output is correct
19	Correct	228 ms	9748 KB	Output is correct
20	Correct	246 ms	9748 KB	Output is correct
21	Correct	321 ms	9748 KB	Output is correct
22	Correct	304 ms	9748 KB	Output is correct
23	Correct	354 ms	9748 KB	Output is correct
24	Correct	354 ms	9748 KB	Output is correct
25	Correct	318 ms	9748 KB	Output is correct
26	Correct	369 ms	9748 KB	Output is correct
27	Correct	346 ms	9748 KB	Output is correct
28	Correct	272 ms	10820 KB	Output is correct
29	Correct	273 ms	10820 KB	Output is correct
30	Correct	317 ms	10820 KB	Output is correct
31	Correct	398 ms	10820 KB	Output is correct
32	Correct	437 ms	10820 KB	Output is correct
33	Correct	318 ms	10820 KB	Output is correct
34	Correct	361 ms	10820 KB	Output is correct
35	Correct	378 ms	10820 KB	Output is correct
36	Correct	205 ms	10820 KB	Output is correct
37	Correct	339 ms	10820 KB	Output is correct
38	Correct	277 ms	10820 KB	Output is correct
39	Correct	321 ms	10820 KB	Output is correct
40	Correct	314 ms	10820 KB	Output is correct

Subtask #4
53.0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	416 KB	Output is correct
4	Correct	3 ms	428 KB	Output is correct
5	Correct	3 ms	444 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	3 ms	624 KB	Output is correct
8	Correct	4 ms	628 KB	Output is correct
9	Correct	4 ms	640 KB	Output is correct
10	Correct	4 ms	652 KB	Output is correct
11	Correct	120 ms	14272 KB	Output is correct
12	Correct	135 ms	14272 KB	Output is correct
13	Correct	154 ms	14272 KB	Output is correct
14	Correct	246 ms	14276 KB	Output is correct
15	Correct	136 ms	14300 KB	Output is correct
16	Correct	164 ms	14300 KB	Output is correct
17	Correct	163 ms	14300 KB	Output is correct
18	Correct	110 ms	14400 KB	Output is correct
19	Correct	122 ms	14400 KB	Output is correct
20	Correct	128 ms	14400 KB	Output is correct
21	Correct	146 ms	14400 KB	Output is correct
22	Correct	191 ms	14400 KB	Output is correct
23	Correct	117 ms	14400 KB	Output is correct
24	Correct	150 ms	14400 KB	Output is correct
25	Correct	173 ms	14400 KB	Output is correct
26	Correct	103 ms	14400 KB	Output is correct
27	Correct	151 ms	14400 KB	Output is correct
28	Correct	112 ms	14400 KB	Output is correct
29	Correct	133 ms	14400 KB	Output is correct
30	Correct	136 ms	14400 KB	Output is correct
31	Correct	139 ms	14400 KB	Output is correct
32	Correct	144 ms	14400 KB	Output is correct
33	Correct	141 ms	14400 KB	Output is correct
34	Correct	107 ms	14400 KB	Output is correct
35	Correct	150 ms	14400 KB	Output is correct
36	Correct	147 ms	14400 KB	Output is correct
37	Correct	155 ms	14400 KB	Output is correct
38	Correct	177 ms	14400 KB	Output is correct
39	Correct	125 ms	14400 KB	Output is correct
40	Correct	124 ms	14400 KB	Output is correct

Subtask #5
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	416 KB	Output is correct
4	Correct	3 ms	428 KB	Output is correct
5	Correct	3 ms	444 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	3 ms	624 KB	Output is correct
8	Correct	4 ms	628 KB	Output is correct
9	Correct	4 ms	640 KB	Output is correct
10	Correct	4 ms	652 KB	Output is correct
11	Correct	285 ms	7148 KB	Output is correct
12	Correct	316 ms	7180 KB	Output is correct
13	Correct	280 ms	7180 KB	Output is correct
14	Correct	283 ms	7180 KB	Output is correct
15	Correct	255 ms	7912 KB	Output is correct
16	Correct	280 ms	7912 KB	Output is correct
17	Correct	300 ms	7912 KB	Output is correct
18	Correct	237 ms	9748 KB	Output is correct
19	Correct	228 ms	9748 KB	Output is correct
20	Correct	246 ms	9748 KB	Output is correct
21	Correct	321 ms	9748 KB	Output is correct
22	Correct	304 ms	9748 KB	Output is correct
23	Correct	354 ms	9748 KB	Output is correct
24	Correct	354 ms	9748 KB	Output is correct
25	Correct	318 ms	9748 KB	Output is correct
26	Correct	369 ms	9748 KB	Output is correct
27	Correct	346 ms	9748 KB	Output is correct
28	Correct	272 ms	10820 KB	Output is correct
29	Correct	273 ms	10820 KB	Output is correct
30	Correct	317 ms	10820 KB	Output is correct
31	Correct	398 ms	10820 KB	Output is correct
32	Correct	437 ms	10820 KB	Output is correct
33	Correct	318 ms	10820 KB	Output is correct
34	Correct	361 ms	10820 KB	Output is correct
35	Correct	378 ms	10820 KB	Output is correct
36	Correct	205 ms	10820 KB	Output is correct
37	Correct	339 ms	10820 KB	Output is correct
38	Correct	277 ms	10820 KB	Output is correct
39	Correct	321 ms	10820 KB	Output is correct
40	Correct	314 ms	10820 KB	Output is correct
41	Correct	120 ms	14272 KB	Output is correct
42	Correct	135 ms	14272 KB	Output is correct
43	Correct	154 ms	14272 KB	Output is correct
44	Correct	246 ms	14276 KB	Output is correct
45	Correct	136 ms	14300 KB	Output is correct
46	Correct	164 ms	14300 KB	Output is correct
47	Correct	163 ms	14300 KB	Output is correct
48	Correct	110 ms	14400 KB	Output is correct
49	Correct	122 ms	14400 KB	Output is correct
50	Correct	128 ms	14400 KB	Output is correct
51	Correct	146 ms	14400 KB	Output is correct
52	Correct	191 ms	14400 KB	Output is correct
53	Correct	117 ms	14400 KB	Output is correct
54	Correct	150 ms	14400 KB	Output is correct
55	Correct	173 ms	14400 KB	Output is correct
56	Correct	103 ms	14400 KB	Output is correct
57	Correct	151 ms	14400 KB	Output is correct
58	Correct	112 ms	14400 KB	Output is correct
59	Correct	133 ms	14400 KB	Output is correct
60	Correct	136 ms	14400 KB	Output is correct
61	Correct	139 ms	14400 KB	Output is correct
62	Correct	144 ms	14400 KB	Output is correct
63	Correct	141 ms	14400 KB	Output is correct
64	Correct	107 ms	14400 KB	Output is correct
65	Correct	150 ms	14400 KB	Output is correct
66	Correct	147 ms	14400 KB	Output is correct
67	Correct	155 ms	14400 KB	Output is correct
68	Correct	177 ms	14400 KB	Output is correct
69	Correct	125 ms	14400 KB	Output is correct
70	Correct	124 ms	14400 KB	Output is correct
71	Correct	664 ms	19008 KB	Output is correct
72	Correct	726 ms	19136 KB	Output is correct
73	Correct	734 ms	19136 KB	Output is correct
74	Correct	1505 ms	19136 KB	Output is correct
75	Correct	747 ms	19840 KB	Output is correct
76	Correct	1404 ms	19840 KB	Output is correct
77	Correct	1173 ms	19840 KB	Output is correct
78	Correct	454 ms	21808 KB	Output is correct
79	Correct	505 ms	21808 KB	Output is correct
80	Correct	729 ms	21808 KB	Output is correct
81	Correct	1057 ms	21808 KB	Output is correct
82	Correct	1827 ms	21808 KB	Output is correct
83	Correct	635 ms	21808 KB	Output is correct
84	Correct	1085 ms	21808 KB	Output is correct
85	Correct	1416 ms	31480 KB	Output is correct
86	Correct	369 ms	31480 KB	Output is correct
87	Correct	664 ms	32208 KB	Output is correct
88	Correct	608 ms	50928 KB	Output is correct
89	Runtime error	854 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.
90	Halted	0 ms	0 KB	-

Submission #68762

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