# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
679541 | SanguineChameleon | Snake Escaping (JOI18_snake_escaping) | C++17 | 934 ms | 42172 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// BEGIN BOILERPLATE CODE
#include <bits/stdc++.h>
using namespace std;
#ifdef KAMIRULEZ
const bool kami_loc = true;
const long long kami_seed = 69420;
#else
const bool kami_loc = false;
const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif
const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);
long long rand_range(long long rmin, long long rmax) {
uniform_int_distribution<long long> rdist(rmin, rmax);
return rdist(kami_gen);
}
long double rand_real(long double rmin, long double rmax) {
uniform_real_distribution<long double> rdist(rmin, rmax);
return rdist(kami_gen);
}
void file_io(string fi, string fo) {
if (fi != "" && (!kami_loc || fi == kami_fi)) {
freopen(fi.c_str(), "r", stdin);
}
if (fo != "" && (!kami_loc || fo == kami_fo)) {
freopen(fo.c_str(), "w", stdout);
}
}
void set_up() {
if (kami_loc) {
file_io(kami_fi, kami_fo);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
}
void just_do_it();
void just_exec_it() {
if (kami_loc) {
auto pstart = chrono::steady_clock::now();
just_do_it();
auto pend = chrono::steady_clock::now();
long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
string bar(50, '=');
cout << '\n' << bar << '\n';
cout << "Time: " << ptime << " ms" << '\n';
}
else {
just_do_it();
}
}
int main() {
set_up();
just_exec_it();
return 0;
}
// END BOILERPLATE CODE
// BEGIN MAIN CODE
const int ms = (1 << 20) + 20;
int a[ms];
int sub[ms];
int sup[ms];
void just_do_it() {
int n, q;
cin >> n >> q;
for (int i = 0; i < (1 << n); i++) {
char c;
cin >> c;
a[i] = c - '0';
}
for (int i = 0; i < (1 << n); i++) {
sub[i] = a[i];
sup[i] = a[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < (1 << n); j++) {
if ((j >> i) & 1) {
sub[j] += sub[j ^ (1 << i)];
}
else {
sup[j] += sup[j ^ (1 << i)];
}
}
}
for (int i = 0; i < q; i++) {
string s;
cin >> s;
int m0 = 0;
int m1 = 0;
int m2 = 0;
for (int j = 0; j < n; j++) {
m0 <<= 1;
m1 <<= 1;
m2 <<= 1;
if (s[j] == '0') {
m0 |= 1;
}
else if (s[j] == '1') {
m1 |= 1;
}
else if (s[j] == '?') {
m2 |= 1;
}
}
if (__builtin_popcount(m0) <= 6) {
int res = 0;
for (int k = m0; ; k = (k - 1) & m0) {
if (__builtin_popcount(k) & 1) {
res -= sup[k | m1];
}
else {
res += sup[k | m1];
}
if (k == 0) {
break;
}
}
cout << res << '\n';
}
else if (__builtin_popcount(m1) <= 6) {
int res = 0;
for (int k = m1; ; k = (k - 1) & m1) {
if (__builtin_popcount(m1 ^ k) & 1) {
res -= sub[k | m2];
}
else {
res += sub[k | m2];
}
if (k == 0) {
break;
}
}
cout << res << '\n';
}
else if (__builtin_popcount(m2) <= 6) {
int res = 0;
for (int k = m2; ; k = (k - 1) & m2) {
res += a[k | m1];
if (k == 0) {
break;
}
}
cout << res << '\n';
}
}
}
// END MAIN CODE
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... |