Submission #489401

#TimeUsernameProblemLanguageResultExecution timeMemory
489401arwaeystoamnegSnake Escaping (JOI18_snake_escaping)C++17
75 / 100
2084 ms23072 KiB
// EXPLOSION! #define _CRT_SECURE_NO_WARNINGS #include<bits/stdc++.h> #include<unordered_set> #include<unordered_map> #include<chrono> using namespace std; typedef pair<int, int> pii; typedef long long ll; typedef pair<ll, ll> pll; typedef long double ld; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pair<int, int>> vpi; typedef vector<pair<ll, ll>> vpll; #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define trav(a,x) for (auto& a: x) #define pb push_back #define mp make_pair #define rsz resize #define sz(x) int(x.size()) #define all(x) x.begin(),x.end() #define f first #define s second #define cont continue //#define endl '\n' //#define ednl '\n' #define test int testc;cin>>testc;while(testc--) #define pr(a, b) trav(x,a)cerr << x << b; cerr << endl; #define message cout << "Hello World" << endl; const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!! const ll linf = 4000000000000000000LL; const ll inf = 1000000007;//998244353 void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; } }void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; } void setIO(string s) { ios_base::sync_with_stdio(0); cin.tie(0); #ifdef arwaeystoamneg if (sz(s)) { freopen((s + ".in").c_str(), "r", stdin); if (s != "test1") freopen((s + ".out").c_str(), "w", stdout); } #endif } int popcount(ll a) { int count = 0; while (a) { count += (a & 1); a >>= 1; } return count; } const int SZ = 20; int n, q; string a; ll super[1 << SZ], sub[1 << SZ]; int main() { setIO("test1"); cin >> n >> q >> a; F0R(mask, 1 << n) { sub[mask] = super[mask] = a[mask] - '0'; } F0R(i, n) { F0R(mask, 1 << n) { if (mask & (1 << i))continue; sub[mask ^ (1 << i)] += sub[mask]; } } F0R(i, n) { R0F(mask, 1 << n) { if (mask & (1 << i)) { super[mask ^ (1 << i)] += super[mask]; } } } F0R(l, q) { string b; cin >> b; reverse(all(b)); vi zero, one, quest; F0R(i, n)if (b[i] == '0')zero.pb(i); else if (b[i] == '1')one.pb(i); else quest.pb(i); ll ans = 0; if (sz(zero) <= n / 3) { int mask1 = 0; trav(x, one)mask1 ^= (1 << x); int m = sz(zero); int cur = mask1; F0R(mask, 1 << m) { if (popcount(mask) & 1)ans -= super[cur]; else ans += super[cur]; int t = 0; while (t < m) { if (cur & (1 << zero[t])) { cur ^= (1 << zero[t]); t++; } else { cur ^= (1 << zero[t]); break; } } } } else if (sz(one) <= n / 3) { int mask1 = 0; trav(x, quest)mask1 ^= (1 << x); int m = sz(one); int cur = mask1; F0R(mask, 1 << m) { if (popcount(mask) & 1)ans -= sub[cur]; else ans += sub[cur]; int t = 0; while (t < m) { if (cur & (1 << one[t])) { cur ^= (1 << one[t]); t++; } else { cur ^= (1 << one[t]); break; } } } } else { int mask1 = 0; trav(x, one)mask1 ^= (1 << x); int m = sz(quest); int cur = mask1; F0R(mask, 1 << m) { int t = 0; while (t < m) { if (cur & (1 << quest[t])) { cur ^= (1 << quest[t]); t++; } else { cur ^= (1 << quest[t]); break; } } ans += a[cur] - '0'; } } cout << abs(ans) << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...