oj.uz

Submission #49493

# Submission time Handle Problem Language Result Execution time Memory
49493 2018-05-29T18:24:55 Z RezwanArefin01 Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 65536 KB 
    #pragma GCC optimize("Ofast")
    #pragma GCC optimize ("unroll-loops")
    #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
     
    #include <bits/stdc++.h>
    using namespace std;
     
    typedef long long ll;
    typedef pair<int, int> ii; 
     
    int dp[1 << 20], dp2[1 << 20]; ll 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:84:32: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type 'int' [-Wformat=]
        printf("%lld\n", dp[num]);
                         ~~~~~~~^
snake_escaping.cpp:57:11: 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:58:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf(" %s", b);
      ~~~~~^~~~~~~~~~
snake_escaping.cpp:72:12: 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 10 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 4 ms 568 KB Output is correct
5 Correct 3 ms 568 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 3 ms 656 KB Output is correct
8 Correct 2 ms 816 KB Output is correct
9 Correct 2 ms 816 KB Output is correct
10 Correct 3 ms 816 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 4 ms 568 KB Output is correct
5 Correct 3 ms 568 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 3 ms 656 KB Output is correct
8 Correct 2 ms 816 KB Output is correct
9 Correct 2 ms 816 KB Output is correct
10 Correct 3 ms 816 KB Output is correct
11 Correct 384 ms 15396 KB Output is correct
12 Correct 302 ms 26040 KB Output is correct
13 Correct 407 ms 35888 KB Output is correct
14 Correct 398 ms 46896 KB Output is correct
15 Correct 450 ms 58676 KB Output is correct
16 Correct 500 ms 65536 KB Output is correct
17 Correct 439 ms 65536 KB Output is correct
18 Correct 249 ms 65536 KB Output is correct
19 Correct 222 ms 65536 KB Output is correct
20 Correct 327 ms 65536 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 4 ms 568 KB Output is correct
5 Correct 3 ms 568 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 3 ms 656 KB Output is correct
8 Correct 2 ms 816 KB Output is correct
9 Correct 2 ms 816 KB Output is correct
10 Correct 3 ms 816 KB Output is correct
11 Correct 384 ms 15396 KB Output is correct
12 Correct 302 ms 26040 KB Output is correct
13 Correct 407 ms 35888 KB Output is correct
14 Correct 398 ms 46896 KB Output is correct
15 Correct 450 ms 58676 KB Output is correct
16 Correct 500 ms 65536 KB Output is correct
17 Correct 439 ms 65536 KB Output is correct
18 Correct 249 ms 65536 KB Output is correct
19 Correct 222 ms 65536 KB Output is correct
20 Correct 327 ms 65536 KB Output is correct
21 Correct 481 ms 65536 KB Output is correct
22 Correct 339 ms 65536 KB Output is correct
23 Correct 602 ms 65536 KB Output is correct
24 Correct 627 ms 65536 KB Output is correct
25 Correct 590 ms 65536 KB Output is correct
26 Correct 824 ms 65536 KB Output is correct
27 Correct 752 ms 65536 KB Output is correct
28 Correct 399 ms 65536 KB Output is correct
29 Correct 296 ms 65536 KB Output is correct
30 Correct 490 ms 65536 KB Output is correct
31 Correct 704 ms 65536 KB Output is correct
32 Correct 1133 ms 65536 KB Output is correct
33 Correct 581 ms 65536 KB Output is correct
34 Correct 816 ms 65536 KB Output is correct
35 Correct 755 ms 65536 KB Output is correct
36 Correct 299 ms 65536 KB Output is correct
37 Correct 379 ms 65536 KB Output is correct
38 Correct 329 ms 65536 KB Output is correct
39 Correct 603 ms 65536 KB Output is correct
40 Correct 630 ms 65536 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 4 ms 568 KB Output is correct
5 Correct 3 ms 568 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 3 ms 656 KB Output is correct
8 Correct 2 ms 816 KB Output is correct
9 Correct 2 ms 816 KB Output is correct
10 Correct 3 ms 816 KB Output is correct
11 Correct 110 ms 65536 KB Output is correct
12 Correct 110 ms 65536 KB Output is correct
13 Correct 153 ms 65536 KB Output is correct
14 Correct 256 ms 65536 KB Output is correct
15 Correct 161 ms 65536 KB Output is correct
16 Correct 163 ms 65536 KB Output is correct
17 Correct 188 ms 65536 KB Output is correct
18 Correct 81 ms 65536 KB Output is correct
19 Correct 81 ms 65536 KB Output is correct
20 Correct 92 ms 65536 KB Output is correct
21 Correct 117 ms 65536 KB Output is correct
22 Correct 277 ms 65536 KB Output is correct
23 Correct 149 ms 65536 KB Output is correct
24 Correct 176 ms 65536 KB Output is correct
25 Correct 166 ms 65536 KB Output is correct
26 Correct 165 ms 65536 KB Output is correct
27 Correct 113 ms 65536 KB Output is correct
28 Correct 82 ms 65536 KB Output is correct
29 Correct 123 ms 65536 KB Output is correct
30 Correct 161 ms 65536 KB Output is correct
31 Correct 110 ms 65536 KB Output is correct
32 Correct 218 ms 65536 KB Output is correct
33 Correct 168 ms 65536 KB Output is correct
34 Correct 75 ms 65536 KB Output is correct
35 Correct 165 ms 65536 KB Output is correct
36 Correct 145 ms 65536 KB Output is correct
37 Correct 138 ms 65536 KB Output is correct
38 Correct 152 ms 65536 KB Output is correct
39 Correct 147 ms 65536 KB Output is correct
40 Correct 164 ms 65536 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 568 KB Output is correct
4 Correct 4 ms 568 KB Output is correct
5 Correct 3 ms 568 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 3 ms 656 KB Output is correct
8 Correct 2 ms 816 KB Output is correct
9 Correct 2 ms 816 KB Output is correct
10 Correct 3 ms 816 KB Output is correct
11 Correct 384 ms 15396 KB Output is correct
12 Correct 302 ms 26040 KB Output is correct
13 Correct 407 ms 35888 KB Output is correct
14 Correct 398 ms 46896 KB Output is correct
15 Correct 450 ms 58676 KB Output is correct
16 Correct 500 ms 65536 KB Output is correct
17 Correct 439 ms 65536 KB Output is correct
18 Correct 249 ms 65536 KB Output is correct
19 Correct 222 ms 65536 KB Output is correct
20 Correct 327 ms 65536 KB Output is correct
21 Correct 481 ms 65536 KB Output is correct
22 Correct 339 ms 65536 KB Output is correct
23 Correct 602 ms 65536 KB Output is correct
24 Correct 627 ms 65536 KB Output is correct
25 Correct 590 ms 65536 KB Output is correct
26 Correct 824 ms 65536 KB Output is correct
27 Correct 752 ms 65536 KB Output is correct
28 Correct 399 ms 65536 KB Output is correct
29 Correct 296 ms 65536 KB Output is correct
30 Correct 490 ms 65536 KB Output is correct
31 Correct 704 ms 65536 KB Output is correct
32 Correct 1133 ms 65536 KB Output is correct
33 Correct 581 ms 65536 KB Output is correct
34 Correct 816 ms 65536 KB Output is correct
35 Correct 755 ms 65536 KB Output is correct
36 Correct 299 ms 65536 KB Output is correct
37 Correct 379 ms 65536 KB Output is correct
38 Correct 329 ms 65536 KB Output is correct
39 Correct 603 ms 65536 KB Output is correct
40 Correct 630 ms 65536 KB Output is correct
41 Correct 110 ms 65536 KB Output is correct
42 Correct 110 ms 65536 KB Output is correct
43 Correct 153 ms 65536 KB Output is correct
44 Correct 256 ms 65536 KB Output is correct
45 Correct 161 ms 65536 KB Output is correct
46 Correct 163 ms 65536 KB Output is correct
47 Correct 188 ms 65536 KB Output is correct
48 Correct 81 ms 65536 KB Output is correct
49 Correct 81 ms 65536 KB Output is correct
50 Correct 92 ms 65536 KB Output is correct
51 Correct 117 ms 65536 KB Output is correct
52 Correct 277 ms 65536 KB Output is correct
53 Correct 149 ms 65536 KB Output is correct
54 Correct 176 ms 65536 KB Output is correct
55 Correct 166 ms 65536 KB Output is correct
56 Correct 165 ms 65536 KB Output is correct
57 Correct 113 ms 65536 KB Output is correct
58 Correct 82 ms 65536 KB Output is correct
59 Correct 123 ms 65536 KB Output is correct
60 Correct 161 ms 65536 KB Output is correct
61 Correct 110 ms 65536 KB Output is correct
62 Correct 218 ms 65536 KB Output is correct
63 Correct 168 ms 65536 KB Output is correct
64 Correct 75 ms 65536 KB Output is correct
65 Correct 165 ms 65536 KB Output is correct
66 Correct 145 ms 65536 KB Output is correct
67 Correct 138 ms 65536 KB Output is correct
68 Correct 152 ms 65536 KB Output is correct
69 Correct 147 ms 65536 KB Output is correct
70 Correct 164 ms 65536 KB Output is correct
71 Correct 711 ms 65536 KB Output is correct
72 Correct 535 ms 65536 KB Output is correct
73 Correct 1355 ms 65536 KB Output is correct
74 Execution timed out 2072 ms 65536 KB Time limit exceeded
75 Halted 0 ms 0 KB -