# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1217429 | hainam2k9 | Snake Escaping (JOI18_snake_escaping) | C++20 | 1 ms | 320 KiB |
#include <bits/stdc++.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
#define mp make_pair
using namespace std;
const int MOD = 1e9+7, MAXN = 2e6+5;
const string NAME = "";
int n,q,a[MAXN],sub[MAXN],sup[MAXN];
int main()
{
tt;
if(fopen((NAME + ".INP").c_str(), "r")) fo;
cin >> n >> q;
for(int i = 0; i<(1<<n); ++i){
char c;
cin >> c;
a[i]=c-48;
sub[i]=sup[i]=a[i];
}
for(int i = 0; i<n; ++i)
for(int mask = 0; mask<(1<<n); ++mask){
if((mask>>i)&1) sub[mask]+=sub[mask^(1<<i)];
else sup[mask]+=sup[mask^(1<<i)];
}
while(q--){
int maskQ=0,mask1=0,mask0=0,rs=0;
int cnt[3]={0,0,0};
for(int i = n-1; i>=0; --i){
char c;
cin >> c;
if(c=='0') mask0|=1<<i, ++cnt[0];
else if(c=='1') mask1|=1<<i, ++cnt[1];
else maskQ|=1<<i, ++cnt[2];
}
if(cnt[2]==min({cnt[0],cnt[1],cnt[2]})){
for(int mask = maskQ; ; mask=(mask-1)&maskQ){
rs+=a[mask|mask1];
if(mask==0) break;
}
}else if(cnt[1]==min(cnt[1],cnt[2])){
rs=sub[mask1|maskQ];
for(int mask = (mask1-1)&mask1; mask>0; mask=(mask-1)&mask1)
rs-=sub[mask|maskQ];
if(mask1>0) rs-=sub[maskQ];
}else{
rs=sup[mask1];
for(int mask = mask0; mask>0; mask=(mask-1)&mask0)
rs-=sup[mask|mask1];
}
cout << rs << "\n";
}
}
Compilation message (stderr)
# | 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... |