oj.uz

Submission #535333

# Submission time Handle Problem Language Result Execution time Memory
535333 2022-03-10T03:33:28 Z amunduzbaev Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 851 ms 65536 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
 
const int N = 20;
int dp[2][1 << N ][N];
int a[1 << N];
 
signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m; cin>>n>>m;
	for(int i=0;i<(1 << n);i++){
		char c; cin>>c;
		a[i] = c - '0';
	}
	for(int mask=(1 << n) - 1;~mask;mask--){
		int res = a[mask];
		for(int i=n-1;~i;i--){
			if(!(mask >> i & 1)){
				res += dp[0][mask | (1 << i)][i];
			}
			dp[0][mask][i] = res;
		}
	}
	
	for(int mask=0;mask<(1 << n);mask++){
		int res = a[mask];
		for(int i=n-1;~i;i--){
			if(mask >> i & 1){
				res += dp[1][mask ^ (1 << i)][i];
			}
			dp[1][mask][i] = res;
		}
	}
	
	ar<int, 3> c {};
	int res, in, t;
	vector<int> p;
	while(m--){
		string s; cin>>s;
		reverse(s.begin(), s.end());
		c[0] = c[1] = c[2] = 0;
		for(int i=0;i<n;i++){
			if(s[i] == '0') c[0]++;
			if(s[i] == '1') c[1]++;
			if(s[i] == '?') c[2]++;
		}
		
		res = 0; p.clear();
		if(c[2] <= 6){
			in = 0;
			for(int i=0;i<n;i++){
				if(s[i] == '0' || s[i] == '1') in |= ((s[i] - '0') << i);
				else p.push_back(i);
			}
			
			for(int mask=0;mask < (1 << c[2]);mask++){
				int tot = in;
				for(int j=0;j<c[2];j++){
					if(mask >> j & 1) tot |= (1 << p[j]);
				}
				
				res += a[tot];
			}
		} 
		else if(c[0] <= 6) {
			t = 0, in = 0;
			for(int i=0;i<n;i++){
				if(s[i] == '1') in |= (1 << i);
				if(s[i] == '0') p.push_back(i);
			}
			
			for(int mask=0;mask < (1 << c[0]);mask++){
				int tot = in;
				for(int j=0;j<c[0];j++){
					if(mask >> j & 1) tot |= (1 << p[j]);
				}
				
				if(__builtin_popcount(mask)&1) res -= dp[t][tot][0];
				else res += dp[t][tot][0];
			}
		} else {
			t = 1, in = (1 << n) - 1;
			for(int i=0;i<n;i++){
				if(s[i] == '0') in ^= (1 << i);
				if(s[i] == '1') p.push_back(i);
			}
			
			for(int mask=0;mask<(1 << c[1]);mask++){
				int tot = in;
				for(int j=0;j<c[1];j++){
					if(mask >> j & 1) tot ^= (1 << p[j]);
				}
				
				if(__builtin_popcount(mask)&1) res -= dp[t][tot][0];
				else res += dp[t][tot][0];
			}
		}
		
		cout<<res<<"\n";
	}
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 409 ms 4556 KB Output is correct
12 Correct 453 ms 4152 KB Output is correct
13 Correct 304 ms 3336 KB Output is correct
14 Correct 282 ms 3660 KB Output is correct
15 Correct 756 ms 4540 KB Output is correct
16 Correct 387 ms 3576 KB Output is correct
17 Correct 386 ms 3660 KB Output is correct
18 Correct 164 ms 5420 KB Output is correct
19 Correct 194 ms 2400 KB Output is correct
20 Correct 459 ms 4104 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 409 ms 4556 KB Output is correct
12 Correct 453 ms 4152 KB Output is correct
13 Correct 304 ms 3336 KB Output is correct
14 Correct 282 ms 3660 KB Output is correct
15 Correct 756 ms 4540 KB Output is correct
16 Correct 387 ms 3576 KB Output is correct
17 Correct 386 ms 3660 KB Output is correct
18 Correct 164 ms 5420 KB Output is correct
19 Correct 194 ms 2400 KB Output is correct
20 Correct 459 ms 4104 KB Output is correct
21 Correct 277 ms 5624 KB Output is correct
22 Correct 692 ms 5848 KB Output is correct
23 Correct 465 ms 4812 KB Output is correct
24 Correct 386 ms 4596 KB Output is correct
25 Correct 367 ms 6720 KB Output is correct
26 Correct 540 ms 5332 KB Output is correct
27 Correct 515 ms 5320 KB Output is correct
28 Correct 178 ms 7592 KB Output is correct
29 Correct 228 ms 3556 KB Output is correct
30 Correct 475 ms 5752 KB Output is correct
31 Correct 851 ms 5708 KB Output is correct
32 Correct 515 ms 5684 KB Output is correct
33 Correct 321 ms 4620 KB Output is correct
34 Correct 402 ms 4712 KB Output is correct
35 Correct 510 ms 5044 KB Output is correct
36 Correct 187 ms 3700 KB Output is correct
37 Correct 781 ms 5708 KB Output is correct
38 Correct 244 ms 3548 KB Output is correct
39 Correct 429 ms 4840 KB Output is correct
40 Correct 388 ms 4652 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Runtime error 71 ms 65536 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 409 ms 4556 KB Output is correct
12 Correct 453 ms 4152 KB Output is correct
13 Correct 304 ms 3336 KB Output is correct
14 Correct 282 ms 3660 KB Output is correct
15 Correct 756 ms 4540 KB Output is correct
16 Correct 387 ms 3576 KB Output is correct
17 Correct 386 ms 3660 KB Output is correct
18 Correct 164 ms 5420 KB Output is correct
19 Correct 194 ms 2400 KB Output is correct
20 Correct 459 ms 4104 KB Output is correct
21 Correct 277 ms 5624 KB Output is correct
22 Correct 692 ms 5848 KB Output is correct
23 Correct 465 ms 4812 KB Output is correct
24 Correct 386 ms 4596 KB Output is correct
25 Correct 367 ms 6720 KB Output is correct
26 Correct 540 ms 5332 KB Output is correct
27 Correct 515 ms 5320 KB Output is correct
28 Correct 178 ms 7592 KB Output is correct
29 Correct 228 ms 3556 KB Output is correct
30 Correct 475 ms 5752 KB Output is correct
31 Correct 851 ms 5708 KB Output is correct
32 Correct 515 ms 5684 KB Output is correct
33 Correct 321 ms 4620 KB Output is correct
34 Correct 402 ms 4712 KB Output is correct
35 Correct 510 ms 5044 KB Output is correct
36 Correct 187 ms 3700 KB Output is correct
37 Correct 781 ms 5708 KB Output is correct
38 Correct 244 ms 3548 KB Output is correct
39 Correct 429 ms 4840 KB Output is correct
40 Correct 388 ms 4652 KB Output is correct
41 Runtime error 71 ms 65536 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -