oj.uz

Submission #334781

# Submission time Handle Problem Language Result Execution time Memory
334781 2020-12-10T01:49:21 Z HoneyBadger Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 1012 ms 42604 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>
 
 
 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
 
 
 
#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif
 
 
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
 
using namespace std;
 
template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }
 
ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}
 
typedef long long ll;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;
 
 
 
const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 1 << 20;
const int PW = 20;
const double EPS = 1e-9;
 
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

inline int readChar();
inline int readInt();
inline void writeInt(int x, char end = 0);
inline void writeChar(int x);


static const int buf_size = 4096;

inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len)
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    if (pos == len)
        return -1;
    return buf[pos++];
}

inline int readChar() {
    int c = getChar();
    while (c <= 32)
        c = getChar();
    return c;
}

inline int readInt() {
    int c = readChar();
    int x = 0;
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return x;
}


static int write_pos = 0;
static char write_buf[buf_size];

inline void writeChar(int x) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}

inline void writeInt(int x, char end) {
    char s[9];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}


struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;


 
int n, q;
int a[MX];
int sos1[MX];
int sos0[MX];
int bits[MX];
 
void calc() {
    for (int mask = 0; mask < (1 << n); ++mask) {
        sos1[mask] = a[mask];
        sos0[mask] = a[mask];
        bits[mask] = bits[mask >> 1] + (mask & 1);
    }
    for (int i = 0; i < n; ++i) {
        for (int mask = 0; mask < (1 << n); ++mask) {
            if ((mask >> i) & 1) {
                sos1[mask] += sos1[mask ^ (1 << i)];
            } else {
                sos0[mask] += sos0[mask ^ (1 << i)];
            }
        }
    }
 
}
 
int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    n = readInt(), q = readInt();
    int full = (1 << n) - 1;
    for (int i = 0; i < (1 << n); ++i) {
        a[i] = readChar() - '0';
    }
 
    calc();
    while (q--) {
        int mq = 0, m0 = 0, m1 = 0;
        fi(0, n) {
            char c = readChar();
            mq = (mq << 1) | (c == '?');
            m0 = (m0 << 1) | (c == '0');
            m1 = (m1 << 1) | (c == '1');
        }
        int ans = 0;
        if (bits[mq] < 7) {
            for (int mask = mq;;mask = (mask - 1) & mq) {
                ans += a[m1 ^ mask];
                if (!mask) break;
            }
        } else if (bits[m0] < 7) {
            for (int mask = m0;;mask = (mask - 1) & m0) {
                ans += sos0[m1 ^ mask] * (bits[mask] % 2 ? -1 : 1);
                if (!mask) break;
            }
        } else {
            for (int mask = m1;;mask = (mask - 1) & m1) {
                ans += sos1[mq ^ mask] * (bits[mask ^ m1] % 2 ? -1 : 1);
                if (!mask) break;
            }
        }
        writeInt(ans, '\n');
    }
}

Compilation message

snake_escaping.cpp: In function 'int32_t main()':
snake_escaping.cpp:184:9: warning: unused variable 'full' [-Wunused-variable]
  184 |     int full = (1 << n) - 1;
      |         ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 92 ms 4716 KB Output is correct
12 Correct 85 ms 4460 KB Output is correct
13 Correct 95 ms 3692 KB Output is correct
14 Correct 150 ms 3820 KB Output is correct
15 Correct 127 ms 4716 KB Output is correct
16 Correct 70 ms 3948 KB Output is correct
17 Correct 98 ms 3948 KB Output is correct
18 Correct 56 ms 5740 KB Output is correct
19 Correct 40 ms 2412 KB Output is correct
20 Correct 265 ms 4076 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 92 ms 4716 KB Output is correct
12 Correct 85 ms 4460 KB Output is correct
13 Correct 95 ms 3692 KB Output is correct
14 Correct 150 ms 3820 KB Output is correct
15 Correct 127 ms 4716 KB Output is correct
16 Correct 70 ms 3948 KB Output is correct
17 Correct 98 ms 3948 KB Output is correct
18 Correct 56 ms 5740 KB Output is correct
19 Correct 40 ms 2412 KB Output is correct
20 Correct 265 ms 4076 KB Output is correct
21 Correct 63 ms 4588 KB Output is correct
22 Correct 234 ms 4716 KB Output is correct
23 Correct 84 ms 3820 KB Output is correct
24 Correct 76 ms 3816 KB Output is correct
25 Correct 88 ms 5484 KB Output is correct
26 Correct 93 ms 4076 KB Output is correct
27 Correct 103 ms 3948 KB Output is correct
28 Correct 69 ms 6508 KB Output is correct
29 Correct 53 ms 2540 KB Output is correct
30 Correct 124 ms 4716 KB Output is correct
31 Correct 134 ms 4844 KB Output is correct
32 Correct 103 ms 4972 KB Output is correct
33 Correct 90 ms 3948 KB Output is correct
34 Correct 75 ms 3820 KB Output is correct
35 Correct 114 ms 4332 KB Output is correct
36 Correct 49 ms 2924 KB Output is correct
37 Correct 133 ms 4844 KB Output is correct
38 Correct 50 ms 2924 KB Output is correct
39 Correct 80 ms 4076 KB Output is correct
40 Correct 76 ms 3820 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 46 ms 17388 KB Output is correct
12 Correct 50 ms 17388 KB Output is correct
13 Correct 148 ms 17260 KB Output is correct
14 Correct 188 ms 17260 KB Output is correct
15 Correct 47 ms 17388 KB Output is correct
16 Correct 148 ms 17004 KB Output is correct
17 Correct 119 ms 17004 KB Output is correct
18 Correct 41 ms 17132 KB Output is correct
19 Correct 44 ms 16876 KB Output is correct
20 Correct 47 ms 17004 KB Output is correct
21 Correct 56 ms 17004 KB Output is correct
22 Correct 183 ms 17004 KB Output is correct
23 Correct 140 ms 17292 KB Output is correct
24 Correct 60 ms 17260 KB Output is correct
25 Correct 69 ms 17260 KB Output is correct
26 Correct 136 ms 17132 KB Output is correct
27 Correct 47 ms 17388 KB Output is correct
28 Correct 44 ms 17132 KB Output is correct
29 Correct 150 ms 17260 KB Output is correct
30 Correct 164 ms 17260 KB Output is correct
31 Correct 78 ms 17388 KB Output is correct
32 Correct 78 ms 17260 KB Output is correct
33 Correct 67 ms 17260 KB Output is correct
34 Correct 40 ms 17132 KB Output is correct
35 Correct 61 ms 17260 KB Output is correct
36 Correct 62 ms 17260 KB Output is correct
37 Correct 60 ms 17260 KB Output is correct
38 Correct 61 ms 17260 KB Output is correct
39 Correct 61 ms 17260 KB Output is correct
40 Correct 61 ms 17260 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 92 ms 4716 KB Output is correct
12 Correct 85 ms 4460 KB Output is correct
13 Correct 95 ms 3692 KB Output is correct
14 Correct 150 ms 3820 KB Output is correct
15 Correct 127 ms 4716 KB Output is correct
16 Correct 70 ms 3948 KB Output is correct
17 Correct 98 ms 3948 KB Output is correct
18 Correct 56 ms 5740 KB Output is correct
19 Correct 40 ms 2412 KB Output is correct
20 Correct 265 ms 4076 KB Output is correct
21 Correct 63 ms 4588 KB Output is correct
22 Correct 234 ms 4716 KB Output is correct
23 Correct 84 ms 3820 KB Output is correct
24 Correct 76 ms 3816 KB Output is correct
25 Correct 88 ms 5484 KB Output is correct
26 Correct 93 ms 4076 KB Output is correct
27 Correct 103 ms 3948 KB Output is correct
28 Correct 69 ms 6508 KB Output is correct
29 Correct 53 ms 2540 KB Output is correct
30 Correct 124 ms 4716 KB Output is correct
31 Correct 134 ms 4844 KB Output is correct
32 Correct 103 ms 4972 KB Output is correct
33 Correct 90 ms 3948 KB Output is correct
34 Correct 75 ms 3820 KB Output is correct
35 Correct 114 ms 4332 KB Output is correct
36 Correct 49 ms 2924 KB Output is correct
37 Correct 133 ms 4844 KB Output is correct
38 Correct 50 ms 2924 KB Output is correct
39 Correct 80 ms 4076 KB Output is correct
40 Correct 76 ms 3820 KB Output is correct
41 Correct 46 ms 17388 KB Output is correct
42 Correct 50 ms 17388 KB Output is correct
43 Correct 148 ms 17260 KB Output is correct
44 Correct 188 ms 17260 KB Output is correct
45 Correct 47 ms 17388 KB Output is correct
46 Correct 148 ms 17004 KB Output is correct
47 Correct 119 ms 17004 KB Output is correct
48 Correct 41 ms 17132 KB Output is correct
49 Correct 44 ms 16876 KB Output is correct
50 Correct 47 ms 17004 KB Output is correct
51 Correct 56 ms 17004 KB Output is correct
52 Correct 183 ms 17004 KB Output is correct
53 Correct 140 ms 17292 KB Output is correct
54 Correct 60 ms 17260 KB Output is correct
55 Correct 69 ms 17260 KB Output is correct
56 Correct 136 ms 17132 KB Output is correct
57 Correct 47 ms 17388 KB Output is correct
58 Correct 44 ms 17132 KB Output is correct
59 Correct 150 ms 17260 KB Output is correct
60 Correct 164 ms 17260 KB Output is correct
61 Correct 78 ms 17388 KB Output is correct
62 Correct 78 ms 17260 KB Output is correct
63 Correct 67 ms 17260 KB Output is correct
64 Correct 40 ms 17132 KB Output is correct
65 Correct 61 ms 17260 KB Output is correct
66 Correct 62 ms 17260 KB Output is correct
67 Correct 60 ms 17260 KB Output is correct
68 Correct 61 ms 17260 KB Output is correct
69 Correct 61 ms 17260 KB Output is correct
70 Correct 61 ms 17260 KB Output is correct
71 Correct 223 ms 22124 KB Output is correct
72 Correct 321 ms 21996 KB Output is correct
73 Correct 594 ms 20460 KB Output is correct
74 Correct 785 ms 20840 KB Output is correct
75 Correct 281 ms 22944 KB Output is correct
76 Correct 1012 ms 23404 KB Output is correct
77 Correct 840 ms 21492 KB Output is correct
78 Correct 203 ms 25452 KB Output is correct
79 Correct 179 ms 19212 KB Output is correct
80 Correct 279 ms 22508 KB Output is correct
81 Correct 484 ms 22380 KB Output is correct
82 Correct 781 ms 21356 KB Output is correct
83 Correct 190 ms 20460 KB Output is correct
84 Correct 525 ms 21336 KB Output is correct
85 Correct 702 ms 21484 KB Output is correct
86 Correct 109 ms 19308 KB Output is correct
87 Correct 272 ms 22252 KB Output is correct
88 Correct 187 ms 19200 KB Output is correct
89 Correct 305 ms 21056 KB Output is correct
90 Correct 462 ms 21228 KB Output is correct
91 Correct 190 ms 20460 KB Output is correct
92 Correct 870 ms 21780 KB Output is correct
93 Correct 733 ms 42476 KB Output is correct
94 Correct 126 ms 40300 KB Output is correct
95 Correct 839 ms 42348 KB Output is correct
96 Correct 561 ms 42476 KB Output is correct
97 Correct 579 ms 42604 KB Output is correct
98 Correct 585 ms 42552 KB Output is correct
99 Correct 574 ms 42460 KB Output is correct
100 Correct 557 ms 42348 KB Output is correct