This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
if (!x) return 1;
ll res=BOW(a,x/2,p);
res*=res;
res%=p;
if (x%2) res*=a;
return res%p;
}
ll INV(ll a, ll p)
{
return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b;
int mask_cnt[3];
string sc,rgx;
int sump[2][1200001];
int sum[2][1200001];
int main()
{
fio;
cin>>n;
cin>>m;
cin>>sc;
// cout<<sc<<endl;
for (i=0;i<(1<<n);i++)
{
u=sc[i];
u-=48;
sump[0][i]=sump[1][i]=u;
}
for (t=0;t<n;t++)
{
u=(1<<t);
for (j=0;j<(1<<n);j++)
{
if (j&u)
{
sum[0][j]=sump[0][j]+sump[0][j^u];
sum[1][j]=sump[1][j];
}
else
{
sum[1][j]=sump[1][j]+sump[1][j^u];
sum[0][j]=sump[0][j];
}
}
memcpy(sump[0],sum[0],sizeof(sump[0]));
memcpy(sump[1],sum[1],sizeof(sump[1]));
}
for (t=0;t<m;t++)
{
cin>>rgx;
mask_cnt[0]=mask_cnt[1]=mask_cnt[2]=0;
for (i=0;i<n;i++)
{
for (j=0;j<3;j++)
{
mask_cnt[j]*=2;
}
if (rgx[i]=='0') mask_cnt[0]++;
if (rgx[i]=='1') mask_cnt[1]++;
if (rgx[i]=='?') mask_cnt[2]++;
}
u=__builtin_popcount(mask_cnt[0]);
v=__builtin_popcount(mask_cnt[1]);
a=__builtin_popcount(mask_cnt[2]);
if (a<=u && a<=v) {
b=0;
u=mask_cnt[1];
for (i=mask_cnt[2];i>=0;i--)
{
i&=mask_cnt[2];
b+=sc[i^u]-48;
}
}
else if (u<=v && u<=a) {
u=mask_cnt[1];
b=0;
for (i=mask_cnt[0];i>=0;i--)
{
i&=mask_cnt[0];
if (__builtin_popcount(i)%2)
{
b-=sum[1][u^i];
}
else {
b+=sum[1][u^i];
}
}
}
else {
u=mask_cnt[2];
b=0;
for (i=mask_cnt[1];i>=0;i--)
{
i&=mask_cnt[1];
if (__builtin_popcount(i)%2)
{
b-=sum[0][u^(i^mask_cnt[1])];
}
else {
b+=sum[0][u^(i^mask_cnt[1])];
}
}
}
cout<<b<<endl;
}
}
// Normie28;
Compilation message (stderr)
snake_escaping.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
23 | #pragma comment(linker, "/stack:200000000")
|
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |