oj.uz

Submission #68751

# Submission time Handle Problem Language Result Execution time Memory
68751 2018-08-18T10:25:21 Z tmwilliamlin168 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 20184 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxL=20, mxQ=1e6;
int l, q, dp[2][1<<mxL];
string s;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> l >> q >> s;
	for(int j=0; j<2; ++j) {
		for(int i=0; i<1<<l; ++i)
			dp[j][i]=s[i]-'0';
		for(int k=0; k<l; ++k)
			for(int i=0; i<1<<l; ++i)
				if(i>>k&1^j)
					dp[j][i]+=dp[j][i^1<<k];
	}
	while(q--) {
		string t;
		cin >> t;
		int na=0, nb=0, nc=0, ma=0, mb=0, mc=0, ans=0;
		for(int i=0; i<l; ++i) {
			if(t[i]=='0') {
				++na;
				ma|=1<<(l-1-i);
			} else if(t[i]=='1') {
				++nb;
				mb|=1<<(l-1-i);
			} else {
				++nc;
				mc|=1<<(l-1-i);
			}
		}
		if(na<nc||nb<nc) {
			bool sw=0;
			if(nb>na) {
				swap(nb, na);
				swap(mb, ma);
				sw=1;
			}
			for(int i=mb; ; i=(i-1)&mb) {
				ans+=dp[sw][(sw?(1<<l)-1:0)^i^mb^mc]*(__builtin_popcount(i)&1?-1:1);
				if(!i)
					break;
			}
		} else {
			for(int i=mc; ; i=(i-1)&mc) {
				ans+=s[i|mb]-'0';
				if(!i)
					break;
			}
		}
		cout << ans << "\n";
	}
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:18:12: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
     if(i>>k&1^j)
        ~~~~^~

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 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 608 KB Output is correct
10 Correct 3 ms 760 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 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 608 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 279 ms 5668 KB Output is correct
12 Correct 264 ms 5668 KB Output is correct
13 Correct 283 ms 5668 KB Output is correct
14 Correct 272 ms 5668 KB Output is correct
15 Correct 281 ms 6008 KB Output is correct
16 Correct 331 ms 6008 KB Output is correct
17 Correct 368 ms 6136 KB Output is correct
18 Correct 203 ms 8280 KB Output is correct
19 Correct 259 ms 8280 KB Output is correct
20 Correct 253 ms 8280 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 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 608 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 279 ms 5668 KB Output is correct
12 Correct 264 ms 5668 KB Output is correct
13 Correct 283 ms 5668 KB Output is correct
14 Correct 272 ms 5668 KB Output is correct
15 Correct 281 ms 6008 KB Output is correct
16 Correct 331 ms 6008 KB Output is correct
17 Correct 368 ms 6136 KB Output is correct
18 Correct 203 ms 8280 KB Output is correct
19 Correct 259 ms 8280 KB Output is correct
20 Correct 253 ms 8280 KB Output is correct
21 Correct 277 ms 8280 KB Output is correct
22 Correct 285 ms 8280 KB Output is correct
23 Correct 338 ms 8280 KB Output is correct
24 Correct 327 ms 8280 KB Output is correct
25 Correct 295 ms 8280 KB Output is correct
26 Correct 353 ms 8280 KB Output is correct
27 Correct 340 ms 8280 KB Output is correct
28 Correct 218 ms 9972 KB Output is correct
29 Correct 283 ms 9972 KB Output is correct
30 Correct 303 ms 9972 KB Output is correct
31 Correct 337 ms 9972 KB Output is correct
32 Correct 429 ms 9972 KB Output is correct
33 Correct 289 ms 9972 KB Output is correct
34 Correct 338 ms 9972 KB Output is correct
35 Correct 392 ms 9972 KB Output is correct
36 Correct 218 ms 9972 KB Output is correct
37 Correct 305 ms 9972 KB Output is correct
38 Correct 280 ms 9972 KB Output is correct
39 Correct 315 ms 9972 KB Output is correct
40 Correct 335 ms 9972 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 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 608 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 109 ms 14168 KB Output is correct
12 Correct 117 ms 14300 KB Output is correct
13 Correct 117 ms 14348 KB Output is correct
14 Correct 159 ms 14348 KB Output is correct
15 Correct 110 ms 14348 KB Output is correct
16 Correct 158 ms 14348 KB Output is correct
17 Correct 160 ms 14348 KB Output is correct
18 Correct 119 ms 14428 KB Output is correct
19 Correct 130 ms 14428 KB Output is correct
20 Correct 131 ms 14428 KB Output is correct
21 Correct 157 ms 14428 KB Output is correct
22 Correct 280 ms 14428 KB Output is correct
23 Correct 131 ms 14428 KB Output is correct
24 Correct 150 ms 14428 KB Output is correct
25 Correct 188 ms 14428 KB Output is correct
26 Correct 136 ms 14428 KB Output is correct
27 Correct 145 ms 14428 KB Output is correct
28 Correct 131 ms 14428 KB Output is correct
29 Correct 146 ms 14428 KB Output is correct
30 Correct 150 ms 14428 KB Output is correct
31 Correct 143 ms 14428 KB Output is correct
32 Correct 193 ms 14428 KB Output is correct
33 Correct 193 ms 14428 KB Output is correct
34 Correct 135 ms 14428 KB Output is correct
35 Correct 165 ms 14428 KB Output is correct
36 Correct 162 ms 14428 KB Output is correct
37 Correct 168 ms 14428 KB Output is correct
38 Correct 167 ms 14428 KB Output is correct
39 Correct 155 ms 14428 KB Output is correct
40 Correct 187 ms 14428 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 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 2 ms 484 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 608 KB Output is correct
9 Correct 2 ms 608 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 279 ms 5668 KB Output is correct
12 Correct 264 ms 5668 KB Output is correct
13 Correct 283 ms 5668 KB Output is correct
14 Correct 272 ms 5668 KB Output is correct
15 Correct 281 ms 6008 KB Output is correct
16 Correct 331 ms 6008 KB Output is correct
17 Correct 368 ms 6136 KB Output is correct
18 Correct 203 ms 8280 KB Output is correct
19 Correct 259 ms 8280 KB Output is correct
20 Correct 253 ms 8280 KB Output is correct
21 Correct 277 ms 8280 KB Output is correct
22 Correct 285 ms 8280 KB Output is correct
23 Correct 338 ms 8280 KB Output is correct
24 Correct 327 ms 8280 KB Output is correct
25 Correct 295 ms 8280 KB Output is correct
26 Correct 353 ms 8280 KB Output is correct
27 Correct 340 ms 8280 KB Output is correct
28 Correct 218 ms 9972 KB Output is correct
29 Correct 283 ms 9972 KB Output is correct
30 Correct 303 ms 9972 KB Output is correct
31 Correct 337 ms 9972 KB Output is correct
32 Correct 429 ms 9972 KB Output is correct
33 Correct 289 ms 9972 KB Output is correct
34 Correct 338 ms 9972 KB Output is correct
35 Correct 392 ms 9972 KB Output is correct
36 Correct 218 ms 9972 KB Output is correct
37 Correct 305 ms 9972 KB Output is correct
38 Correct 280 ms 9972 KB Output is correct
39 Correct 315 ms 9972 KB Output is correct
40 Correct 335 ms 9972 KB Output is correct
41 Correct 109 ms 14168 KB Output is correct
42 Correct 117 ms 14300 KB Output is correct
43 Correct 117 ms 14348 KB Output is correct
44 Correct 159 ms 14348 KB Output is correct
45 Correct 110 ms 14348 KB Output is correct
46 Correct 158 ms 14348 KB Output is correct
47 Correct 160 ms 14348 KB Output is correct
48 Correct 119 ms 14428 KB Output is correct
49 Correct 130 ms 14428 KB Output is correct
50 Correct 131 ms 14428 KB Output is correct
51 Correct 157 ms 14428 KB Output is correct
52 Correct 280 ms 14428 KB Output is correct
53 Correct 131 ms 14428 KB Output is correct
54 Correct 150 ms 14428 KB Output is correct
55 Correct 188 ms 14428 KB Output is correct
56 Correct 136 ms 14428 KB Output is correct
57 Correct 145 ms 14428 KB Output is correct
58 Correct 131 ms 14428 KB Output is correct
59 Correct 146 ms 14428 KB Output is correct
60 Correct 150 ms 14428 KB Output is correct
61 Correct 143 ms 14428 KB Output is correct
62 Correct 193 ms 14428 KB Output is correct
63 Correct 193 ms 14428 KB Output is correct
64 Correct 135 ms 14428 KB Output is correct
65 Correct 165 ms 14428 KB Output is correct
66 Correct 162 ms 14428 KB Output is correct
67 Correct 168 ms 14428 KB Output is correct
68 Correct 167 ms 14428 KB Output is correct
69 Correct 155 ms 14428 KB Output is correct
70 Correct 187 ms 14428 KB Output is correct
71 Correct 774 ms 19140 KB Output is correct
72 Correct 835 ms 20184 KB Output is correct
73 Correct 1190 ms 20184 KB Output is correct
74 Execution timed out 2071 ms 20184 KB Time limit exceeded
75 Halted 0 ms 0 KB -