oj.uz

Submission #42389

# Submission time Handle Problem Language Result Execution time Memory
42389 2018-02-26T15:51:28 Z RezwanArefin01 Snake Escaping (JOI18_snake_escaping) C++14
65 / 100
 2000 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;

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

ll dp[1 << 20], dp2[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 recurr0(int i, int num, int tot) {
	if(i == l) {
		if(tot & 1) ans -= dp2[num];
		else ans += dp2[num];
		return; 
	}
	if(s[i] == '1') recurr0(i + 1, num << 1 | 1, tot);
	else if(s[i] == '?') recurr0(i + 1, num << 1, tot);
	else {
		recurr0(i + 1, num << 1, tot);
		recurr0(i + 1, num << 1 | 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[]) {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin >> l >> q >> b;
	for(int i = 0; i < (1 << l); i++) {
		dp[i] = dp2[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)];
		}
	}
	for(int i = 0; i < l; i++) {
		for(int j = 0; j < (1 << l); j++) {
			if(~j >> i & 1) 
				dp2[j] += dp2[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 && nw0t <= n0) recurrw0t(0, 0);
			else if(n1 <= nw0t && n1 <= n0) recurr1(0, 0, 0);
			else recurr0(0, 0, 0);
			cout << ans << endl;
		}
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 404 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 404 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct
11 Correct 1583 ms 5272 KB Output is correct
12 Correct 1488 ms 15496 KB Output is correct
13 Correct 1628 ms 15496 KB Output is correct
14 Correct 1614 ms 15496 KB Output is correct
15 Correct 1598 ms 16204 KB Output is correct
16 Correct 1693 ms 16204 KB Output is correct
17 Correct 1625 ms 16204 KB Output is correct
18 Correct 1468 ms 17360 KB Output is correct
19 Correct 1437 ms 17360 KB Output is correct
20 Correct 1567 ms 17360 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 404 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct
11 Correct 1583 ms 5272 KB Output is correct
12 Correct 1488 ms 15496 KB Output is correct
13 Correct 1628 ms 15496 KB Output is correct
14 Correct 1614 ms 15496 KB Output is correct
15 Correct 1598 ms 16204 KB Output is correct
16 Correct 1693 ms 16204 KB Output is correct
17 Correct 1625 ms 16204 KB Output is correct
18 Correct 1468 ms 17360 KB Output is correct
19 Correct 1437 ms 17360 KB Output is correct
20 Correct 1567 ms 17360 KB Output is correct
21 Correct 1581 ms 17360 KB Output is correct
22 Correct 1549 ms 30944 KB Output is correct
23 Correct 1875 ms 43668 KB Output is correct
24 Correct 1882 ms 57224 KB Output is correct
25 Correct 1698 ms 65536 KB Output is correct
26 Correct 1929 ms 65536 KB Output is correct
27 Correct 1850 ms 65536 KB Output is correct
28 Correct 1491 ms 65536 KB Output is correct
29 Correct 1510 ms 65536 KB Output is correct
30 Correct 1611 ms 65536 KB Output is correct
31 Correct 1846 ms 65536 KB Output is correct
32 Execution timed out 2040 ms 65536 KB Time limit exceeded
33 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 404 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct
11 Correct 176 ms 65536 KB Output is correct
12 Correct 150 ms 65536 KB Output is correct
13 Correct 188 ms 65536 KB Output is correct
14 Correct 277 ms 65536 KB Output is correct
15 Correct 168 ms 65536 KB Output is correct
16 Correct 251 ms 65536 KB Output is correct
17 Correct 224 ms 65536 KB Output is correct
18 Correct 140 ms 65536 KB Output is correct
19 Correct 151 ms 65536 KB Output is correct
20 Correct 171 ms 65536 KB Output is correct
21 Correct 214 ms 65536 KB Output is correct
22 Correct 283 ms 65536 KB Output is correct
23 Correct 182 ms 65536 KB Output is correct
24 Correct 210 ms 65536 KB Output is correct
25 Correct 235 ms 65536 KB Output is correct
26 Correct 149 ms 65536 KB Output is correct
27 Correct 145 ms 65536 KB Output is correct
28 Correct 142 ms 65536 KB Output is correct
29 Correct 174 ms 65536 KB Output is correct
30 Correct 205 ms 65536 KB Output is correct
31 Correct 160 ms 65536 KB Output is correct
32 Correct 275 ms 65536 KB Output is correct
33 Correct 222 ms 65536 KB Output is correct
34 Correct 137 ms 65536 KB Output is correct
35 Correct 200 ms 65536 KB Output is correct
36 Correct 196 ms 65536 KB Output is correct
37 Correct 199 ms 65536 KB Output is correct
38 Correct 218 ms 65536 KB Output is correct
39 Correct 210 ms 65536 KB Output is correct
40 Correct 198 ms 65536 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 404 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 4 ms 492 KB Output is correct
11 Correct 1583 ms 5272 KB Output is correct
12 Correct 1488 ms 15496 KB Output is correct
13 Correct 1628 ms 15496 KB Output is correct
14 Correct 1614 ms 15496 KB Output is correct
15 Correct 1598 ms 16204 KB Output is correct
16 Correct 1693 ms 16204 KB Output is correct
17 Correct 1625 ms 16204 KB Output is correct
18 Correct 1468 ms 17360 KB Output is correct
19 Correct 1437 ms 17360 KB Output is correct
20 Correct 1567 ms 17360 KB Output is correct
21 Correct 1581 ms 17360 KB Output is correct
22 Correct 1549 ms 30944 KB Output is correct
23 Correct 1875 ms 43668 KB Output is correct
24 Correct 1882 ms 57224 KB Output is correct
25 Correct 1698 ms 65536 KB Output is correct
26 Correct 1929 ms 65536 KB Output is correct
27 Correct 1850 ms 65536 KB Output is correct
28 Correct 1491 ms 65536 KB Output is correct
29 Correct 1510 ms 65536 KB Output is correct
30 Correct 1611 ms 65536 KB Output is correct
31 Correct 1846 ms 65536 KB Output is correct
32 Execution timed out 2040 ms 65536 KB Time limit exceeded
33 Halted 0 ms 0 KB -