oj.uz

Submission #42390

# Submission time Handle Problem Language Result Execution time Memory
42390 2018-02-26T15:56:07 Z RezwanArefin01 Snake Escaping (JOI18_snake_escaping) C++14
75 / 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; 
char b[1 << 20], s[1 << 20];
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[]) {
	scanf("%d %d", &l, &q);
	scanf(" %s", 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--) {
		scanf(" %s", s);
		int n0 = 0, n1 = 0, nw0t = 0; 
		for(int i = 0; i < l; i++) {
			n0 += s[i] == '0';
			n1 += s[i] == '1';
			nw0t += s[i] == '?';
		}

		if(n1 == 0) {
			int num = 0;
			for(int i = 0; i < l; i++) 
				num = (num << 1) + (s[i] == '?');
			printf("%lld\n", dp[num]);
		} else if(nw0t == 0) {
			int num = 0;
			for(int i = 0; i < l; i++) 
				num = (num << 1) + (s[i] == '1');
			printf("%c\n", b[num]);
		} 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);
			printf("%lld\n", ans);
		}
	}
}

Compilation message

snake_escaping.cpp: In function 'int main(int, const char**)':
snake_escaping.cpp:50:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &l, &q);
                        ^
snake_escaping.cpp:51:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf(" %s", b);
                 ^
snake_escaping.cpp:65:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %s", s);
                  ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 388 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 3 ms 628 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 2 ms 628 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 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 2 ms 376 KB Output is correct
3 Correct 2 ms 388 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 3 ms 628 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 2 ms 628 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 399 ms 5204 KB Output is correct
12 Correct 304 ms 15568 KB Output is correct
13 Correct 397 ms 15568 KB Output is correct
14 Correct 389 ms 15568 KB Output is correct
15 Correct 413 ms 16216 KB Output is correct
16 Correct 499 ms 16216 KB Output is correct
17 Correct 435 ms 16216 KB Output is correct
18 Correct 294 ms 17096 KB Output is correct
19 Correct 225 ms 17096 KB Output is correct
20 Correct 361 ms 17096 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 2 ms 376 KB Output is correct
3 Correct 2 ms 388 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 3 ms 628 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 2 ms 628 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 399 ms 5204 KB Output is correct
12 Correct 304 ms 15568 KB Output is correct
13 Correct 397 ms 15568 KB Output is correct
14 Correct 389 ms 15568 KB Output is correct
15 Correct 413 ms 16216 KB Output is correct
16 Correct 499 ms 16216 KB Output is correct
17 Correct 435 ms 16216 KB Output is correct
18 Correct 294 ms 17096 KB Output is correct
19 Correct 225 ms 17096 KB Output is correct
20 Correct 361 ms 17096 KB Output is correct
21 Correct 429 ms 17188 KB Output is correct
22 Correct 335 ms 30792 KB Output is correct
23 Correct 594 ms 43544 KB Output is correct
24 Correct 669 ms 57080 KB Output is correct
25 Correct 559 ms 60008 KB Output is correct
26 Correct 748 ms 60008 KB Output is correct
27 Correct 661 ms 60008 KB Output is correct
28 Correct 320 ms 60956 KB Output is correct
29 Correct 270 ms 60956 KB Output is correct
30 Correct 452 ms 60956 KB Output is correct
31 Correct 662 ms 60956 KB Output is correct
32 Correct 1034 ms 60956 KB Output is correct
33 Correct 476 ms 60956 KB Output is correct
34 Correct 777 ms 60956 KB Output is correct
35 Correct 659 ms 60956 KB Output is correct
36 Correct 247 ms 60956 KB Output is correct
37 Correct 303 ms 60956 KB Output is correct
38 Correct 245 ms 60956 KB Output is correct
39 Correct 573 ms 60956 KB Output is correct
40 Correct 636 ms 60956 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 2 ms 376 KB Output is correct
3 Correct 2 ms 388 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 3 ms 628 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 2 ms 628 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 99 ms 65536 KB Output is correct
12 Correct 112 ms 65536 KB Output is correct
13 Correct 122 ms 65536 KB Output is correct
14 Correct 231 ms 65536 KB Output is correct
15 Correct 128 ms 65536 KB Output is correct
16 Correct 202 ms 65536 KB Output is correct
17 Correct 158 ms 65536 KB Output is correct
18 Correct 92 ms 65536 KB Output is correct
19 Correct 81 ms 65536 KB Output is correct
20 Correct 96 ms 65536 KB Output is correct
21 Correct 160 ms 65536 KB Output is correct
22 Correct 208 ms 65536 KB Output is correct
23 Correct 108 ms 65536 KB Output is correct
24 Correct 158 ms 65536 KB Output is correct
25 Correct 159 ms 65536 KB Output is correct
26 Correct 93 ms 65536 KB Output is correct
27 Correct 101 ms 65536 KB Output is correct
28 Correct 84 ms 65536 KB Output is correct
29 Correct 132 ms 65536 KB Output is correct
30 Correct 170 ms 65536 KB Output is correct
31 Correct 126 ms 65536 KB Output is correct
32 Correct 194 ms 65536 KB Output is correct
33 Correct 202 ms 65536 KB Output is correct
34 Correct 86 ms 65536 KB Output is correct
35 Correct 134 ms 65536 KB Output is correct
36 Correct 135 ms 65536 KB Output is correct
37 Correct 137 ms 65536 KB Output is correct
38 Correct 170 ms 65536 KB Output is correct
39 Correct 133 ms 65536 KB Output is correct
40 Correct 131 ms 65536 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 2 ms 376 KB Output is correct
3 Correct 2 ms 388 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 3 ms 628 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 2 ms 628 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 399 ms 5204 KB Output is correct
12 Correct 304 ms 15568 KB Output is correct
13 Correct 397 ms 15568 KB Output is correct
14 Correct 389 ms 15568 KB Output is correct
15 Correct 413 ms 16216 KB Output is correct
16 Correct 499 ms 16216 KB Output is correct
17 Correct 435 ms 16216 KB Output is correct
18 Correct 294 ms 17096 KB Output is correct
19 Correct 225 ms 17096 KB Output is correct
20 Correct 361 ms 17096 KB Output is correct
21 Correct 429 ms 17188 KB Output is correct
22 Correct 335 ms 30792 KB Output is correct
23 Correct 594 ms 43544 KB Output is correct
24 Correct 669 ms 57080 KB Output is correct
25 Correct 559 ms 60008 KB Output is correct
26 Correct 748 ms 60008 KB Output is correct
27 Correct 661 ms 60008 KB Output is correct
28 Correct 320 ms 60956 KB Output is correct
29 Correct 270 ms 60956 KB Output is correct
30 Correct 452 ms 60956 KB Output is correct
31 Correct 662 ms 60956 KB Output is correct
32 Correct 1034 ms 60956 KB Output is correct
33 Correct 476 ms 60956 KB Output is correct
34 Correct 777 ms 60956 KB Output is correct
35 Correct 659 ms 60956 KB Output is correct
36 Correct 247 ms 60956 KB Output is correct
37 Correct 303 ms 60956 KB Output is correct
38 Correct 245 ms 60956 KB Output is correct
39 Correct 573 ms 60956 KB Output is correct
40 Correct 636 ms 60956 KB Output is correct
41 Correct 99 ms 65536 KB Output is correct
42 Correct 112 ms 65536 KB Output is correct
43 Correct 122 ms 65536 KB Output is correct
44 Correct 231 ms 65536 KB Output is correct
45 Correct 128 ms 65536 KB Output is correct
46 Correct 202 ms 65536 KB Output is correct
47 Correct 158 ms 65536 KB Output is correct
48 Correct 92 ms 65536 KB Output is correct
49 Correct 81 ms 65536 KB Output is correct
50 Correct 96 ms 65536 KB Output is correct
51 Correct 160 ms 65536 KB Output is correct
52 Correct 208 ms 65536 KB Output is correct
53 Correct 108 ms 65536 KB Output is correct
54 Correct 158 ms 65536 KB Output is correct
55 Correct 159 ms 65536 KB Output is correct
56 Correct 93 ms 65536 KB Output is correct
57 Correct 101 ms 65536 KB Output is correct
58 Correct 84 ms 65536 KB Output is correct
59 Correct 132 ms 65536 KB Output is correct
60 Correct 170 ms 65536 KB Output is correct
61 Correct 126 ms 65536 KB Output is correct
62 Correct 194 ms 65536 KB Output is correct
63 Correct 202 ms 65536 KB Output is correct
64 Correct 86 ms 65536 KB Output is correct
65 Correct 134 ms 65536 KB Output is correct
66 Correct 135 ms 65536 KB Output is correct
67 Correct 137 ms 65536 KB Output is correct
68 Correct 170 ms 65536 KB Output is correct
69 Correct 133 ms 65536 KB Output is correct
70 Correct 131 ms 65536 KB Output is correct
71 Correct 646 ms 65536 KB Output is correct
72 Correct 578 ms 65536 KB Output is correct
73 Correct 1209 ms 65536 KB Output is correct
74 Execution timed out 2048 ms 65536 KB Time limit exceeded
75 Halted 0 ms 0 KB -