oj.uz

Submission #42392

# Submission time Handle Problem Language Result Execution time Memory
42392 2018-02-26T16:05:51 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[]) {
#ifdef LOCAL_TESTING
	freopen("in", "r", stdin);
#endif
	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) {
			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:53: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:54:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf(" %s", b);
                 ^
snake_escaping.cpp:68: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 424 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 732 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 424 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 732 KB Output is correct
11 Correct 325 ms 5196 KB Output is correct
12 Correct 275 ms 15536 KB Output is correct
13 Correct 371 ms 15536 KB Output is correct
14 Correct 353 ms 15536 KB Output is correct
15 Correct 392 ms 16096 KB Output is correct
16 Correct 489 ms 16096 KB Output is correct
17 Correct 427 ms 16096 KB Output is correct
18 Correct 277 ms 17292 KB Output is correct
19 Correct 210 ms 17292 KB Output is correct
20 Correct 325 ms 17292 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 424 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 732 KB Output is correct
11 Correct 325 ms 5196 KB Output is correct
12 Correct 275 ms 15536 KB Output is correct
13 Correct 371 ms 15536 KB Output is correct
14 Correct 353 ms 15536 KB Output is correct
15 Correct 392 ms 16096 KB Output is correct
16 Correct 489 ms 16096 KB Output is correct
17 Correct 427 ms 16096 KB Output is correct
18 Correct 277 ms 17292 KB Output is correct
19 Correct 210 ms 17292 KB Output is correct
20 Correct 325 ms 17292 KB Output is correct
21 Correct 385 ms 17292 KB Output is correct
22 Correct 316 ms 31000 KB Output is correct
23 Correct 684 ms 43608 KB Output is correct
24 Correct 662 ms 57140 KB Output is correct
25 Correct 535 ms 59980 KB Output is correct
26 Correct 736 ms 59980 KB Output is correct
27 Correct 661 ms 59980 KB Output is correct
28 Correct 337 ms 60828 KB Output is correct
29 Correct 243 ms 60828 KB Output is correct
30 Correct 409 ms 60828 KB Output is correct
31 Correct 689 ms 60828 KB Output is correct
32 Correct 990 ms 60828 KB Output is correct
33 Correct 446 ms 60828 KB Output is correct
34 Correct 693 ms 60828 KB Output is correct
35 Correct 663 ms 60828 KB Output is correct
36 Correct 263 ms 60828 KB Output is correct
37 Correct 306 ms 60828 KB Output is correct
38 Correct 264 ms 60828 KB Output is correct
39 Correct 600 ms 60828 KB Output is correct
40 Correct 648 ms 60828 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 424 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 732 KB Output is correct
11 Correct 105 ms 65536 KB Output is correct
12 Correct 97 ms 65536 KB Output is correct
13 Correct 137 ms 65536 KB Output is correct
14 Correct 237 ms 65536 KB Output is correct
15 Correct 118 ms 65536 KB Output is correct
16 Correct 196 ms 65536 KB Output is correct
17 Correct 163 ms 65536 KB Output is correct
18 Correct 91 ms 65536 KB Output is correct
19 Correct 88 ms 65536 KB Output is correct
20 Correct 102 ms 65536 KB Output is correct
21 Correct 150 ms 65536 KB Output is correct
22 Correct 224 ms 65536 KB Output is correct
23 Correct 128 ms 65536 KB Output is correct
24 Correct 166 ms 65536 KB Output is correct
25 Correct 167 ms 65536 KB Output is correct
26 Correct 106 ms 65536 KB Output is correct
27 Correct 93 ms 65536 KB Output is correct
28 Correct 86 ms 65536 KB Output is correct
29 Correct 132 ms 65536 KB Output is correct
30 Correct 167 ms 65536 KB Output is correct
31 Correct 120 ms 65536 KB Output is correct
32 Correct 220 ms 65536 KB Output is correct
33 Correct 167 ms 65536 KB Output is correct
34 Correct 87 ms 65536 KB Output is correct
35 Correct 141 ms 65536 KB Output is correct
36 Correct 142 ms 65536 KB Output is correct
37 Correct 144 ms 65536 KB Output is correct
38 Correct 147 ms 65536 KB Output is correct
39 Correct 150 ms 65536 KB Output is correct
40 Correct 146 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 424 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 548 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 732 KB Output is correct
11 Correct 325 ms 5196 KB Output is correct
12 Correct 275 ms 15536 KB Output is correct
13 Correct 371 ms 15536 KB Output is correct
14 Correct 353 ms 15536 KB Output is correct
15 Correct 392 ms 16096 KB Output is correct
16 Correct 489 ms 16096 KB Output is correct
17 Correct 427 ms 16096 KB Output is correct
18 Correct 277 ms 17292 KB Output is correct
19 Correct 210 ms 17292 KB Output is correct
20 Correct 325 ms 17292 KB Output is correct
21 Correct 385 ms 17292 KB Output is correct
22 Correct 316 ms 31000 KB Output is correct
23 Correct 684 ms 43608 KB Output is correct
24 Correct 662 ms 57140 KB Output is correct
25 Correct 535 ms 59980 KB Output is correct
26 Correct 736 ms 59980 KB Output is correct
27 Correct 661 ms 59980 KB Output is correct
28 Correct 337 ms 60828 KB Output is correct
29 Correct 243 ms 60828 KB Output is correct
30 Correct 409 ms 60828 KB Output is correct
31 Correct 689 ms 60828 KB Output is correct
32 Correct 990 ms 60828 KB Output is correct
33 Correct 446 ms 60828 KB Output is correct
34 Correct 693 ms 60828 KB Output is correct
35 Correct 663 ms 60828 KB Output is correct
36 Correct 263 ms 60828 KB Output is correct
37 Correct 306 ms 60828 KB Output is correct
38 Correct 264 ms 60828 KB Output is correct
39 Correct 600 ms 60828 KB Output is correct
40 Correct 648 ms 60828 KB Output is correct
41 Correct 105 ms 65536 KB Output is correct
42 Correct 97 ms 65536 KB Output is correct
43 Correct 137 ms 65536 KB Output is correct
44 Correct 237 ms 65536 KB Output is correct
45 Correct 118 ms 65536 KB Output is correct
46 Correct 196 ms 65536 KB Output is correct
47 Correct 163 ms 65536 KB Output is correct
48 Correct 91 ms 65536 KB Output is correct
49 Correct 88 ms 65536 KB Output is correct
50 Correct 102 ms 65536 KB Output is correct
51 Correct 150 ms 65536 KB Output is correct
52 Correct 224 ms 65536 KB Output is correct
53 Correct 128 ms 65536 KB Output is correct
54 Correct 166 ms 65536 KB Output is correct
55 Correct 167 ms 65536 KB Output is correct
56 Correct 106 ms 65536 KB Output is correct
57 Correct 93 ms 65536 KB Output is correct
58 Correct 86 ms 65536 KB Output is correct
59 Correct 132 ms 65536 KB Output is correct
60 Correct 167 ms 65536 KB Output is correct
61 Correct 120 ms 65536 KB Output is correct
62 Correct 220 ms 65536 KB Output is correct
63 Correct 167 ms 65536 KB Output is correct
64 Correct 87 ms 65536 KB Output is correct
65 Correct 141 ms 65536 KB Output is correct
66 Correct 142 ms 65536 KB Output is correct
67 Correct 144 ms 65536 KB Output is correct
68 Correct 147 ms 65536 KB Output is correct
69 Correct 150 ms 65536 KB Output is correct
70 Correct 146 ms 65536 KB Output is correct
71 Correct 717 ms 65536 KB Output is correct
72 Correct 570 ms 65536 KB Output is correct
73 Correct 1239 ms 65536 KB Output is correct
74 Execution timed out 2055 ms 65536 KB Time limit exceeded
75 Halted 0 ms 0 KB -