제출 #1284010

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284010		yf_yusuf	Snake Escaping (JOI18_snake_escaping)	C++20	75 / 100	2097 ms	30084 KiB

snake_escaping

//```//    YF YUSUF
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <queue>
#include <stack>
#include <cassert>
#include <climits>
#include <string>
#include <cstdlib>
#include <random>
#include <iomanip>
#include <ctime>
using namespace std;
#ifdef YF_CHECK
	bool LOCAL = 1;
#else
	#pragma GCC optimize ("unroll-loops")
	#pragma GCC optimize ("inline")
	#pragma GCC optimize ("Ofast")
	#pragma GCC optimize ("O3")
	bool LOCAL = 0;
#endif
using i128 = __int128;
using ll   = long long;
using ld   = long double;
using vll  = vector <ll>;
using mll  = map <ll,ll>;
using pll  = pair <ll,ll>;
using vvl  = vector <vll>;
using vpll = vector <pll>;
template<class T>T MIN(T&a,T b){a=min(a,b);return a;}
template<class T>T MAX(T&a,T b){a=max(a,b);return a;}
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sgr v+v+1,(tl+tr)/2+1,tr
#define sgl v+v,tl,(tl+tr)/2
#define pb push_back
#define ins insert
#define S second
#define F first
mt19937_64 MT(time(0));
ll BP(ll a,ll b,ll mod=1e9+7){
	ll res = 1, base = a;
	while(b){
		if(b & 1)res = (res * base) % mod;
		base = (base * base) % mod;
		b >>= 1;
	}
	return res;
}
ll f(ll x){return x*(x+1)/2;}
ll dup(ll a,ll b){return (a+b-1)/b;}
ll lcm(ll a,ll b){return a/__gcd(a,b)*b;}
ll invf(ll x){return (-1+sqrt(1+8*x))/2;}
ll lg(ll x){return (x ? 63 - __builtin_clzll(x) : -1);}
const ll  mod=998244353;
const ll  INF=1e18;
const ll  inf=1e9+7;
const ll  N  =1e6+7;
int get(char c){
	if(c == '?')return 2;
	else return (c - '0');
}
void YF_MAIN(ll TEST){
	ll n, q;
	cin>>n>>q;
	ll a[1<<n]{}, b[n][2]{}, sum = 0, sub[1<<n]{}, super[1<<n]{};
	for(int i=0;i<(1<<n);i++){
		char c;
		cin>>c;
		a[i] = c - '0';
		sub[i] = super[i] = a[i];
		for(int m=0; m<n; m++){
			b[m][(i>>m)&1] += a[i];
		}
		sum += a[i];
	}
	for(int j=0; j<n; j++)
	  for(int m=0; m<(1<<n); m++)
      if(m & (1 << j))
        sub[m] += sub[m ^ (1 << j)];
        
	for(int j=0; j<n; j++)
	  for(int m=0; m<(1<<n); m++)
        if((m & (1 << j)) == 0)
          super[m] += super[m | (1 << j)];
	            
	while(q--){
		string s;
		cin>>s;
		
		ll cnt[3]{};
		for(auto c : s)
			cnt[get(c)]++;
		
		ll ans = 0;
		
		if(cnt[2] <= 6){
			vll p;
			for(int i=0;i<s.size();i++){
				if(s[i] == '?')
					p.pb(i);
			}
			for(int m=0; m<(1<<cnt[2]); m++){
				for(int i=0; i<cnt[2]; i++){
					s[p[i]] = '0' + ((m>>i)&1);
				}
				ll x = 0;
				for(int i=0; i<n; i++){
					x <<= 1;
					x += (s[i] - '0');
				}
				ans += a[x];
			}
		}
		else if(cnt[1]<=6){
			vll p;
			for(int i=0;i<s.size();i++){
				if(s[i] == '1')
					p.pb(i);
			}
			for(int m=0; m<(1<<cnt[1]); m++){
				string S = s;
				for(int i=0; i<cnt[1]; i++){
					S[p[i]] = '0' + ((m>>i)&1);
				}
				ll x = 0;
				for(int i=0; i<n; i++){
					int add = S[i] - '0';
					if(S[i] == '?')add = 1;
					x = (x<<1) + add;
				}
				ans += sub[x] * ((cnt[1] - __builtin_popcount(m)) % 2 ? -1 : 1);
			}
		}
		else{
			vll p;
			for(int i=0;i<s.size();i++){
				if(s[i] == '0')
					p.pb(i);
			}
			for(int m=0; m<(1<<cnt[0]); m++){
				string S = s;
				for(int i=0; i<cnt[0]; i++){
					S[p[i]] = '0' + ((m>>i)&1);
				}
				ll x = 0;
				for(int i=0; i<n; i++){
					int add = S[i] - '0';
					if(S[i] == '?')add = 0;
					x = (x<<1) + add;
				}
				ans += super[x] * ((__builtin_popcount(m)) % 2 ? -1 : 1);
			}
		}
		cout<<ans<<"\n";
	}
}
const bool TECT=0;
const bool FLSH=1;
const ll SN=1e0 + 7; ll SM[SN];
const ll FN=1e0 + 7; ll FACT[FN], inv[FN], FMOD=inf;
ll PER(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;}
ll CNK(ll n,ll k){return PER(n,k)*inv[k  ]%FMOD;}
void BEFORE(){
	for(ll i=2;i<SN;i++){
		if(SM[i])continue;
		for(ll j=i;j<SN;j+=i)
			MAX(SM[j],i);
	}
	FACT[0]=inv[0]=1;
	for(int i=1;i<FN;i++){
		FACT[i]=FACT[i-1]*i%FMOD;
		inv[i]=BP(FACT[i],FMOD-2,FMOD);
	}
}
signed main(){
	// freopen(("input.txt"),"r",stdin);freopen(("output.txt"),"w",stdout);
	if(FLSH){
		ios_base::sync_with_stdio(0);
		cout.setf(ios::fixed);
		cout.precision(0);
		cout.tie(0);
		cin.tie(0);
	}
	cout<<(0 && LOCAL ? "\nYF_OUTPUT:\n\n" : "");
	int TEST=1;
	if(TECT)
		cin>>TEST;
	BEFORE();
	for(int T=1;T<=TEST;T++){
		// cout<<"Case "<<T<<": ";
		YF_MAIN(T);
		cout<<(T==TEST ? "" : "\n");
	}
	return 0;
} 
//   YF YUSUF ```

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