답안 #68737 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
68737	2018-08-18T10:08:30 Z	tmwilliamlin168	Snake Escaping (JOI18_snake_escaping)	C++11	12 / 100	503 ms	66560 KB

snake_escaping

#include <bits/stdc++.h>
using namespace std;

const int mxL=20, mxQ=1e6;
int l, q, dp[2][1<<mxL];
string s;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> l >> q >> s;
	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--) {
		string t;
		cin >> t;
		int na=0, nb=0, nc=0, ma=0, mb=0, mc=0, ans=0;
		for(int i=0; i<l; ++i) {
			if(t[i]=='0') {
				++na;
				ma|=1<<(l-1-i);
			} else if(t[i]=='1') {
				++nb;
				mb|=1<<(l-1-i);
			} else {
				++nc;
				mc|=1<<(l-1-i);
			}
		}
		if(na<nc||nb<nc) {
			bool sw=0;
			if(nb>na) {
				swap(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;
			}
		}
		cout << ans << "\n";
	}
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:18:12: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
     if(i>>k&1^j)
        ~~~~^~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	3 ms	496 KB	Output is correct
4	Correct	3 ms	496 KB	Output is correct
5	Correct	3 ms	496 KB	Output is correct
6	Correct	3 ms	528 KB	Output is correct
7	Correct	3 ms	556 KB	Output is correct
8	Correct	3 ms	648 KB	Output is correct
9	Correct	2 ms	648 KB	Output is correct
10	Correct	4 ms	652 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	3 ms	496 KB	Output is correct
4	Correct	3 ms	496 KB	Output is correct
5	Correct	3 ms	496 KB	Output is correct
6	Correct	3 ms	528 KB	Output is correct
7	Correct	3 ms	556 KB	Output is correct
8	Correct	3 ms	648 KB	Output is correct
9	Correct	2 ms	648 KB	Output is correct
10	Correct	4 ms	652 KB	Output is correct
11	Correct	291 ms	15400 KB	Output is correct
12	Correct	296 ms	17792 KB	Output is correct
13	Correct	278 ms	17792 KB	Output is correct
14	Correct	303 ms	17792 KB	Output is correct
15	Correct	256 ms	18776 KB	Output is correct
16	Correct	279 ms	18776 KB	Output is correct
17	Correct	327 ms	19376 KB	Output is correct
18	Correct	193 ms	21232 KB	Output is correct
19	Correct	255 ms	21232 KB	Output is correct
20	Correct	250 ms	21232 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	3 ms	496 KB	Output is correct
4	Correct	3 ms	496 KB	Output is correct
5	Correct	3 ms	496 KB	Output is correct
6	Correct	3 ms	528 KB	Output is correct
7	Correct	3 ms	556 KB	Output is correct
8	Correct	3 ms	648 KB	Output is correct
9	Correct	2 ms	648 KB	Output is correct
10	Correct	4 ms	652 KB	Output is correct
11	Correct	291 ms	15400 KB	Output is correct
12	Correct	296 ms	17792 KB	Output is correct
13	Correct	278 ms	17792 KB	Output is correct
14	Correct	303 ms	17792 KB	Output is correct
15	Correct	256 ms	18776 KB	Output is correct
16	Correct	279 ms	18776 KB	Output is correct
17	Correct	327 ms	19376 KB	Output is correct
18	Correct	193 ms	21232 KB	Output is correct
19	Correct	255 ms	21232 KB	Output is correct
20	Correct	250 ms	21232 KB	Output is correct
21	Correct	289 ms	21232 KB	Output is correct
22	Correct	281 ms	21232 KB	Output is correct
23	Correct	361 ms	21232 KB	Output is correct
24	Correct	369 ms	21232 KB	Output is correct
25	Correct	324 ms	21360 KB	Output is correct
26	Correct	371 ms	21360 KB	Output is correct
27	Correct	408 ms	21360 KB	Output is correct
28	Correct	235 ms	22256 KB	Output is correct
29	Correct	280 ms	22256 KB	Output is correct
30	Correct	334 ms	22256 KB	Output is correct
31	Correct	432 ms	22256 KB	Output is correct
32	Correct	503 ms	34288 KB	Output is correct
33	Correct	295 ms	46736 KB	Output is correct
34	Correct	354 ms	60480 KB	Output is correct
35	Runtime error	363 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.
36	Halted	0 ms	0 KB	-

Subtask #4
0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	3 ms	496 KB	Output is correct
4	Correct	3 ms	496 KB	Output is correct
5	Correct	3 ms	496 KB	Output is correct
6	Correct	3 ms	528 KB	Output is correct
7	Correct	3 ms	556 KB	Output is correct
8	Correct	3 ms	648 KB	Output is correct
9	Correct	2 ms	648 KB	Output is correct
10	Correct	4 ms	652 KB	Output is correct
11	Runtime error	119 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.
12	Halted	0 ms	0 KB	-

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	3 ms	496 KB	Output is correct
3	Correct	3 ms	496 KB	Output is correct
4	Correct	3 ms	496 KB	Output is correct
5	Correct	3 ms	496 KB	Output is correct
6	Correct	3 ms	528 KB	Output is correct
7	Correct	3 ms	556 KB	Output is correct
8	Correct	3 ms	648 KB	Output is correct
9	Correct	2 ms	648 KB	Output is correct
10	Correct	4 ms	652 KB	Output is correct
11	Correct	291 ms	15400 KB	Output is correct
12	Correct	296 ms	17792 KB	Output is correct
13	Correct	278 ms	17792 KB	Output is correct
14	Correct	303 ms	17792 KB	Output is correct
15	Correct	256 ms	18776 KB	Output is correct
16	Correct	279 ms	18776 KB	Output is correct
17	Correct	327 ms	19376 KB	Output is correct
18	Correct	193 ms	21232 KB	Output is correct
19	Correct	255 ms	21232 KB	Output is correct
20	Correct	250 ms	21232 KB	Output is correct
21	Correct	289 ms	21232 KB	Output is correct
22	Correct	281 ms	21232 KB	Output is correct
23	Correct	361 ms	21232 KB	Output is correct
24	Correct	369 ms	21232 KB	Output is correct
25	Correct	324 ms	21360 KB	Output is correct
26	Correct	371 ms	21360 KB	Output is correct
27	Correct	408 ms	21360 KB	Output is correct
28	Correct	235 ms	22256 KB	Output is correct
29	Correct	280 ms	22256 KB	Output is correct
30	Correct	334 ms	22256 KB	Output is correct
31	Correct	432 ms	22256 KB	Output is correct
32	Correct	503 ms	34288 KB	Output is correct
33	Correct	295 ms	46736 KB	Output is correct
34	Correct	354 ms	60480 KB	Output is correct
35	Runtime error	363 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.
36	Halted	0 ms	0 KB	-

답안 #68737

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 0 / 10.0

Subtask #4 0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
0 / 10.0

Subtask #4
0 / 53.0

Subtask #5
0 / 25.0