Submission #1128575

#	Time	Username	Problem	Language	Result	Execution time	Memory
1128575		Alihan_8	Snake Escaping (JOI18_snake_escaping)	C++20	5 / 100	2096 ms	39492 KiB

snake_escaping

#include <bits/stdc++.h>

using namespace std;

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n, q; cin >> n >> q;
	
	string s; cin >> s;
	
	for ( auto &v: s ) v -= '0';
	
	vector <int> pw(n + 1, 1);
	
	for ( int i = 1; i <= n; i++ ){
		pw[i] = pw[i - 1] * 3;
	}
	
	int B = min(n, 7), m = n - B;
	
	vector <string> qu(q);
	vector <int> val(q);
	
	for ( int i = 0; i < q; i++ ){
		string t; cin >> t;
		
		qu[i] = t;
		
		for ( int j = 0; j < m; j++ ){
			val[i] = val[i] + pw[j] * (t[j] == '?' ? 2 : t[j] - '0');
		}
	}
	
	vector <int> f(pw[m]);
	
	for ( int mask = 0; mask < pw[m]; mask++ ){
		for ( int i = 0; i < m; i++ ){
			f[mask] = f[mask] * 2 + mask / pw[i] % 3;
		}
	}
	
	vector <int> ans(q);
	
	for ( int lf = 0; lf < (1 << B); lf++ ){
		vector <int> dp(pw[m]);
		
		for ( int mask = 0; mask < pw[m]; mask++ ){
			bool has_q = false;
			
			for ( int i = 0; i < m; i++ ){
				int b = mask / pw[i] % 3;
				
				if ( b == 2 ){
					dp[mask] = dp[mask - pw[i]] + dp[mask - pw[i] * 2];
					has_q = 1; break;
				}
			}
			
			if ( !has_q ){
				int x = f[mask];
				
				for ( int i = 0; i < B; i++ ) x = x * 2 + (lf >> i & 1);
				
				dp[mask] = s[x];
			}
		}
		
		for ( int i = 0; i < q; i++ ){
			bool bad = false;
			string &t = qu[i];
			
			for ( int j = n - 1; j >= n - B; j-- ){
				int p = n - 1 - j;
				
				if ( t[j] != '?' && (lf >> (B - p - 1) & 1) != t[j] - '0' ) bad = 1;
			}
			
			ans[i] += dp[val[i]] * !bad;
		}
	}
	
	for ( auto &x: ans ) cout << x << '\n';
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 53
• Subtask 5: 0 / 25