oj.uz

답안 #334756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334756 2020-12-10T00:39:25 Z HoneyBadger Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 21868 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());


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)];
            }
        }
    }

}

int ans;
str s;


void solveq(int i = 0, int mask = 0) {
    if (i == n) {
        ans += a[mask];
        return;
    }
    mask <<= 1;
    if (s[i] == '?') {
        solveq(i + 1, mask);
        solveq(i + 1, mask ^ 1);
    } else {
        solveq(i + 1, mask ^ (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;
    }
    mask <<= 1;
    if (s[i] == '1') {
        solve1(i + 1, mask ^ 1, del);
        solve1(i + 1, mask, del ^ 1);  
    } else {
        solve1(i + 1, mask ^ (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;
    }
    mask <<= 1;
    if (s[i] == '0') {
        solve0(i + 1, mask ^ 1, del ^ 1);
        solve0(i + 1, mask, del);
    } else {
        solve0(i + 1, mask ^ (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 && pq <= p0) {
            solveq();
        } else if (p1 <= pq && p1 <= p0) {
            solve1();
        } else {    
            solve0();
        }
        cout << ans << '\n';
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 208 ms 4480 KB Output is correct
12 Correct 210 ms 4204 KB Output is correct
13 Correct 259 ms 3540 KB Output is correct
14 Correct 303 ms 3436 KB Output is correct
15 Correct 238 ms 4460 KB Output is correct
16 Correct 304 ms 3564 KB Output is correct
17 Correct 281 ms 3564 KB Output is correct
18 Correct 220 ms 5484 KB Output is correct
19 Correct 206 ms 2540 KB Output is correct
20 Correct 212 ms 4076 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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 208 ms 4480 KB Output is correct
12 Correct 210 ms 4204 KB Output is correct
13 Correct 259 ms 3540 KB Output is correct
14 Correct 303 ms 3436 KB Output is correct
15 Correct 238 ms 4460 KB Output is correct
16 Correct 304 ms 3564 KB Output is correct
17 Correct 281 ms 3564 KB Output is correct
18 Correct 220 ms 5484 KB Output is correct
19 Correct 206 ms 2540 KB Output is correct
20 Correct 212 ms 4076 KB Output is correct
21 Correct 225 ms 4460 KB Output is correct
22 Correct 224 ms 4716 KB Output is correct
23 Correct 360 ms 3948 KB Output is correct
24 Correct 503 ms 3692 KB Output is correct
25 Correct 291 ms 5740 KB Output is correct
26 Correct 461 ms 4076 KB Output is correct
27 Correct 396 ms 4076 KB Output is correct
28 Correct 220 ms 6508 KB Output is correct
29 Correct 214 ms 2540 KB Output is correct
30 Correct 226 ms 4716 KB Output is correct
31 Correct 334 ms 4588 KB Output is correct
32 Correct 500 ms 4588 KB Output is correct
33 Correct 274 ms 3528 KB Output is correct
34 Correct 452 ms 3564 KB Output is correct
35 Correct 416 ms 4204 KB Output is correct
36 Correct 208 ms 2628 KB Output is correct
37 Correct 222 ms 4460 KB Output is correct
38 Correct 211 ms 2540 KB Output is correct
39 Correct 337 ms 3692 KB Output is correct
40 Correct 497 ms 3692 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 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 63 ms 17004 KB Output is correct
12 Correct 66 ms 17004 KB Output is correct
13 Correct 105 ms 17004 KB Output is correct
14 Correct 145 ms 17004 KB Output is correct
15 Correct 74 ms 17132 KB Output is correct
16 Correct 169 ms 17004 KB Output is correct
17 Correct 148 ms 17004 KB Output is correct
18 Correct 60 ms 17132 KB Output is correct
19 Correct 65 ms 16876 KB Output is correct
20 Correct 64 ms 17004 KB Output is correct
21 Correct 101 ms 17060 KB Output is correct
22 Correct 145 ms 17024 KB Output is correct
23 Correct 79 ms 16876 KB Output is correct
24 Correct 155 ms 17004 KB Output is correct
25 Correct 142 ms 17004 KB Output is correct
26 Correct 60 ms 16876 KB Output is correct
27 Correct 65 ms 17004 KB Output is correct
28 Correct 64 ms 16876 KB Output is correct
29 Correct 99 ms 16876 KB Output is correct
30 Correct 151 ms 17044 KB Output is correct
31 Correct 77 ms 17004 KB Output is correct
32 Correct 172 ms 17004 KB Output is correct
33 Correct 141 ms 17004 KB Output is correct
34 Correct 63 ms 16876 KB Output is correct
35 Correct 114 ms 17004 KB Output is correct
36 Correct 115 ms 17004 KB Output is correct
37 Correct 115 ms 17004 KB Output is correct
38 Correct 115 ms 17004 KB Output is correct
39 Correct 112 ms 17004 KB Output is correct
40 Correct 116 ms 17004 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 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 208 ms 4480 KB Output is correct
12 Correct 210 ms 4204 KB Output is correct
13 Correct 259 ms 3540 KB Output is correct
14 Correct 303 ms 3436 KB Output is correct
15 Correct 238 ms 4460 KB Output is correct
16 Correct 304 ms 3564 KB Output is correct
17 Correct 281 ms 3564 KB Output is correct
18 Correct 220 ms 5484 KB Output is correct
19 Correct 206 ms 2540 KB Output is correct
20 Correct 212 ms 4076 KB Output is correct
21 Correct 225 ms 4460 KB Output is correct
22 Correct 224 ms 4716 KB Output is correct
23 Correct 360 ms 3948 KB Output is correct
24 Correct 503 ms 3692 KB Output is correct
25 Correct 291 ms 5740 KB Output is correct
26 Correct 461 ms 4076 KB Output is correct
27 Correct 396 ms 4076 KB Output is correct
28 Correct 220 ms 6508 KB Output is correct
29 Correct 214 ms 2540 KB Output is correct
30 Correct 226 ms 4716 KB Output is correct
31 Correct 334 ms 4588 KB Output is correct
32 Correct 500 ms 4588 KB Output is correct
33 Correct 274 ms 3528 KB Output is correct
34 Correct 452 ms 3564 KB Output is correct
35 Correct 416 ms 4204 KB Output is correct
36 Correct 208 ms 2628 KB Output is correct
37 Correct 222 ms 4460 KB Output is correct
38 Correct 211 ms 2540 KB Output is correct
39 Correct 337 ms 3692 KB Output is correct
40 Correct 497 ms 3692 KB Output is correct
41 Correct 63 ms 17004 KB Output is correct
42 Correct 66 ms 17004 KB Output is correct
43 Correct 105 ms 17004 KB Output is correct
44 Correct 145 ms 17004 KB Output is correct
45 Correct 74 ms 17132 KB Output is correct
46 Correct 169 ms 17004 KB Output is correct
47 Correct 148 ms 17004 KB Output is correct
48 Correct 60 ms 17132 KB Output is correct
49 Correct 65 ms 16876 KB Output is correct
50 Correct 64 ms 17004 KB Output is correct
51 Correct 101 ms 17060 KB Output is correct
52 Correct 145 ms 17024 KB Output is correct
53 Correct 79 ms 16876 KB Output is correct
54 Correct 155 ms 17004 KB Output is correct
55 Correct 142 ms 17004 KB Output is correct
56 Correct 60 ms 16876 KB Output is correct
57 Correct 65 ms 17004 KB Output is correct
58 Correct 64 ms 16876 KB Output is correct
59 Correct 99 ms 16876 KB Output is correct
60 Correct 151 ms 17044 KB Output is correct
61 Correct 77 ms 17004 KB Output is correct
62 Correct 172 ms 17004 KB Output is correct
63 Correct 141 ms 17004 KB Output is correct
64 Correct 63 ms 16876 KB Output is correct
65 Correct 114 ms 17004 KB Output is correct
66 Correct 115 ms 17004 KB Output is correct
67 Correct 115 ms 17004 KB Output is correct
68 Correct 115 ms 17004 KB Output is correct
69 Correct 112 ms 17004 KB Output is correct
70 Correct 116 ms 17004 KB Output is correct
71 Correct 335 ms 21868 KB Output is correct
72 Correct 354 ms 21868 KB Output is correct
73 Correct 1045 ms 20668 KB Output is correct
74 Execution timed out 2041 ms 20812 KB Time limit exceeded
75 Halted 0 ms 0 KB -