제출 #1291188

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291188		Faisal_Saqib	Snake Escaping (JOI18_snake_escaping)	C++20	100 / 100	1263 ms	20688 KiB

snake_escaping

/* 
    VENI VIDI VICI
*/
// #ifdef ONLINE_JUDGE
#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()

mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());  

using i128 = __int128;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;
using sll = set<ll>;

template<class T>
istream& operator>>(istream& is, vector<T>& v) {
    for(auto &i:v) is>>i;
    return is;
}
template<class T1,class T2>
istream& operator>>(istream& is, pair<T1,T2>& p) {
    is>>p.fi>>p.se;
    return is;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for(const auto &i:v) os<<i<<' ';
    return os;
}
template<class T1,class T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p) {
    os<<p.fi<<' '<<p.se; return os;
}
void pyn(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
void pYN(bool x)
{
    cout<<(x?"Yes":"No")<<endl;
}
void pAB(bool x)
{
    cout<<(x?"Alice":"Bob")<<endl;
}
ll powmod(ll a,ll b,ll modulo)
{
  if(b==0){
    return 1;
  }
  ll temp=powmod(a,b/2,modulo);
  if(b%2==0){
    return (temp*temp)%modulo;
  }
  else{
    return (a*((temp*temp)%modulo))%modulo;
  }
}
bool Prime(ll n){
    for (ll i = 2; i*i <= n; i++)
        if (n % i == 0)
            return false;
    return (n>1);
}
void readIO() {
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
}
// #endif
void solve();
int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    readIO();

    int uwu=1;

    // cin>>uwu;

    for(int tc=1;tc<=uwu;tc++) {
        // cout<<"Case #"<<tc<<": ";
        solve();
    }
    return 0;
}
const int mod=1e9;
const int M=(1<<20)+1,lg=23;
int dp[M],pw[lg],val[M],dp1[M];
void solve()
{
    pw[0]=1;
    for(int i=1;i<lg;i++)
    {
        pw[i]=pw[i-1]*2;
    }
    ll l,q;
    cin>>l>>q;
    for(int i=0;i<(1<<l);i++)
    {
        char c;
        cin>>c;
        int num=0;
        for(int j=0;j<l;j++)
        {
            if((i>>j)&1)
            {
                num+=pw[j];
            }
        }
        val[num]=dp1[num]=dp[num]=(c-'0');
    }
    // sos 
    for(int i=0;i<l;i++)
    {
        for(int x=0;x<(1<<l);x++)
        {
            if(x&pw[i])dp[x]+=dp[x^pw[i]];
            if(!(x&pw[i]))dp1[x]+=dp1[x^pw[i]];
        }
    }
    int lpt=6;
    while(q--)
    {
        ll sm=0;
        int num=0,x=0,z=0;
        for(int i=l-1;i>=0;i--)
        {
            char c;
            cin>>c;
            if(c=='?')
            {
                num+=pw[i];
            }
            else if(c=='1')
            {
                num+=pw[i];
                x+=pw[i];
            }
            else{
                z+=pw[i];
            }
        }
        int tp=__builtin_popcount(x);
        if(tp<=lpt)
        {
            sm=dp[num];
            for(ll y=x;y>0;y=(y-1)&x)
            {
                int cn=__builtin_popcount(y);
                if(cn%2)
                    sm-=dp[num-y];
                else
                    sm+=dp[num-y];
            }
        }
        else
        {
            tp=__builtin_popcount(num-x);
            if(tp<=lpt)
            {
                // try all combinations
                num-=x;
                sm=val[x];
                for(ll y=num;y>0;y=(y-1)&num)
                {
                    sm+=val[x|y];
                }
            }
            else{
                num=x;
                sm=dp1[num]; 
                for(ll y=z;y>0;y=(y-1)&z)
                {
                    int cn=__builtin_popcount(y);
                    if(cn%2)
                        sm-=dp1[num|y];
                    else
                        sm+=dp1[num|y];
                }
            }
        }
        cout<<sm<<endl;
    }
}

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