oj.uz

Submission #991644

# Submission time Handle Problem Language Result Execution time Memory
991644 2024-06-02T17:38:52 Z GrindMachine Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 1096 ms 33768 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
 
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
 
template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}
 
template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}
 
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
 
/*
 
 
 
*/
 
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    int n,q; cin >> n >> q;
    string s; cin >> s;
    int B = max(n/2,1);
    amin(B,7);

    vector<int> pow3(n+5);
    pow3[0] = 1;
    rep1(i,n) pow3[i] = pow3[i-1]*3;
 
    vector<pii> queries(q);
    rep(id,q){
        string t; cin >> t;
        int first_t = 0, last_t = 0;
        rep(i,sz(t)){
            ll x = 0;
            if(t[i] == '0') x = 0;
            if(t[i] == '1') x = 1;
            if(t[i] == '?') x = 2;
            if(i < B) first_t = first_t*3+x;
            else last_t = last_t*3+x;
        }
 
        queries[id] = {first_t,last_t};
    }
    
    vector<int> maskf(1<<(n-B));
    rep(i,1<<(n-B)){
        int mask = 0;
        rep(bit,n-B){
            int b = 0;
            if(i&(1<<bit)) b = 1;
            mask += pow3[bit]*b;
        }

        maskf[i] = mask;
    }

    vector<int> lsqf(pow3[n-B],-1);
    rep(i,pow3[n-B]){
        int x = i;
        int pos = 0;
        while(x){
            int b = x%3;
            x /= 3;
            if(b == 2){
                lsqf[i] = pos;
                break;
            }
            pos++;
        }
    }
    
    vector<int> ans(q);
    vector<int> dp(pow3[n-B]);
    vector<bool> ok(pow3[B]);

    rep(mask1,1<<B){
        fill(all(dp),0);
 
        rep(i,1<<n){
            int firstB = i>>(n-B);
            int lastB = i^(firstB<<(n-B));
            if(firstB != mask1) conts;
            dp[maskf[lastB]] += s[i]-'0';
        }

        rep(mask2,pow3[n-B]){
            int lsq = lsqf[mask2];
            if(lsq == -1) conts;
            rep(x,2){
                int mask3 = mask2-pow3[lsq]*2+pow3[lsq]*x;
                dp[mask2] += dp[mask3];
            }
        }
        
        rep(mask2,pow3[B]){
            ok[mask2] = 1;        
            int mask2_copy = mask2;
            rev(b,B-1,0){
                int b1 = mask2_copy%3;
                mask2_copy /= 3;
                int b2 = 0;
                if(mask1&(1<<(B-b-1))) b2 = 1;
                if(b1 != 2 and b1 != b2){
                    ok[mask2] = 0;
                    break;
                }
            }
        }
        
        rep(id,q){
            ans[id] += ok[queries[id].ff]*dp[queries[id].ss];
        }
    }
 
    rep(i,q) cout << ans[i] << endl;
}
 
int main()
{
    fastio;
 
    int t = 1;
    // cin >> t;
 
    rep1(i, t) {
        solve(i);
    }
 
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 167 ms 16212 KB Output is correct
12 Correct 145 ms 15712 KB Output is correct
13 Correct 182 ms 14944 KB Output is correct
14 Correct 156 ms 15188 KB Output is correct
15 Correct 159 ms 16212 KB Output is correct
16 Correct 173 ms 15188 KB Output is correct
17 Correct 184 ms 15188 KB Output is correct
18 Correct 164 ms 17000 KB Output is correct
19 Correct 178 ms 14164 KB Output is correct
20 Correct 182 ms 15696 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 167 ms 16212 KB Output is correct
12 Correct 145 ms 15712 KB Output is correct
13 Correct 182 ms 14944 KB Output is correct
14 Correct 156 ms 15188 KB Output is correct
15 Correct 159 ms 16212 KB Output is correct
16 Correct 173 ms 15188 KB Output is correct
17 Correct 184 ms 15188 KB Output is correct
18 Correct 164 ms 17000 KB Output is correct
19 Correct 178 ms 14164 KB Output is correct
20 Correct 182 ms 15696 KB Output is correct
21 Correct 236 ms 16228 KB Output is correct
22 Correct 211 ms 16208 KB Output is correct
23 Correct 224 ms 15212 KB Output is correct
24 Correct 218 ms 15184 KB Output is correct
25 Correct 221 ms 17232 KB Output is correct
26 Correct 244 ms 15696 KB Output is correct
27 Correct 241 ms 15464 KB Output is correct
28 Correct 189 ms 18260 KB Output is correct
29 Correct 233 ms 14164 KB Output is correct
30 Correct 245 ms 16208 KB Output is correct
31 Correct 257 ms 16228 KB Output is correct
32 Correct 271 ms 16136 KB Output is correct
33 Correct 255 ms 14968 KB Output is correct
34 Correct 229 ms 15220 KB Output is correct
35 Correct 248 ms 15480 KB Output is correct
36 Correct 226 ms 14200 KB Output is correct
37 Correct 200 ms 16208 KB Output is correct
38 Correct 264 ms 14200 KB Output is correct
39 Correct 239 ms 15208 KB Output is correct
40 Correct 225 ms 15184 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 449 ms 14592 KB Output is correct
12 Correct 473 ms 14832 KB Output is correct
13 Correct 480 ms 14592 KB Output is correct
14 Correct 499 ms 14592 KB Output is correct
15 Correct 432 ms 14836 KB Output is correct
16 Correct 436 ms 14760 KB Output is correct
17 Correct 455 ms 14592 KB Output is correct
18 Correct 473 ms 14940 KB Output is correct
19 Correct 461 ms 14592 KB Output is correct
20 Correct 444 ms 14592 KB Output is correct
21 Correct 420 ms 14592 KB Output is correct
22 Correct 476 ms 14556 KB Output is correct
23 Correct 429 ms 14592 KB Output is correct
24 Correct 447 ms 14592 KB Output is correct
25 Correct 459 ms 14592 KB Output is correct
26 Correct 474 ms 14580 KB Output is correct
27 Correct 471 ms 14592 KB Output is correct
28 Correct 441 ms 14572 KB Output is correct
29 Correct 521 ms 14588 KB Output is correct
30 Correct 479 ms 14592 KB Output is correct
31 Correct 451 ms 14584 KB Output is correct
32 Correct 454 ms 14588 KB Output is correct
33 Correct 462 ms 14580 KB Output is correct
34 Correct 499 ms 14428 KB Output is correct
35 Correct 526 ms 14588 KB Output is correct
36 Correct 486 ms 14576 KB Output is correct
37 Correct 498 ms 14592 KB Output is correct
38 Correct 563 ms 14580 KB Output is correct
39 Correct 458 ms 14556 KB Output is correct
40 Correct 554 ms 14592 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 167 ms 16212 KB Output is correct
12 Correct 145 ms 15712 KB Output is correct
13 Correct 182 ms 14944 KB Output is correct
14 Correct 156 ms 15188 KB Output is correct
15 Correct 159 ms 16212 KB Output is correct
16 Correct 173 ms 15188 KB Output is correct
17 Correct 184 ms 15188 KB Output is correct
18 Correct 164 ms 17000 KB Output is correct
19 Correct 178 ms 14164 KB Output is correct
20 Correct 182 ms 15696 KB Output is correct
21 Correct 236 ms 16228 KB Output is correct
22 Correct 211 ms 16208 KB Output is correct
23 Correct 224 ms 15212 KB Output is correct
24 Correct 218 ms 15184 KB Output is correct
25 Correct 221 ms 17232 KB Output is correct
26 Correct 244 ms 15696 KB Output is correct
27 Correct 241 ms 15464 KB Output is correct
28 Correct 189 ms 18260 KB Output is correct
29 Correct 233 ms 14164 KB Output is correct
30 Correct 245 ms 16208 KB Output is correct
31 Correct 257 ms 16228 KB Output is correct
32 Correct 271 ms 16136 KB Output is correct
33 Correct 255 ms 14968 KB Output is correct
34 Correct 229 ms 15220 KB Output is correct
35 Correct 248 ms 15480 KB Output is correct
36 Correct 226 ms 14200 KB Output is correct
37 Correct 200 ms 16208 KB Output is correct
38 Correct 264 ms 14200 KB Output is correct
39 Correct 239 ms 15208 KB Output is correct
40 Correct 225 ms 15184 KB Output is correct
41 Correct 449 ms 14592 KB Output is correct
42 Correct 473 ms 14832 KB Output is correct
43 Correct 480 ms 14592 KB Output is correct
44 Correct 499 ms 14592 KB Output is correct
45 Correct 432 ms 14836 KB Output is correct
46 Correct 436 ms 14760 KB Output is correct
47 Correct 455 ms 14592 KB Output is correct
48 Correct 473 ms 14940 KB Output is correct
49 Correct 461 ms 14592 KB Output is correct
50 Correct 444 ms 14592 KB Output is correct
51 Correct 420 ms 14592 KB Output is correct
52 Correct 476 ms 14556 KB Output is correct
53 Correct 429 ms 14592 KB Output is correct
54 Correct 447 ms 14592 KB Output is correct
55 Correct 459 ms 14592 KB Output is correct
56 Correct 474 ms 14580 KB Output is correct
57 Correct 471 ms 14592 KB Output is correct
58 Correct 441 ms 14572 KB Output is correct
59 Correct 521 ms 14588 KB Output is correct
60 Correct 479 ms 14592 KB Output is correct
61 Correct 451 ms 14584 KB Output is correct
62 Correct 454 ms 14588 KB Output is correct
63 Correct 462 ms 14580 KB Output is correct
64 Correct 499 ms 14428 KB Output is correct
65 Correct 526 ms 14588 KB Output is correct
66 Correct 486 ms 14576 KB Output is correct
67 Correct 498 ms 14592 KB Output is correct
68 Correct 563 ms 14580 KB Output is correct
69 Correct 458 ms 14556 KB Output is correct
70 Correct 554 ms 14592 KB Output is correct
71 Correct 904 ms 30700 KB Output is correct
72 Correct 872 ms 30940 KB Output is correct
73 Correct 957 ms 29408 KB Output is correct
74 Correct 968 ms 29684 KB Output is correct
75 Correct 910 ms 31720 KB Output is correct
76 Correct 1053 ms 29924 KB Output is correct
77 Correct 983 ms 29920 KB Output is correct
78 Correct 791 ms 33768 KB Output is correct
79 Correct 899 ms 27620 KB Output is correct
80 Correct 817 ms 30948 KB Output is correct
81 Correct 1096 ms 30688 KB Output is correct
82 Correct 984 ms 29660 KB Output is correct
83 Correct 912 ms 28892 KB Output is correct
84 Correct 990 ms 29664 KB Output is correct
85 Correct 958 ms 29920 KB Output is correct
86 Correct 843 ms 27616 KB Output is correct
87 Correct 772 ms 30688 KB Output is correct
88 Correct 887 ms 27616 KB Output is correct
89 Correct 975 ms 29424 KB Output is correct
90 Correct 988 ms 29668 KB Output is correct
91 Correct 945 ms 28904 KB Output is correct
92 Correct 922 ms 29920 KB Output is correct
93 Correct 1024 ms 29916 KB Output is correct
94 Correct 836 ms 27612 KB Output is correct
95 Correct 972 ms 29688 KB Output is correct
96 Correct 941 ms 29920 KB Output is correct
97 Correct 948 ms 29936 KB Output is correct
98 Correct 946 ms 29916 KB Output is correct
99 Correct 959 ms 29920 KB Output is correct
100 Correct 969 ms 29936 KB Output is correct