답안 #42382 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
42382	2018-02-26T15:27:34 Z	RezwanArefin01	Snake Escaping (JOI18_snake_escaping)	C++14	65 / 100	2000 ms	65536 KB

snake_escaping

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

typedef long long ll;
typedef pair<int, int> ii; 

ll dp[1 << 20], ans; 
string b, s; int l, q;

void recurr1(int i, int num, int tot) {
	if(i == l) {
		if(tot & 1) ans -= dp[num];
		else ans += dp[num];
		return; 
	}
	if(s[i] == '0') {
		recurr1(i + 1, num << 1, tot); 
	} else if(s[i] == '?') {
		recurr1(i + 1, num << 1 | 1, tot);
	} else {
		recurr1(i + 1, num << 1 | 1, tot); 
		recurr1(i + 1, num << 1, tot + 1);
	}
}

void recurrw0t(int i, int num) {
	if(i == l) {
		ans += b[num] - '0';
		return;
	} 
	if(s[i] == '?') {
		recurrw0t(i + 1, num << 1 | 1);
		recurrw0t(i + 1, num << 1);
	} else recurrw0t(i + 1, (num << 1) + (s[i] == '1'));
}
int main(int argc, char const *argv[]) {
#ifdef LOCAL_TESTING
	freopen("in", "r", stdin);
#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin >> l >> q >> b;
	for(int i = 0; i < (1 << l); i++) {
		dp[i] = b[i] - '0';
	}
	for(int i = 0; i < l; i++) {
		for(int j = 0; j < (1 << l); j++) {
			if(j >> i & 1) 
				dp[j] += dp[j ^ (1 << i)];
		}
	}
	while(q--) {
		cin >> s; 
		int n0 = 0, n1 = 0, nw0t = 0; 
		for(char c : s) {
			n0 += c == '0';
			n1 += c == '1';
			nw0t += c == '?';
		}

		if(n1 == 0) {
			int num = 0;
			for(char c : s) num = (num << 1) + (c == '?');
			cout << dp[num] << endl;
		} else if(nw0t == 0) {
			int num = 0;
			for(char c : s) num = (num << 1) + (c == '1');
			cout << b[num] << endl;
		} else {
			ans = 0;
			if(nw0t <= n1) recurrw0t(0, 0);
			else recurr1(0, 0, 0);
/*			if(n1 <= n0 && n1 <= nw0t) {
				ans = 0;
				recurr1(0, 0, 0);
			} else if(nw0t <= n0 && nw0t <= n1) {
				ans = 0;
				recurrw0t(0, 0);
			} else {

			}*/
			cout << ans << endl;
		}
	}
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	552 KB	Output is correct
4	Correct	3 ms	552 KB	Output is correct
5	Correct	3 ms	552 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	3 ms	588 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	3 ms	684 KB	Output is correct
10	Correct	3 ms	684 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	552 KB	Output is correct
4	Correct	3 ms	552 KB	Output is correct
5	Correct	3 ms	552 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	3 ms	588 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	3 ms	684 KB	Output is correct
10	Correct	3 ms	684 KB	Output is correct
11	Correct	1867 ms	5132 KB	Output is correct
12	Correct	1527 ms	15772 KB	Output is correct
13	Correct	1624 ms	25792 KB	Output is correct
14	Correct	1566 ms	34992 KB	Output is correct
15	Correct	1690 ms	35976 KB	Output is correct
16	Correct	1678 ms	35976 KB	Output is correct
17	Correct	1633 ms	35976 KB	Output is correct
18	Correct	1481 ms	36884 KB	Output is correct
19	Correct	1441 ms	36884 KB	Output is correct
20	Correct	1847 ms	36884 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	552 KB	Output is correct
4	Correct	3 ms	552 KB	Output is correct
5	Correct	3 ms	552 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	3 ms	588 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	3 ms	684 KB	Output is correct
10	Correct	3 ms	684 KB	Output is correct
11	Correct	1867 ms	5132 KB	Output is correct
12	Correct	1527 ms	15772 KB	Output is correct
13	Correct	1624 ms	25792 KB	Output is correct
14	Correct	1566 ms	34992 KB	Output is correct
15	Correct	1690 ms	35976 KB	Output is correct
16	Correct	1678 ms	35976 KB	Output is correct
17	Correct	1633 ms	35976 KB	Output is correct
18	Correct	1481 ms	36884 KB	Output is correct
19	Correct	1441 ms	36884 KB	Output is correct
20	Correct	1847 ms	36884 KB	Output is correct
21	Execution timed out	2069 ms	36884 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	552 KB	Output is correct
4	Correct	3 ms	552 KB	Output is correct
5	Correct	3 ms	552 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	3 ms	588 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	3 ms	684 KB	Output is correct
10	Correct	3 ms	684 KB	Output is correct
11	Correct	579 ms	41512 KB	Output is correct
12	Correct	147 ms	41512 KB	Output is correct
13	Correct	164 ms	41512 KB	Output is correct
14	Correct	256 ms	41512 KB	Output is correct
15	Correct	145 ms	41512 KB	Output is correct
16	Correct	222 ms	41512 KB	Output is correct
17	Correct	231 ms	41516 KB	Output is correct
18	Correct	110 ms	41768 KB	Output is correct
19	Correct	107 ms	41768 KB	Output is correct
20	Correct	380 ms	41768 KB	Output is correct
21	Correct	207 ms	41768 KB	Output is correct
22	Correct	217 ms	41768 KB	Output is correct
23	Correct	131 ms	41768 KB	Output is correct
24	Correct	180 ms	43836 KB	Output is correct
25	Correct	208 ms	45920 KB	Output is correct
26	Correct	106 ms	47996 KB	Output is correct
27	Correct	114 ms	50028 KB	Output is correct
28	Correct	122 ms	52080 KB	Output is correct
29	Correct	180 ms	54216 KB	Output is correct
30	Correct	187 ms	56344 KB	Output is correct
31	Correct	168 ms	58224 KB	Output is correct
32	Correct	248 ms	60368 KB	Output is correct
33	Correct	210 ms	62568 KB	Output is correct
34	Correct	110 ms	64640 KB	Output is correct
35	Correct	209 ms	65536 KB	Output is correct
36	Correct	200 ms	65536 KB	Output is correct
37	Correct	242 ms	65536 KB	Output is correct
38	Correct	246 ms	65536 KB	Output is correct
39	Correct	209 ms	65536 KB	Output is correct
40	Correct	228 ms	65536 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	3 ms	552 KB	Output is correct
4	Correct	3 ms	552 KB	Output is correct
5	Correct	3 ms	552 KB	Output is correct
6	Correct	3 ms	564 KB	Output is correct
7	Correct	3 ms	588 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	3 ms	684 KB	Output is correct
10	Correct	3 ms	684 KB	Output is correct
11	Correct	1867 ms	5132 KB	Output is correct
12	Correct	1527 ms	15772 KB	Output is correct
13	Correct	1624 ms	25792 KB	Output is correct
14	Correct	1566 ms	34992 KB	Output is correct
15	Correct	1690 ms	35976 KB	Output is correct
16	Correct	1678 ms	35976 KB	Output is correct
17	Correct	1633 ms	35976 KB	Output is correct
18	Correct	1481 ms	36884 KB	Output is correct
19	Correct	1441 ms	36884 KB	Output is correct
20	Correct	1847 ms	36884 KB	Output is correct
21	Execution timed out	2069 ms	36884 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

답안 #42382

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 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
0 / 10.0

Subtask #4
53.0 / 53.0

Subtask #5
0 / 25.0