oj.uz

Submission #334749

# Submission time Handle Problem Language Result Execution time Memory
334749 2020-12-10T00:20:24 Z HoneyBadger Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 28432 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);
        solve0(i + 1, mask * 2, del ^ 1);
    } 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 < p1) solveq();
        else solve1();
        /*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 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 563 ms 4460 KB Output is correct
12 Correct 207 ms 4044 KB Output is correct
13 Correct 249 ms 3308 KB Output is correct
14 Correct 289 ms 3564 KB Output is correct
15 Correct 269 ms 4544 KB Output is correct
16 Correct 293 ms 3620 KB Output is correct
17 Correct 305 ms 3564 KB Output is correct
18 Correct 204 ms 5356 KB Output is correct
19 Correct 200 ms 2540 KB Output is correct
20 Correct 474 ms 4332 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 563 ms 4460 KB Output is correct
12 Correct 207 ms 4044 KB Output is correct
13 Correct 249 ms 3308 KB Output is correct
14 Correct 289 ms 3564 KB Output is correct
15 Correct 269 ms 4544 KB Output is correct
16 Correct 293 ms 3620 KB Output is correct
17 Correct 305 ms 3564 KB Output is correct
18 Correct 204 ms 5356 KB Output is correct
19 Correct 200 ms 2540 KB Output is correct
20 Correct 474 ms 4332 KB Output is correct
21 Correct 1174 ms 4716 KB Output is correct
22 Correct 231 ms 4716 KB Output is correct
23 Correct 346 ms 3692 KB Output is correct
24 Correct 494 ms 3636 KB Output is correct
25 Correct 361 ms 5612 KB Output is correct
26 Correct 456 ms 4076 KB Output is correct
27 Correct 476 ms 4204 KB Output is correct
28 Correct 224 ms 6764 KB Output is correct
29 Correct 213 ms 2540 KB Output is correct
30 Correct 934 ms 4844 KB Output is correct
31 Correct 537 ms 6636 KB Output is correct
32 Correct 499 ms 6636 KB Output is correct
33 Correct 348 ms 5228 KB Output is correct
34 Correct 486 ms 5484 KB Output is correct
35 Correct 481 ms 5868 KB Output is correct
36 Correct 212 ms 4716 KB Output is correct
37 Correct 220 ms 6436 KB Output is correct
38 Correct 217 ms 4332 KB Output is correct
39 Correct 529 ms 5356 KB Output is correct
40 Correct 483 ms 5228 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 780 ms 25424 KB Output is correct
12 Correct 80 ms 25196 KB Output is correct
13 Correct 120 ms 25196 KB Output is correct
14 Correct 199 ms 25196 KB Output is correct
15 Correct 100 ms 25324 KB Output is correct
16 Correct 210 ms 25196 KB Output is correct
17 Correct 203 ms 25196 KB Output is correct
18 Correct 74 ms 25324 KB Output is correct
19 Correct 76 ms 25068 KB Output is correct
20 Correct 484 ms 25324 KB Output is correct
21 Correct 163 ms 25236 KB Output is correct
22 Correct 292 ms 25196 KB Output is correct
23 Correct 100 ms 25660 KB Output is correct
24 Correct 203 ms 27244 KB Output is correct
25 Correct 207 ms 27244 KB Output is correct
26 Correct 74 ms 27116 KB Output is correct
27 Correct 78 ms 27244 KB Output is correct
28 Correct 78 ms 27372 KB Output is correct
29 Correct 157 ms 27244 KB Output is correct
30 Correct 195 ms 27244 KB Output is correct
31 Correct 91 ms 27244 KB Output is correct
32 Correct 205 ms 27244 KB Output is correct
33 Correct 208 ms 27372 KB Output is correct
34 Correct 74 ms 27116 KB Output is correct
35 Correct 204 ms 27244 KB Output is correct
36 Correct 205 ms 27244 KB Output is correct
37 Correct 201 ms 27244 KB Output is correct
38 Correct 206 ms 27628 KB Output is correct
39 Correct 205 ms 27244 KB Output is correct
40 Correct 204 ms 27244 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 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 563 ms 4460 KB Output is correct
12 Correct 207 ms 4044 KB Output is correct
13 Correct 249 ms 3308 KB Output is correct
14 Correct 289 ms 3564 KB Output is correct
15 Correct 269 ms 4544 KB Output is correct
16 Correct 293 ms 3620 KB Output is correct
17 Correct 305 ms 3564 KB Output is correct
18 Correct 204 ms 5356 KB Output is correct
19 Correct 200 ms 2540 KB Output is correct
20 Correct 474 ms 4332 KB Output is correct
21 Correct 1174 ms 4716 KB Output is correct
22 Correct 231 ms 4716 KB Output is correct
23 Correct 346 ms 3692 KB Output is correct
24 Correct 494 ms 3636 KB Output is correct
25 Correct 361 ms 5612 KB Output is correct
26 Correct 456 ms 4076 KB Output is correct
27 Correct 476 ms 4204 KB Output is correct
28 Correct 224 ms 6764 KB Output is correct
29 Correct 213 ms 2540 KB Output is correct
30 Correct 934 ms 4844 KB Output is correct
31 Correct 537 ms 6636 KB Output is correct
32 Correct 499 ms 6636 KB Output is correct
33 Correct 348 ms 5228 KB Output is correct
34 Correct 486 ms 5484 KB Output is correct
35 Correct 481 ms 5868 KB Output is correct
36 Correct 212 ms 4716 KB Output is correct
37 Correct 220 ms 6436 KB Output is correct
38 Correct 217 ms 4332 KB Output is correct
39 Correct 529 ms 5356 KB Output is correct
40 Correct 483 ms 5228 KB Output is correct
41 Correct 780 ms 25424 KB Output is correct
42 Correct 80 ms 25196 KB Output is correct
43 Correct 120 ms 25196 KB Output is correct
44 Correct 199 ms 25196 KB Output is correct
45 Correct 100 ms 25324 KB Output is correct
46 Correct 210 ms 25196 KB Output is correct
47 Correct 203 ms 25196 KB Output is correct
48 Correct 74 ms 25324 KB Output is correct
49 Correct 76 ms 25068 KB Output is correct
50 Correct 484 ms 25324 KB Output is correct
51 Correct 163 ms 25236 KB Output is correct
52 Correct 292 ms 25196 KB Output is correct
53 Correct 100 ms 25660 KB Output is correct
54 Correct 203 ms 27244 KB Output is correct
55 Correct 207 ms 27244 KB Output is correct
56 Correct 74 ms 27116 KB Output is correct
57 Correct 78 ms 27244 KB Output is correct
58 Correct 78 ms 27372 KB Output is correct
59 Correct 157 ms 27244 KB Output is correct
60 Correct 195 ms 27244 KB Output is correct
61 Correct 91 ms 27244 KB Output is correct
62 Correct 205 ms 27244 KB Output is correct
63 Correct 208 ms 27372 KB Output is correct
64 Correct 74 ms 27116 KB Output is correct
65 Correct 204 ms 27244 KB Output is correct
66 Correct 205 ms 27244 KB Output is correct
67 Correct 201 ms 27244 KB Output is correct
68 Correct 206 ms 27628 KB Output is correct
69 Correct 205 ms 27244 KB Output is correct
70 Correct 204 ms 27244 KB Output is correct
71 Execution timed out 2075 ms 28432 KB Time limit exceeded
72 Halted 0 ms 0 KB -