oj.uz

답안 #991650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991650 2024-06-02T17:51:18 Z GrindMachine Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 864 ms 34804 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],inf1);
    rep(i,pow3[n-B]){
        if(i%3 == 2) lsqf[i] = 0;
        else lsqf[i] = lsqf[i/3]+1;
    }
    
    int ok[1<<B][pow3[B]];
    memset(ok,0,sizeof ok);
    ok[0][0] = (1<<29)-1;

    rep(mask1,1<<B){
        rep(mask2,pow3[B]){
            if(mask1 == 0 and mask2 == 0) conts;
            int b1 = mask1&1;
            int b2 = mask2%3;
            if(b2 == 2 or b1 == b2){
                ok[mask1][mask2] = ok[mask1>>1][mask2/3];
            }
            else{
                ok[mask1][mask2] = 0;
            }
        }
    }

    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[maskf[lastB]] += s[i]-'0';
        }

        rep(mask2,pow3[n-B]){
            int lsq = lsqf[mask2];
            if(lsq >= inf1) conts;
            rep(x,2){
                int mask3 = mask2+pow3[lsq]*(x-2);
                dp[mask2] += dp[mask3];
            }
        }

        rep(id,q){
            ans[id] += ok[mask1][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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 153 ms 16208 KB Output is correct
12 Correct 133 ms 15804 KB Output is correct
13 Correct 143 ms 14936 KB Output is correct
14 Correct 144 ms 15188 KB Output is correct
15 Correct 147 ms 16236 KB Output is correct
16 Correct 157 ms 15188 KB Output is correct
17 Correct 151 ms 15180 KB Output is correct
18 Correct 129 ms 17236 KB Output is correct
19 Correct 150 ms 14160 KB Output is correct
20 Correct 167 ms 15700 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 153 ms 16208 KB Output is correct
12 Correct 133 ms 15804 KB Output is correct
13 Correct 143 ms 14936 KB Output is correct
14 Correct 144 ms 15188 KB Output is correct
15 Correct 147 ms 16236 KB Output is correct
16 Correct 157 ms 15188 KB Output is correct
17 Correct 151 ms 15180 KB Output is correct
18 Correct 129 ms 17236 KB Output is correct
19 Correct 150 ms 14160 KB Output is correct
20 Correct 167 ms 15700 KB Output is correct
21 Correct 197 ms 16212 KB Output is correct
22 Correct 170 ms 16724 KB Output is correct
23 Correct 192 ms 15440 KB Output is correct
24 Correct 193 ms 15184 KB Output is correct
25 Correct 181 ms 17232 KB Output is correct
26 Correct 203 ms 15700 KB Output is correct
27 Correct 200 ms 15716 KB Output is correct
28 Correct 162 ms 18264 KB Output is correct
29 Correct 194 ms 14160 KB Output is correct
30 Correct 207 ms 16484 KB Output is correct
31 Correct 207 ms 16236 KB Output is correct
32 Correct 182 ms 16232 KB Output is correct
33 Correct 192 ms 15188 KB Output is correct
34 Correct 195 ms 15188 KB Output is correct
35 Correct 203 ms 15732 KB Output is correct
36 Correct 150 ms 14416 KB Output is correct
37 Correct 156 ms 16228 KB Output is correct
38 Correct 209 ms 14424 KB Output is correct
39 Correct 198 ms 15460 KB Output is correct
40 Correct 196 ms 15212 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 435 ms 15856 KB Output is correct
12 Correct 439 ms 15864 KB Output is correct
13 Correct 439 ms 15688 KB Output is correct
14 Correct 483 ms 15864 KB Output is correct
15 Correct 441 ms 15856 KB Output is correct
16 Correct 444 ms 15668 KB Output is correct
17 Correct 448 ms 15856 KB Output is correct
18 Correct 429 ms 15920 KB Output is correct
19 Correct 433 ms 15696 KB Output is correct
20 Correct 425 ms 15860 KB Output is correct
21 Correct 442 ms 15672 KB Output is correct
22 Correct 447 ms 15664 KB Output is correct
23 Correct 435 ms 15676 KB Output is correct
24 Correct 434 ms 15860 KB Output is correct
25 Correct 430 ms 15856 KB Output is correct
26 Correct 420 ms 15672 KB Output is correct
27 Correct 419 ms 15860 KB Output is correct
28 Correct 425 ms 15664 KB Output is correct
29 Correct 448 ms 15852 KB Output is correct
30 Correct 430 ms 15736 KB Output is correct
31 Correct 426 ms 15860 KB Output is correct
32 Correct 428 ms 15860 KB Output is correct
33 Correct 441 ms 15680 KB Output is correct
34 Correct 425 ms 15704 KB Output is correct
35 Correct 432 ms 15664 KB Output is correct
36 Correct 435 ms 15672 KB Output is correct
37 Correct 434 ms 15680 KB Output is correct
38 Correct 446 ms 15856 KB Output is correct
39 Correct 427 ms 15860 KB Output is correct
40 Correct 435 ms 15856 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 153 ms 16208 KB Output is correct
12 Correct 133 ms 15804 KB Output is correct
13 Correct 143 ms 14936 KB Output is correct
14 Correct 144 ms 15188 KB Output is correct
15 Correct 147 ms 16236 KB Output is correct
16 Correct 157 ms 15188 KB Output is correct
17 Correct 151 ms 15180 KB Output is correct
18 Correct 129 ms 17236 KB Output is correct
19 Correct 150 ms 14160 KB Output is correct
20 Correct 167 ms 15700 KB Output is correct
21 Correct 197 ms 16212 KB Output is correct
22 Correct 170 ms 16724 KB Output is correct
23 Correct 192 ms 15440 KB Output is correct
24 Correct 193 ms 15184 KB Output is correct
25 Correct 181 ms 17232 KB Output is correct
26 Correct 203 ms 15700 KB Output is correct
27 Correct 200 ms 15716 KB Output is correct
28 Correct 162 ms 18264 KB Output is correct
29 Correct 194 ms 14160 KB Output is correct
30 Correct 207 ms 16484 KB Output is correct
31 Correct 207 ms 16236 KB Output is correct
32 Correct 182 ms 16232 KB Output is correct
33 Correct 192 ms 15188 KB Output is correct
34 Correct 195 ms 15188 KB Output is correct
35 Correct 203 ms 15732 KB Output is correct
36 Correct 150 ms 14416 KB Output is correct
37 Correct 156 ms 16228 KB Output is correct
38 Correct 209 ms 14424 KB Output is correct
39 Correct 198 ms 15460 KB Output is correct
40 Correct 196 ms 15212 KB Output is correct
41 Correct 435 ms 15856 KB Output is correct
42 Correct 439 ms 15864 KB Output is correct
43 Correct 439 ms 15688 KB Output is correct
44 Correct 483 ms 15864 KB Output is correct
45 Correct 441 ms 15856 KB Output is correct
46 Correct 444 ms 15668 KB Output is correct
47 Correct 448 ms 15856 KB Output is correct
48 Correct 429 ms 15920 KB Output is correct
49 Correct 433 ms 15696 KB Output is correct
50 Correct 425 ms 15860 KB Output is correct
51 Correct 442 ms 15672 KB Output is correct
52 Correct 447 ms 15664 KB Output is correct
53 Correct 435 ms 15676 KB Output is correct
54 Correct 434 ms 15860 KB Output is correct
55 Correct 430 ms 15856 KB Output is correct
56 Correct 420 ms 15672 KB Output is correct
57 Correct 419 ms 15860 KB Output is correct
58 Correct 425 ms 15664 KB Output is correct
59 Correct 448 ms 15852 KB Output is correct
60 Correct 430 ms 15736 KB Output is correct
61 Correct 426 ms 15860 KB Output is correct
62 Correct 428 ms 15860 KB Output is correct
63 Correct 441 ms 15680 KB Output is correct
64 Correct 425 ms 15704 KB Output is correct
65 Correct 432 ms 15664 KB Output is correct
66 Correct 435 ms 15672 KB Output is correct
67 Correct 434 ms 15680 KB Output is correct
68 Correct 446 ms 15856 KB Output is correct
69 Correct 427 ms 15860 KB Output is correct
70 Correct 435 ms 15856 KB Output is correct
71 Correct 777 ms 32140 KB Output is correct
72 Correct 710 ms 32244 KB Output is correct
73 Correct 837 ms 30448 KB Output is correct
74 Correct 831 ms 30768 KB Output is correct
75 Correct 781 ms 32756 KB Output is correct
76 Correct 857 ms 31216 KB Output is correct
77 Correct 836 ms 31012 KB Output is correct
78 Correct 685 ms 34804 KB Output is correct
79 Correct 729 ms 28700 KB Output is correct
80 Correct 746 ms 31956 KB Output is correct
81 Correct 782 ms 31736 KB Output is correct
82 Correct 808 ms 30756 KB Output is correct
83 Correct 808 ms 29904 KB Output is correct
84 Correct 845 ms 30708 KB Output is correct
85 Correct 837 ms 31008 KB Output is correct
86 Correct 674 ms 28916 KB Output is correct
87 Correct 716 ms 31728 KB Output is correct
88 Correct 759 ms 28900 KB Output is correct
89 Correct 864 ms 30452 KB Output is correct
90 Correct 857 ms 30704 KB Output is correct
91 Correct 803 ms 29940 KB Output is correct
92 Correct 856 ms 31016 KB Output is correct
93 Correct 819 ms 30964 KB Output is correct
94 Correct 638 ms 28912 KB Output is correct
95 Correct 823 ms 30948 KB Output is correct
96 Correct 814 ms 30964 KB Output is correct
97 Correct 798 ms 30932 KB Output is correct
98 Correct 793 ms 30924 KB Output is correct
99 Correct 817 ms 30964 KB Output is correct
100 Correct 794 ms 30936 KB Output is correct