Submission #68761

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
68761	2018-08-18T10:42:37 Z	tmwilliamlin168	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	1406 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	4 ms	496 KB	Output is correct
3	Correct	3 ms	496 KB	Output is correct
4	Correct	3 ms	532 KB	Output is correct
5	Correct	4 ms	740 KB	Output is correct
6	Correct	3 ms	740 KB	Output is correct
7	Correct	3 ms	740 KB	Output is correct
8	Correct	2 ms	744 KB	Output is correct
9	Correct	3 ms	744 KB	Output is correct
10	Correct	3 ms	744 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	4 ms	496 KB	Output is correct
3	Correct	3 ms	496 KB	Output is correct
4	Correct	3 ms	532 KB	Output is correct
5	Correct	4 ms	740 KB	Output is correct
6	Correct	3 ms	740 KB	Output is correct
7	Correct	3 ms	740 KB	Output is correct
8	Correct	2 ms	744 KB	Output is correct
9	Correct	3 ms	744 KB	Output is correct
10	Correct	3 ms	744 KB	Output is correct
11	Correct	251 ms	7100 KB	Output is correct
12	Correct	262 ms	7252 KB	Output is correct
13	Correct	299 ms	7252 KB	Output is correct
14	Correct	271 ms	7252 KB	Output is correct
15	Correct	273 ms	8068 KB	Output is correct
16	Correct	284 ms	8068 KB	Output is correct
17	Correct	306 ms	8068 KB	Output is correct
18	Correct	228 ms	9680 KB	Output is correct
19	Correct	217 ms	9680 KB	Output is correct
20	Correct	301 ms	9680 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	4 ms	496 KB	Output is correct
3	Correct	3 ms	496 KB	Output is correct
4	Correct	3 ms	532 KB	Output is correct
5	Correct	4 ms	740 KB	Output is correct
6	Correct	3 ms	740 KB	Output is correct
7	Correct	3 ms	740 KB	Output is correct
8	Correct	2 ms	744 KB	Output is correct
9	Correct	3 ms	744 KB	Output is correct
10	Correct	3 ms	744 KB	Output is correct
11	Correct	251 ms	7100 KB	Output is correct
12	Correct	262 ms	7252 KB	Output is correct
13	Correct	299 ms	7252 KB	Output is correct
14	Correct	271 ms	7252 KB	Output is correct
15	Correct	273 ms	8068 KB	Output is correct
16	Correct	284 ms	8068 KB	Output is correct
17	Correct	306 ms	8068 KB	Output is correct
18	Correct	228 ms	9680 KB	Output is correct
19	Correct	217 ms	9680 KB	Output is correct
20	Correct	301 ms	9680 KB	Output is correct
21	Correct	315 ms	9680 KB	Output is correct
22	Correct	318 ms	9680 KB	Output is correct
23	Correct	336 ms	9680 KB	Output is correct
24	Correct	314 ms	9680 KB	Output is correct
25	Correct	319 ms	9680 KB	Output is correct
26	Correct	386 ms	9680 KB	Output is correct
27	Correct	396 ms	9680 KB	Output is correct
28	Correct	258 ms	10812 KB	Output is correct
29	Correct	240 ms	10812 KB	Output is correct
30	Correct	336 ms	10812 KB	Output is correct
31	Correct	371 ms	10812 KB	Output is correct
32	Correct	478 ms	10812 KB	Output is correct
33	Correct	290 ms	10812 KB	Output is correct
34	Correct	341 ms	10812 KB	Output is correct
35	Correct	335 ms	10812 KB	Output is correct
36	Correct	205 ms	10812 KB	Output is correct
37	Correct	306 ms	10812 KB	Output is correct
38	Correct	329 ms	10812 KB	Output is correct
39	Correct	358 ms	10812 KB	Output is correct
40	Correct	344 ms	10812 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	4 ms	496 KB	Output is correct
3	Correct	3 ms	496 KB	Output is correct
4	Correct	3 ms	532 KB	Output is correct
5	Correct	4 ms	740 KB	Output is correct
6	Correct	3 ms	740 KB	Output is correct
7	Correct	3 ms	740 KB	Output is correct
8	Correct	2 ms	744 KB	Output is correct
9	Correct	3 ms	744 KB	Output is correct
10	Correct	3 ms	744 KB	Output is correct
11	Correct	160 ms	14164 KB	Output is correct
12	Correct	129 ms	14288 KB	Output is correct
13	Correct	115 ms	14288 KB	Output is correct
14	Correct	148 ms	14288 KB	Output is correct
15	Correct	119 ms	14288 KB	Output is correct
16	Correct	180 ms	14292 KB	Output is correct
17	Correct	168 ms	14292 KB	Output is correct
18	Correct	122 ms	14420 KB	Output is correct
19	Correct	121 ms	14420 KB	Output is correct
20	Correct	161 ms	14420 KB	Output is correct
21	Correct	154 ms	14420 KB	Output is correct
22	Correct	214 ms	14420 KB	Output is correct
23	Correct	111 ms	14420 KB	Output is correct
24	Correct	202 ms	14420 KB	Output is correct
25	Correct	142 ms	14420 KB	Output is correct
26	Correct	108 ms	14420 KB	Output is correct
27	Correct	153 ms	14420 KB	Output is correct
28	Correct	109 ms	14420 KB	Output is correct
29	Correct	149 ms	14420 KB	Output is correct
30	Correct	120 ms	14420 KB	Output is correct
31	Correct	125 ms	14420 KB	Output is correct
32	Correct	174 ms	14420 KB	Output is correct
33	Correct	160 ms	14420 KB	Output is correct
34	Correct	109 ms	14420 KB	Output is correct
35	Correct	147 ms	14420 KB	Output is correct
36	Correct	148 ms	14420 KB	Output is correct
37	Correct	124 ms	14420 KB	Output is correct
38	Correct	128 ms	14420 KB	Output is correct
39	Correct	133 ms	14420 KB	Output is correct
40	Correct	142 ms	14420 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	4 ms	496 KB	Output is correct
3	Correct	3 ms	496 KB	Output is correct
4	Correct	3 ms	532 KB	Output is correct
5	Correct	4 ms	740 KB	Output is correct
6	Correct	3 ms	740 KB	Output is correct
7	Correct	3 ms	740 KB	Output is correct
8	Correct	2 ms	744 KB	Output is correct
9	Correct	3 ms	744 KB	Output is correct
10	Correct	3 ms	744 KB	Output is correct
11	Correct	251 ms	7100 KB	Output is correct
12	Correct	262 ms	7252 KB	Output is correct
13	Correct	299 ms	7252 KB	Output is correct
14	Correct	271 ms	7252 KB	Output is correct
15	Correct	273 ms	8068 KB	Output is correct
16	Correct	284 ms	8068 KB	Output is correct
17	Correct	306 ms	8068 KB	Output is correct
18	Correct	228 ms	9680 KB	Output is correct
19	Correct	217 ms	9680 KB	Output is correct
20	Correct	301 ms	9680 KB	Output is correct
21	Correct	315 ms	9680 KB	Output is correct
22	Correct	318 ms	9680 KB	Output is correct
23	Correct	336 ms	9680 KB	Output is correct
24	Correct	314 ms	9680 KB	Output is correct
25	Correct	319 ms	9680 KB	Output is correct
26	Correct	386 ms	9680 KB	Output is correct
27	Correct	396 ms	9680 KB	Output is correct
28	Correct	258 ms	10812 KB	Output is correct
29	Correct	240 ms	10812 KB	Output is correct
30	Correct	336 ms	10812 KB	Output is correct
31	Correct	371 ms	10812 KB	Output is correct
32	Correct	478 ms	10812 KB	Output is correct
33	Correct	290 ms	10812 KB	Output is correct
34	Correct	341 ms	10812 KB	Output is correct
35	Correct	335 ms	10812 KB	Output is correct
36	Correct	205 ms	10812 KB	Output is correct
37	Correct	306 ms	10812 KB	Output is correct
38	Correct	329 ms	10812 KB	Output is correct
39	Correct	358 ms	10812 KB	Output is correct
40	Correct	344 ms	10812 KB	Output is correct
41	Correct	160 ms	14164 KB	Output is correct
42	Correct	129 ms	14288 KB	Output is correct
43	Correct	115 ms	14288 KB	Output is correct
44	Correct	148 ms	14288 KB	Output is correct
45	Correct	119 ms	14288 KB	Output is correct
46	Correct	180 ms	14292 KB	Output is correct
47	Correct	168 ms	14292 KB	Output is correct
48	Correct	122 ms	14420 KB	Output is correct
49	Correct	121 ms	14420 KB	Output is correct
50	Correct	161 ms	14420 KB	Output is correct
51	Correct	154 ms	14420 KB	Output is correct
52	Correct	214 ms	14420 KB	Output is correct
53	Correct	111 ms	14420 KB	Output is correct
54	Correct	202 ms	14420 KB	Output is correct
55	Correct	142 ms	14420 KB	Output is correct
56	Correct	108 ms	14420 KB	Output is correct
57	Correct	153 ms	14420 KB	Output is correct
58	Correct	109 ms	14420 KB	Output is correct
59	Correct	149 ms	14420 KB	Output is correct
60	Correct	120 ms	14420 KB	Output is correct
61	Correct	125 ms	14420 KB	Output is correct
62	Correct	174 ms	14420 KB	Output is correct
63	Correct	160 ms	14420 KB	Output is correct
64	Correct	109 ms	14420 KB	Output is correct
65	Correct	147 ms	14420 KB	Output is correct
66	Correct	148 ms	14420 KB	Output is correct
67	Correct	124 ms	14420 KB	Output is correct
68	Correct	128 ms	14420 KB	Output is correct
69	Correct	133 ms	14420 KB	Output is correct
70	Correct	142 ms	14420 KB	Output is correct
71	Correct	617 ms	18896 KB	Output is correct
72	Correct	678 ms	19092 KB	Output is correct
73	Correct	895 ms	19092 KB	Output is correct
74	Correct	1390 ms	19092 KB	Output is correct
75	Correct	753 ms	19792 KB	Output is correct
76	Correct	1406 ms	19792 KB	Output is correct
77	Correct	1109 ms	19792 KB	Output is correct
78	Correct	498 ms	21840 KB	Output is correct
79	Correct	581 ms	21840 KB	Output is correct
80	Correct	636 ms	21840 KB	Output is correct
81	Correct	1097 ms	21840 KB	Output is correct
82	Correct	1249 ms	21840 KB	Output is correct
83	Correct	578 ms	21840 KB	Output is correct
84	Correct	917 ms	21840 KB	Output is correct
85	Correct	1322 ms	39888 KB	Output is correct
86	Correct	358 ms	59212 KB	Output is correct
87	Runtime error	740 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.
88	Halted	0 ms	0 KB	-

Submission #68761

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