Submission #708992

#	Time	Username	Problem	Language	Result	Execution time	Memory
708992		myrcella	Snake Escaping (JOI18_snake_escaping)	C++17	12 / 100	229 ms	16304 KiB

snake_escaping

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

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

int L,Q;
int ans[200010];
string s;
int pw[14];

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	pw[0]=1;
	rep(i,1,14) pw[i] = pw[i-1]*3;
	cin>>L>>Q;
	cin>>s;
	rep(i,0,(1<<L)) {
		int cur = (int)(s[i]-'0');
		rep(mask,0,(1<<L)) {
			int val = 0;
			rep(j,0,L) {
				if ((mask>>j)&1) val+=2*pw[j];
				else val += ((i>>j)&1)*pw[j];
			}
			ans[val] += cur;
		}
	}
	while (Q--) {
		string ss;cin>>ss;
		int mask = 0;
		rep(i,0,L) {
			if (ss[L-1-i]=='1') mask+=pw[i];
			else if (ss[L-1-i]=='?') mask+=pw[i]*2;
		}
		cout<<ans[mask]<<"\n";
	}
	return 0;
}

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