oj.uz

Submission #991640

# Submission time Handle Problem Language Result Execution time Memory
991640 2024-06-02T17:26:34 Z GrindMachine Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 1654 ms 27120 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;
 
int8_t ok_mem[6561][256];

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

    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> get_mask_mem(1<<(n-B),-2);
 
    auto get_mask = [&](ll x){
        if(get_mask_mem[x] != -2) return get_mask_mem[x];
 
        int mask = 0;
        rep(bit,n-B){
            int b = 0;
            if(x&(1<<bit)) b = 1;
            mask += pow3[bit]*b;
        }
 
        return get_mask_mem[x] = mask;
    };
 
    vector<int> get_lsq_mem(pow3[n-B],-2);
 
    auto get_lsq = [&](ll x){
        if(get_lsq_mem[x] != -2) return get_lsq_mem[x];
 
        int ox = x;
        int pos = 0;
        while(x){
            int b = x%3;
            x /= 3;
            if(b == 2) return get_lsq_mem[ox] = pos;
            pos++; 
        }
    
        return get_lsq_mem[ox] = -1;        
    };
 
    memset(ok_mem,-1,sizeof ok_mem);
 
    auto ok = [&](int mask1, int mask2){
        if(ok_mem[mask1][mask2] != -1) return ok_mem[mask1][mask2];
        auto omask1 = mask1, omask2 = mask2;
 
        rev(b,B-1,0){
            int b1 = 0, b2 = 0;
            b1 = mask1%3;
            mask1 /= 3;
            if(mask2&(1<<(B-b-1))) b2 = 1;
 
            if(b1 == 2 or b1 == b2){
 
            }
            else{
                return ok_mem[omask1][omask2] = false;
            }
        }
 
        return ok_mem[omask1][omask2] = true;
    };
 
    vector<int> ans(q);
    vector<int> dp(pow3[n-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[get_mask(lastB)] += s[i]-'0';
        }
 
        rep(mask2,pow3[n-B]){
            int lsq = get_lsq(mask2);
            if(lsq == -1) conts;
            rep(x,2){
                int mask3 = mask2-pow3[lsq]*2+pow3[lsq]*x;
                dp[mask2] += dp[mask3];
            }
        }
 
        rep(id,q){
            if(ok(queries[id].ff,mask1)){
                ans[id] += 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 1880 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 1880 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 1880 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 261 ms 17768 KB Output is correct
12 Correct 223 ms 17488 KB Output is correct
13 Correct 200 ms 16720 KB Output is correct
14 Correct 210 ms 16724 KB Output is correct
15 Correct 260 ms 17748 KB Output is correct
16 Correct 226 ms 17004 KB Output is correct
17 Correct 221 ms 16976 KB Output is correct
18 Correct 159 ms 18772 KB Output is correct
19 Correct 177 ms 15696 KB Output is correct
20 Correct 253 ms 17516 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 1880 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 261 ms 17768 KB Output is correct
12 Correct 223 ms 17488 KB Output is correct
13 Correct 200 ms 16720 KB Output is correct
14 Correct 210 ms 16724 KB Output is correct
15 Correct 260 ms 17748 KB Output is correct
16 Correct 226 ms 17004 KB Output is correct
17 Correct 221 ms 16976 KB Output is correct
18 Correct 159 ms 18772 KB Output is correct
19 Correct 177 ms 15696 KB Output is correct
20 Correct 253 ms 17516 KB Output is correct
21 Correct 335 ms 17744 KB Output is correct
22 Correct 323 ms 17968 KB Output is correct
23 Correct 276 ms 16980 KB Output is correct
24 Correct 283 ms 16684 KB Output is correct
25 Correct 406 ms 18792 KB Output is correct
26 Correct 354 ms 17236 KB Output is correct
27 Correct 312 ms 17236 KB Output is correct
28 Correct 212 ms 19796 KB Output is correct
29 Correct 246 ms 15700 KB Output is correct
30 Correct 364 ms 18036 KB Output is correct
31 Correct 335 ms 17792 KB Output is correct
32 Correct 308 ms 17792 KB Output is correct
33 Correct 271 ms 16720 KB Output is correct
34 Correct 299 ms 16760 KB Output is correct
35 Correct 305 ms 17232 KB Output is correct
36 Correct 185 ms 15744 KB Output is correct
37 Correct 329 ms 17772 KB Output is correct
38 Correct 258 ms 15696 KB Output is correct
39 Correct 285 ms 16940 KB Output is correct
40 Correct 286 ms 16748 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 1880 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 386 ms 7924 KB Output is correct
12 Correct 400 ms 8140 KB Output is correct
13 Correct 436 ms 7924 KB Output is correct
14 Correct 439 ms 7896 KB Output is correct
15 Correct 438 ms 8144 KB Output is correct
16 Correct 444 ms 7888 KB Output is correct
17 Correct 430 ms 7880 KB Output is correct
18 Correct 372 ms 8160 KB Output is correct
19 Correct 387 ms 7884 KB Output is correct
20 Correct 384 ms 7904 KB Output is correct
21 Correct 454 ms 7888 KB Output is correct
22 Correct 432 ms 7920 KB Output is correct
23 Correct 412 ms 7920 KB Output is correct
24 Correct 478 ms 7924 KB Output is correct
25 Correct 426 ms 7900 KB Output is correct
26 Correct 358 ms 7920 KB Output is correct
27 Correct 374 ms 7920 KB Output is correct
28 Correct 374 ms 7924 KB Output is correct
29 Correct 421 ms 7884 KB Output is correct
30 Correct 467 ms 7880 KB Output is correct
31 Correct 399 ms 7896 KB Output is correct
32 Correct 436 ms 7920 KB Output is correct
33 Correct 444 ms 7920 KB Output is correct
34 Correct 357 ms 7896 KB Output is correct
35 Correct 463 ms 7900 KB Output is correct
36 Correct 500 ms 7924 KB Output is correct
37 Correct 455 ms 7908 KB Output is correct
38 Correct 493 ms 7924 KB Output is correct
39 Correct 443 ms 7900 KB Output is correct
40 Correct 441 ms 7924 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 1880 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1880 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 261 ms 17768 KB Output is correct
12 Correct 223 ms 17488 KB Output is correct
13 Correct 200 ms 16720 KB Output is correct
14 Correct 210 ms 16724 KB Output is correct
15 Correct 260 ms 17748 KB Output is correct
16 Correct 226 ms 17004 KB Output is correct
17 Correct 221 ms 16976 KB Output is correct
18 Correct 159 ms 18772 KB Output is correct
19 Correct 177 ms 15696 KB Output is correct
20 Correct 253 ms 17516 KB Output is correct
21 Correct 335 ms 17744 KB Output is correct
22 Correct 323 ms 17968 KB Output is correct
23 Correct 276 ms 16980 KB Output is correct
24 Correct 283 ms 16684 KB Output is correct
25 Correct 406 ms 18792 KB Output is correct
26 Correct 354 ms 17236 KB Output is correct
27 Correct 312 ms 17236 KB Output is correct
28 Correct 212 ms 19796 KB Output is correct
29 Correct 246 ms 15700 KB Output is correct
30 Correct 364 ms 18036 KB Output is correct
31 Correct 335 ms 17792 KB Output is correct
32 Correct 308 ms 17792 KB Output is correct
33 Correct 271 ms 16720 KB Output is correct
34 Correct 299 ms 16760 KB Output is correct
35 Correct 305 ms 17232 KB Output is correct
36 Correct 185 ms 15744 KB Output is correct
37 Correct 329 ms 17772 KB Output is correct
38 Correct 258 ms 15696 KB Output is correct
39 Correct 285 ms 16940 KB Output is correct
40 Correct 286 ms 16748 KB Output is correct
41 Correct 386 ms 7924 KB Output is correct
42 Correct 400 ms 8140 KB Output is correct
43 Correct 436 ms 7924 KB Output is correct
44 Correct 439 ms 7896 KB Output is correct
45 Correct 438 ms 8144 KB Output is correct
46 Correct 444 ms 7888 KB Output is correct
47 Correct 430 ms 7880 KB Output is correct
48 Correct 372 ms 8160 KB Output is correct
49 Correct 387 ms 7884 KB Output is correct
50 Correct 384 ms 7904 KB Output is correct
51 Correct 454 ms 7888 KB Output is correct
52 Correct 432 ms 7920 KB Output is correct
53 Correct 412 ms 7920 KB Output is correct
54 Correct 478 ms 7924 KB Output is correct
55 Correct 426 ms 7900 KB Output is correct
56 Correct 358 ms 7920 KB Output is correct
57 Correct 374 ms 7920 KB Output is correct
58 Correct 374 ms 7924 KB Output is correct
59 Correct 421 ms 7884 KB Output is correct
60 Correct 467 ms 7880 KB Output is correct
61 Correct 399 ms 7896 KB Output is correct
62 Correct 436 ms 7920 KB Output is correct
63 Correct 444 ms 7920 KB Output is correct
64 Correct 357 ms 7896 KB Output is correct
65 Correct 463 ms 7900 KB Output is correct
66 Correct 500 ms 7924 KB Output is correct
67 Correct 455 ms 7908 KB Output is correct
68 Correct 493 ms 7924 KB Output is correct
69 Correct 443 ms 7900 KB Output is correct
70 Correct 441 ms 7924 KB Output is correct
71 Correct 1188 ms 24048 KB Output is correct
72 Correct 1185 ms 24304 KB Output is correct
73 Correct 1201 ms 22776 KB Output is correct
74 Correct 1407 ms 23032 KB Output is correct
75 Correct 1654 ms 25036 KB Output is correct
76 Correct 1365 ms 23280 KB Output is correct
77 Correct 1342 ms 23284 KB Output is correct
78 Correct 950 ms 27120 KB Output is correct
79 Correct 979 ms 20952 KB Output is correct
80 Correct 1282 ms 24268 KB Output is correct
81 Correct 1521 ms 24044 KB Output is correct
82 Correct 1326 ms 22988 KB Output is correct
83 Correct 1134 ms 22264 KB Output is correct
84 Correct 1336 ms 22988 KB Output is correct
85 Correct 1402 ms 23288 KB Output is correct
86 Correct 857 ms 20976 KB Output is correct
87 Correct 1108 ms 24012 KB Output is correct
88 Correct 899 ms 20932 KB Output is correct
89 Correct 1229 ms 22772 KB Output is correct
90 Correct 1355 ms 23028 KB Output is correct
91 Correct 1088 ms 22236 KB Output is correct
92 Correct 1285 ms 23240 KB Output is correct
93 Correct 1363 ms 23240 KB Output is correct
94 Correct 838 ms 20952 KB Output is correct
95 Correct 1448 ms 23244 KB Output is correct
96 Correct 1413 ms 23244 KB Output is correct
97 Correct 1443 ms 23028 KB Output is correct
98 Correct 1389 ms 23024 KB Output is correct
99 Correct 1446 ms 23248 KB Output is correct
100 Correct 1453 ms 23248 KB Output is correct