제출 #523323

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
523323		sidon	Snake Escaping (JOI18_snake_escaping)	C++17	100 / 100	1872 ms	26604 KiB

snake_escaping

#include <bits/stdc++.h>
using namespace std;

const int B = 13, N = 1<<20, SZ = pow(3, B);

int Q, dp[SZ], ans[N], id[N], p3[B] = {1};
string A, inp;
short x[N], y[N];

int main() {
	ios::sync_with_stdio(0), cin.tie(0);

	for(int i = 1; i < B; ++i)
		p3[i] = p3[i-1] * 3;

	cin >> Q >> Q >> A;
	A.resize(N, '0');

	for(int i = 0; i < Q; ++i) {
		cin >> inp;
		reverse(begin(inp), end(inp));
		inp.resize(20, '0');

		for(int k = 0; k < B; ++k)
			id[i] += p3[k] * ((48 < inp[k]) + (62 < inp[k]));

		for(int k = 0; k < 20-B; ++k) {
			if(inp[k+B] != '?')	y[i] |= 1<<k;
			if(inp[k+B] == '1')	x[i] |= 1<<k;
		}
	}

	for(int s = 0; s < (1<<(20-B)); ++s) {
		memset(dp, 0, sizeof dp);

		for(int i = 0; i < (1<<B); ++i) {
			int j = 0;
			for(int k = 0; k < B; ++k)
				if(i & (1<<k)) j += p3[k];

			dp[j] += A[i | (s << B)] - '0';
		}

		for(int i = 1; i < SZ; ++i) {
			int j = -1, pw = 1;

			for(int k = 0, p = i; k < B; ++k, p /= 3)
				if((p % 3) > 1) j = k, pw = p3[k], k = B;
			
			if(j >= 0)
				dp[i] = dp[i - pw] + dp[i - 2 * pw];
		}

		for(int i = 0; i < Q; ++i)
			if(!((x[i] ^ s) & y[i]))
				ans[i] += dp[id[i]];
	}

	for(int i = 0; i < Q; ++i)
		cout << ans[i] << '\n';
}

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