Submission #1144317

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144317		monkey133	Snake Escaping (JOI18_snake_escaping)	C++20	0 / 100	1 ms	324 KiB

snake_escaping

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


ll n, q;
string toxic;
ll dp[1000005], subset[1000005], superset[1000005], layer[1000005];

int main()
{
	cin >> n >> q >> toxic;
	for (ll i=0; i<(1LL << n); ++i) subset[i] = superset[i] = dp[i] = ll(toxic[i]-'0');
	for (ll i=0; i<(1LL << n); ++i) layer[i] = __builtin_popcountll(i);
	for (ll i=0; i<n; ++i)
	{
		for (ll j=0; j<(1LL << n); ++j)
		{
			if (j & (1LL << i)) 
			{
				subset[j] = subset[j^(1LL << i)];
				superset[j^(1LL << i)] = superset[j];
			}
		}
	}
	while (q--)
	{
		string mask;
		cin >> mask; reverse(all(mask));
		ll mask0 = 0, maskq = 0, mask1 = 0;
		for (ll i=0; i<n; ++i) 
		{
			if (mask[i]=='0') mask0 += (1LL << i);
			else if (mask[i]=='1') mask1 += (1LL << i);
			else maskq += (1LL << i);
		}
		ll ans = 0;
		if (layer[maskq] <= 7) // q
		{
			for (ll i=maskq;; i = (i -1)&maskq) // iterate all subset
			{
				ans += dp[i | mask1];
				if (i==0) break;
			}
		}
		else if (layer[mask0] <= 7) // 0
		{
			for (ll i=mask0;; i = (i -1)&mask0) // PIE
			{
				ans += ((layer[i]%2==0)?1:-1) * superset[i | mask1];
				if (i==0) break;
			}
		}
		else // 1
		{
			for (ll i=mask1;; i = (i -1)&mask1) // PIE
			{
				ans += ((layer[i]%2==0)?1:-1) * subset[(i^mask1) | maskq];
				if (i==0) break;
			}
		}
		cout << ans << endl;
		
	}
	
	
	return 0;
}

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