제출 #766707

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
766707		nishkarsh	Snake Escaping (JOI18_snake_escaping)	C++14	100 / 100	583 ms	47408 KiB

snake_escaping

#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pcc pair<char,char>
#define vi vector <int>
#define vl vector <ll>
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define pd(x) printf("%d",x)
#define plld(x) printf("%lld",x)
#define pds(x) printf("%d ",x)
#define pllds(x) printf("%lld ",x)
#define pdn(x) printf("%d\n",x)
#define plldn(x) printf("%lld\n",x)
using namespace std;
ll powmod(ll base,ll exponent,ll mod){
	ll ans=1;
	if(base<0) base+=mod;
	while(exponent){
		if(exponent&1)ans=(ans*base)%mod;
		base=(base*base)%mod;
		exponent/=2;
	}
	return ans;
}
ll gcd(ll a, ll b){
	if(b==0) return a;
	else return gcd(b,a%b);
}
const int INF = 2e9;
const ll INFLL = 4e18;
const int upperlimit = 5e3+1;
const int mod = 998244353;
const int N = 20;
int poison[1<<N];
int zer_sum[1<<N];
int one_sum[1<<N];
int pop_cnt[1<<N];
void subset_sum(int *a, int n){
	for(int i = 0; i < n; i++){
		for(int j = 0; j < (1<<n); j += (1<<(i+1))){
			for(int k = j; k < j + (1<<i); k++){
				a[k+(1<<i)] += a[k];
			}
		}
	}
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int l,q;
	string pos;
	cin >> l >> q >> pos;
	for(int i = 0; i < (1<<l); i++){
		poison[i] = pos[i]-'0';
		one_sum[i] = poison[i];
		zer_sum[(1<<l)-1-i] = poison[i];
		pop_cnt[i] = pop_cnt[i>>1] + (i&1);
	}
	subset_sum(one_sum,l);
	subset_sum(zer_sum,l);
	int zer_mask,one_mask,q_mask,zer,one,ques,ans;
	while(q--){
		zer = one = ques = zer_mask = one_mask = q_mask = ans = 0;
		cin >> pos;
		for(int i = 0; i < l; i++){
			if(pos[i] == '?'){
				ques++;
				q_mask |= (1<<(l-i-1));
			}
			else if(pos[i] == '0'){
				zer++;
				zer_mask |= (1<<(l-i-1));
			}
			else{
				one++;
				one_mask |= (1<<(l-i-1));
			}
		}
		if((ques <= zer) && (ques <= one)){
			for(int mask = q_mask; mask > 0; mask = (mask-1)&q_mask){
				ans += poison[mask^one_mask];
			}
			ans += poison[one_mask];
		}
		else if (zer <= one){
			for(int mask = zer_mask; mask > 0; mask = (mask-1)&zer_mask){
				if(pop_cnt[zer_mask^mask]&1) ans -= zer_sum[q_mask^mask];
				else ans += zer_sum[q_mask^mask];
			}
			if(pop_cnt[zer_mask]&1) ans -= zer_sum[q_mask];
			else ans += zer_sum[q_mask];
		}
		else{
			for(int mask = one_mask; mask > 0; mask = (mask-1)&one_mask){
				if(pop_cnt[one_mask^mask]&1) ans -= one_sum[q_mask^mask];
				else ans += one_sum[q_mask^mask];
			}
			if(pop_cnt[one_mask]&1) ans -= one_sum[q_mask];
			else ans += one_sum[q_mask];
		}
		cout << ans << "\n";
	}
	return 0;
}

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