oj.uz

답안 #262917

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
262917 2020-08-13T11:06:31 Z AM1648 Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 1663 ms 39292 KB 
/* be name khoda */

// #define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <fstream>
#include <set>
#include <map>
using namespace std;

#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif

typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;

#define forifrom(i, s, n) for (ll i = s; i < n; ++i)
#define forirto(i, n, e) for (ll i = (n) - 1; i >= e; --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)

#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))

#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl

const ll MOD = 1000000007;
const ll INF = 2000000000;
const long long BIG = 1446803456761533460LL;

#define XL (x << 1)
#define XR (XL | 1)
#define MD ((l + r) >> 1)
#define Add(a, b) a = ((a) + (b)) % MOD
#define Mul(a, b) a = (1LL * (a) * (b)) % MOD

// -----------------------------------------------------------------------

const ll maxn = 20;
const ll maxn2 = 1 << maxn;

ll L, N, Q, dp[2][maxn2]; // dp[1] is over reversed S
string S; // inc-exc SOS over L/3 of masks

void calc(string &S, ll *dp) {
    fori (i, N) dp[i] = S[i] - '0';
    fori (i, L) forir (j, N) {
        if (j >> i & 1) dp[j] += dp[j ^ (1 << i)];
    }
}

ll inc_exc(string &q, ll *dp) {
    ll a = 0, t = 0;
    fori (i, L) {
        if (q[i] == '?') t ^= 1 << (L - 1 - i);
        else if (q[i] == '1') a ^= 1 << (L - 1 - i);
    }
    ll s = dp[t ^ a];
    for (ll b = a; b; b = (b - 1) & a) {
        ll pc = __builtin_popcount(b);
        ll v = dp[t ^ a ^ b];
        if (pc % 2) s -= v;
        else s += v;
    }
    return s;
}

ll naive(string &q) {
    ll a = 0, t = 0;
    fori (i, L) {
        if (q[i] == '?') a ^= 1 << (L - 1 - i);
        else if (q[i] == '1') t ^= 1 << (L - 1 - i);
    }
    ll s = S[t] - '0';
    for (ll b = a; b; b = (b - 1) & a) {
        s += S[t ^ b] - '0';
    }
    return s;
}

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    cin >> L >> Q >> S;
    N = 1 << L;
    calc(S, dp[0]);
    reverse(all(S));
    calc(S, dp[1]);
    reverse(all(S));
    fori (qi, Q) {
        string q; cin >> q;
        ll c[3] = {0, 0, 0};
        fori (i, L) {
            if (q[i] == '?') c[2]++;
            else c[q[i] - '0']++;
        }
        ll ans = 0;
        if (c[0] <= c[1] && c[0] <= c[2]) {
            fori (i, L) if (q[i] != '?') q[i] ^= 1;
            ans = inc_exc(q, dp[1]);
        } else if (c[1] <= c[0] && c[1] <= c[2]) {
            ans = inc_exc(q, dp[0]);
        } else {
            ans = naive(q);
        }
        cout << ans << '\n';
    }

}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 308 ms 15148 KB Output is correct
12 Correct 313 ms 14824 KB Output is correct
13 Correct 318 ms 14044 KB Output is correct
14 Correct 330 ms 14200 KB Output is correct
15 Correct 320 ms 15228 KB Output is correct
16 Correct 372 ms 14328 KB Output is correct
17 Correct 384 ms 14328 KB Output is correct
18 Correct 231 ms 16120 KB Output is correct
19 Correct 262 ms 13176 KB Output is correct
20 Correct 356 ms 14844 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 308 ms 15148 KB Output is correct
12 Correct 313 ms 14824 KB Output is correct
13 Correct 318 ms 14044 KB Output is correct
14 Correct 330 ms 14200 KB Output is correct
15 Correct 320 ms 15228 KB Output is correct
16 Correct 372 ms 14328 KB Output is correct
17 Correct 384 ms 14328 KB Output is correct
18 Correct 231 ms 16120 KB Output is correct
19 Correct 262 ms 13176 KB Output is correct
20 Correct 356 ms 14844 KB Output is correct
21 Correct 392 ms 18168 KB Output is correct
22 Correct 366 ms 18280 KB Output is correct
23 Correct 375 ms 17528 KB Output is correct
24 Correct 419 ms 17144 KB Output is correct
25 Correct 402 ms 19132 KB Output is correct
26 Correct 469 ms 17788 KB Output is correct
27 Correct 454 ms 17656 KB Output is correct
28 Correct 261 ms 20216 KB Output is correct
29 Correct 326 ms 16100 KB Output is correct
30 Correct 451 ms 18296 KB Output is correct
31 Correct 458 ms 18264 KB Output is correct
32 Correct 508 ms 18228 KB Output is correct
33 Correct 370 ms 17052 KB Output is correct
34 Correct 450 ms 17216 KB Output is correct
35 Correct 469 ms 17656 KB Output is correct
36 Correct 278 ms 16120 KB Output is correct
37 Correct 330 ms 18168 KB Output is correct
38 Correct 308 ms 16244 KB Output is correct
39 Correct 432 ms 17400 KB Output is correct
40 Correct 494 ms 17280 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 105 ms 12020 KB Output is correct
12 Correct 98 ms 12060 KB Output is correct
13 Correct 108 ms 11928 KB Output is correct
14 Correct 119 ms 11928 KB Output is correct
15 Correct 103 ms 12060 KB Output is correct
16 Correct 129 ms 11928 KB Output is correct
17 Correct 125 ms 12052 KB Output is correct
18 Correct 86 ms 12184 KB Output is correct
19 Correct 91 ms 11800 KB Output is correct
20 Correct 104 ms 12056 KB Output is correct
21 Correct 115 ms 12056 KB Output is correct
22 Correct 132 ms 12060 KB Output is correct
23 Correct 97 ms 11928 KB Output is correct
24 Correct 135 ms 12088 KB Output is correct
25 Correct 124 ms 11932 KB Output is correct
26 Correct 89 ms 11804 KB Output is correct
27 Correct 101 ms 12060 KB Output is correct
28 Correct 94 ms 11800 KB Output is correct
29 Correct 116 ms 11924 KB Output is correct
30 Correct 102 ms 11928 KB Output is correct
31 Correct 98 ms 11928 KB Output is correct
32 Correct 179 ms 11928 KB Output is correct
33 Correct 143 ms 11928 KB Output is correct
34 Correct 88 ms 11800 KB Output is correct
35 Correct 122 ms 12056 KB Output is correct
36 Correct 126 ms 11924 KB Output is correct
37 Correct 119 ms 11936 KB Output is correct
38 Correct 115 ms 11932 KB Output is correct
39 Correct 119 ms 12184 KB Output is correct
40 Correct 115 ms 12056 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 308 ms 15148 KB Output is correct
12 Correct 313 ms 14824 KB Output is correct
13 Correct 318 ms 14044 KB Output is correct
14 Correct 330 ms 14200 KB Output is correct
15 Correct 320 ms 15228 KB Output is correct
16 Correct 372 ms 14328 KB Output is correct
17 Correct 384 ms 14328 KB Output is correct
18 Correct 231 ms 16120 KB Output is correct
19 Correct 262 ms 13176 KB Output is correct
20 Correct 356 ms 14844 KB Output is correct
21 Correct 392 ms 18168 KB Output is correct
22 Correct 366 ms 18280 KB Output is correct
23 Correct 375 ms 17528 KB Output is correct
24 Correct 419 ms 17144 KB Output is correct
25 Correct 402 ms 19132 KB Output is correct
26 Correct 469 ms 17788 KB Output is correct
27 Correct 454 ms 17656 KB Output is correct
28 Correct 261 ms 20216 KB Output is correct
29 Correct 326 ms 16100 KB Output is correct
30 Correct 451 ms 18296 KB Output is correct
31 Correct 458 ms 18264 KB Output is correct
32 Correct 508 ms 18228 KB Output is correct
33 Correct 370 ms 17052 KB Output is correct
34 Correct 450 ms 17216 KB Output is correct
35 Correct 469 ms 17656 KB Output is correct
36 Correct 278 ms 16120 KB Output is correct
37 Correct 330 ms 18168 KB Output is correct
38 Correct 308 ms 16244 KB Output is correct
39 Correct 432 ms 17400 KB Output is correct
40 Correct 494 ms 17280 KB Output is correct
41 Correct 105 ms 12020 KB Output is correct
42 Correct 98 ms 12060 KB Output is correct
43 Correct 108 ms 11928 KB Output is correct
44 Correct 119 ms 11928 KB Output is correct
45 Correct 103 ms 12060 KB Output is correct
46 Correct 129 ms 11928 KB Output is correct
47 Correct 125 ms 12052 KB Output is correct
48 Correct 86 ms 12184 KB Output is correct
49 Correct 91 ms 11800 KB Output is correct
50 Correct 104 ms 12056 KB Output is correct
51 Correct 115 ms 12056 KB Output is correct
52 Correct 132 ms 12060 KB Output is correct
53 Correct 97 ms 11928 KB Output is correct
54 Correct 135 ms 12088 KB Output is correct
55 Correct 124 ms 11932 KB Output is correct
56 Correct 89 ms 11804 KB Output is correct
57 Correct 101 ms 12060 KB Output is correct
58 Correct 94 ms 11800 KB Output is correct
59 Correct 116 ms 11924 KB Output is correct
60 Correct 102 ms 11928 KB Output is correct
61 Correct 98 ms 11928 KB Output is correct
62 Correct 179 ms 11928 KB Output is correct
63 Correct 143 ms 11928 KB Output is correct
64 Correct 88 ms 11800 KB Output is correct
65 Correct 122 ms 12056 KB Output is correct
66 Correct 126 ms 11924 KB Output is correct
67 Correct 119 ms 11936 KB Output is correct
68 Correct 115 ms 11932 KB Output is correct
69 Correct 119 ms 12184 KB Output is correct
70 Correct 115 ms 12056 KB Output is correct
71 Correct 764 ms 36444 KB Output is correct
72 Correct 628 ms 36500 KB Output is correct
73 Correct 724 ms 35120 KB Output is correct
74 Correct 1145 ms 35464 KB Output is correct
75 Correct 721 ms 37264 KB Output is correct
76 Correct 1473 ms 35720 KB Output is correct
77 Correct 1317 ms 35468 KB Output is correct
78 Correct 468 ms 39292 KB Output is correct
79 Correct 590 ms 33304 KB Output is correct
80 Correct 808 ms 36452 KB Output is correct
81 Correct 1092 ms 36328 KB Output is correct
82 Correct 1357 ms 35328 KB Output is correct
83 Correct 664 ms 34452 KB Output is correct
84 Correct 1410 ms 35300 KB Output is correct
85 Correct 1221 ms 35484 KB Output is correct
86 Correct 468 ms 33304 KB Output is correct
87 Correct 617 ms 36372 KB Output is correct
88 Correct 565 ms 33380 KB Output is correct
89 Correct 934 ms 34968 KB Output is correct
90 Correct 723 ms 35356 KB Output is correct
91 Correct 583 ms 34456 KB Output is correct
92 Correct 1663 ms 35636 KB Output is correct
93 Correct 1228 ms 35736 KB Output is correct
94 Correct 436 ms 33420 KB Output is correct
95 Correct 1047 ms 35416 KB Output is correct
96 Correct 1022 ms 35476 KB Output is correct
97 Correct 1020 ms 35652 KB Output is correct
98 Correct 1043 ms 35508 KB Output is correct
99 Correct 1016 ms 35700 KB Output is correct
100 Correct 1105 ms 35448 KB Output is correct