oj.uz

Submission #334750

# Submission time Handle Problem Language Result Execution time Memory
334750 2020-12-10T00:27:36 Z HoneyBadger Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 32492 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 int long long
#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 unsigned long long ull;
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());


int n, q;
int a[MX];
int sos1[MX];
int sos0[MX];

void calc() {
    for (int mask = 0; mask < (1 << n); ++mask) {
        sos1[mask] = a[mask];
        sos0[mask] = a[mask];
    }
    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)];
            }
        }
    }

}

int ans;
str s;


void solveq(int i = 0, int mask = 0) {
    if (i == n) {
        ans += a[mask];
        return;
    }
    if (s[i] == '?') {
        solveq(i + 1, mask * 2);
        solveq(i + 1, mask * 2 + 1);
    } else {
        solveq(i + 1, mask * 2 + (s[i] == '1'));
    }
}

void solve1(int i = 0, int mask = 0, int del = 0) {
    if (i == n) {
        if (del)
            ans -= sos1[mask];
        else
            ans += sos1[mask];
        return;
    }
    if (s[i] == '1') {
        solve1(i + 1, mask * 2 + 1, del);
        solve1(i + 1, mask * 2, del ^ 1);  
    } else {
        solve1(i + 1, mask * 2 + (s[i] == '?'), del);
    }
}

void solve0(int i = 0, int mask = 0, int del = 0) {
    if (i == n) {
        if (del)
            ans -= sos0[mask];
        else
            ans += sos0[mask];
        return;
    }
    if (s[i] == '0') {
        solve0(i + 1, mask * 2 + 1, del ^ 1);
        solve0(i + 1, mask * 2, del);
    } else {
        solve0(i + 1, mask * 2 + (s[i] != '?'), del);
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> q;
    for (int i = 0; i < (1 << n); ++i) {
        char c;
        cin >> c;
        a[i] = c - '0';
    }

    calc();
    
    while (q--) {
        cin >> s;
        int pq = 0, p1 = 0, p0 = 0;
        fx(c, s) {
            pq += c == '?';
            p1 += c == '1';
            p0 += c == '0';
        }
        ans = 0;
        if (pq <= n / 3) {
            solveq();
        } else if (p1 <= n / 3) {
            solve1();
        } else {    
            solve0();
        }
        cout << ans << '\n';
    }
}

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 384 KB Output is correct
7 Correct 1 ms 380 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 384 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 384 KB Output is correct
7 Correct 1 ms 380 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 384 KB Output is correct
11 Correct 213 ms 4384 KB Output is correct
12 Correct 237 ms 4088 KB Output is correct
13 Correct 265 ms 3596 KB Output is correct
14 Correct 286 ms 3436 KB Output is correct
15 Correct 255 ms 4588 KB Output is correct
16 Correct 293 ms 3692 KB Output is correct
17 Correct 285 ms 3692 KB Output is correct
18 Correct 209 ms 5356 KB Output is correct
19 Correct 199 ms 2412 KB Output is correct
20 Correct 249 ms 4204 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 384 KB Output is correct
7 Correct 1 ms 380 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 384 KB Output is correct
11 Correct 213 ms 4384 KB Output is correct
12 Correct 237 ms 4088 KB Output is correct
13 Correct 265 ms 3596 KB Output is correct
14 Correct 286 ms 3436 KB Output is correct
15 Correct 255 ms 4588 KB Output is correct
16 Correct 293 ms 3692 KB Output is correct
17 Correct 285 ms 3692 KB Output is correct
18 Correct 209 ms 5356 KB Output is correct
19 Correct 199 ms 2412 KB Output is correct
20 Correct 249 ms 4204 KB Output is correct
21 Correct 227 ms 4716 KB Output is correct
22 Correct 255 ms 4716 KB Output is correct
23 Correct 369 ms 3820 KB Output is correct
24 Correct 493 ms 3692 KB Output is correct
25 Correct 337 ms 5740 KB Output is correct
26 Correct 459 ms 4332 KB Output is correct
27 Correct 423 ms 4076 KB Output is correct
28 Correct 218 ms 6764 KB Output is correct
29 Correct 221 ms 2668 KB Output is correct
30 Correct 305 ms 4716 KB Output is correct
31 Correct 376 ms 4588 KB Output is correct
32 Correct 497 ms 4608 KB Output is correct
33 Correct 326 ms 3436 KB Output is correct
34 Correct 486 ms 3564 KB Output is correct
35 Correct 425 ms 4088 KB Output is correct
36 Correct 215 ms 2668 KB Output is correct
37 Correct 213 ms 4588 KB Output is correct
38 Correct 225 ms 2648 KB Output is correct
39 Correct 373 ms 3692 KB Output is correct
40 Correct 487 ms 3692 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 384 KB Output is correct
7 Correct 1 ms 380 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 384 KB Output is correct
11 Correct 79 ms 25196 KB Output is correct
12 Correct 83 ms 25196 KB Output is correct
13 Correct 133 ms 25088 KB Output is correct
14 Correct 196 ms 25196 KB Output is correct
15 Correct 98 ms 25324 KB Output is correct
16 Correct 197 ms 25196 KB Output is correct
17 Correct 173 ms 25196 KB Output is correct
18 Correct 76 ms 25324 KB Output is correct
19 Correct 78 ms 25068 KB Output is correct
20 Correct 88 ms 25196 KB Output is correct
21 Correct 130 ms 25196 KB Output is correct
22 Correct 195 ms 25196 KB Output is correct
23 Correct 101 ms 25068 KB Output is correct
24 Correct 213 ms 25196 KB Output is correct
25 Correct 176 ms 25196 KB Output is correct
26 Correct 77 ms 25100 KB Output is correct
27 Correct 78 ms 25196 KB Output is correct
28 Correct 79 ms 25068 KB Output is correct
29 Correct 128 ms 25196 KB Output is correct
30 Correct 193 ms 25196 KB Output is correct
31 Correct 98 ms 25068 KB Output is correct
32 Correct 204 ms 25196 KB Output is correct
33 Correct 173 ms 25196 KB Output is correct
34 Correct 77 ms 25020 KB Output is correct
35 Correct 142 ms 25196 KB Output is correct
36 Correct 142 ms 25324 KB Output is correct
37 Correct 142 ms 25196 KB Output is correct
38 Correct 145 ms 25148 KB Output is correct
39 Correct 145 ms 25148 KB Output is correct
40 Correct 144 ms 25196 KB Output is correct

Subtask #5
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 384 KB Output is correct
7 Correct 1 ms 380 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 384 KB Output is correct
11 Correct 213 ms 4384 KB Output is correct
12 Correct 237 ms 4088 KB Output is correct
13 Correct 265 ms 3596 KB Output is correct
14 Correct 286 ms 3436 KB Output is correct
15 Correct 255 ms 4588 KB Output is correct
16 Correct 293 ms 3692 KB Output is correct
17 Correct 285 ms 3692 KB Output is correct
18 Correct 209 ms 5356 KB Output is correct
19 Correct 199 ms 2412 KB Output is correct
20 Correct 249 ms 4204 KB Output is correct
21 Correct 227 ms 4716 KB Output is correct
22 Correct 255 ms 4716 KB Output is correct
23 Correct 369 ms 3820 KB Output is correct
24 Correct 493 ms 3692 KB Output is correct
25 Correct 337 ms 5740 KB Output is correct
26 Correct 459 ms 4332 KB Output is correct
27 Correct 423 ms 4076 KB Output is correct
28 Correct 218 ms 6764 KB Output is correct
29 Correct 221 ms 2668 KB Output is correct
30 Correct 305 ms 4716 KB Output is correct
31 Correct 376 ms 4588 KB Output is correct
32 Correct 497 ms 4608 KB Output is correct
33 Correct 326 ms 3436 KB Output is correct
34 Correct 486 ms 3564 KB Output is correct
35 Correct 425 ms 4088 KB Output is correct
36 Correct 215 ms 2668 KB Output is correct
37 Correct 213 ms 4588 KB Output is correct
38 Correct 225 ms 2648 KB Output is correct
39 Correct 373 ms 3692 KB Output is correct
40 Correct 487 ms 3692 KB Output is correct
41 Correct 79 ms 25196 KB Output is correct
42 Correct 83 ms 25196 KB Output is correct
43 Correct 133 ms 25088 KB Output is correct
44 Correct 196 ms 25196 KB Output is correct
45 Correct 98 ms 25324 KB Output is correct
46 Correct 197 ms 25196 KB Output is correct
47 Correct 173 ms 25196 KB Output is correct
48 Correct 76 ms 25324 KB Output is correct
49 Correct 78 ms 25068 KB Output is correct
50 Correct 88 ms 25196 KB Output is correct
51 Correct 130 ms 25196 KB Output is correct
52 Correct 195 ms 25196 KB Output is correct
53 Correct 101 ms 25068 KB Output is correct
54 Correct 213 ms 25196 KB Output is correct
55 Correct 176 ms 25196 KB Output is correct
56 Correct 77 ms 25100 KB Output is correct
57 Correct 78 ms 25196 KB Output is correct
58 Correct 79 ms 25068 KB Output is correct
59 Correct 128 ms 25196 KB Output is correct
60 Correct 193 ms 25196 KB Output is correct
61 Correct 98 ms 25068 KB Output is correct
62 Correct 204 ms 25196 KB Output is correct
63 Correct 173 ms 25196 KB Output is correct
64 Correct 77 ms 25020 KB Output is correct
65 Correct 142 ms 25196 KB Output is correct
66 Correct 142 ms 25324 KB Output is correct
67 Correct 142 ms 25196 KB Output is correct
68 Correct 145 ms 25148 KB Output is correct
69 Correct 145 ms 25148 KB Output is correct
70 Correct 144 ms 25196 KB Output is correct
71 Correct 387 ms 29932 KB Output is correct
72 Correct 494 ms 32492 KB Output is correct
73 Correct 1376 ms 31072 KB Output is correct
74 Execution timed out 2099 ms 30188 KB Time limit exceeded
75 Halted 0 ms 0 KB -