oj.uz

답안 #991645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991645 2024-06-02T17:39:05 Z GrindMachine Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 1270 ms 58576 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,6);

    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

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

# 결과 실행 시간 메모리 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 1 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 1 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 180 ms 16204 KB Output is correct
12 Correct 157 ms 15696 KB Output is correct
13 Correct 176 ms 14932 KB Output is correct
14 Correct 195 ms 15192 KB Output is correct
15 Correct 191 ms 16212 KB Output is correct
16 Correct 190 ms 15204 KB Output is correct
17 Correct 188 ms 15224 KB Output is correct
18 Correct 152 ms 16996 KB Output is correct
19 Correct 166 ms 14160 KB Output is correct
20 Correct 176 ms 15700 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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 1 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 1 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 180 ms 16204 KB Output is correct
12 Correct 157 ms 15696 KB Output is correct
13 Correct 176 ms 14932 KB Output is correct
14 Correct 195 ms 15192 KB Output is correct
15 Correct 191 ms 16212 KB Output is correct
16 Correct 190 ms 15204 KB Output is correct
17 Correct 188 ms 15224 KB Output is correct
18 Correct 152 ms 16996 KB Output is correct
19 Correct 166 ms 14160 KB Output is correct
20 Correct 176 ms 15700 KB Output is correct
21 Correct 224 ms 16228 KB Output is correct
22 Correct 218 ms 16332 KB Output is correct
23 Correct 258 ms 15212 KB Output is correct
24 Correct 237 ms 15152 KB Output is correct
25 Correct 222 ms 17232 KB Output is correct
26 Correct 227 ms 15700 KB Output is correct
27 Correct 237 ms 15464 KB Output is correct
28 Correct 231 ms 18036 KB Output is correct
29 Correct 224 ms 14160 KB Output is correct
30 Correct 262 ms 16208 KB Output is correct
31 Correct 230 ms 16208 KB Output is correct
32 Correct 260 ms 16208 KB Output is correct
33 Correct 231 ms 14932 KB Output is correct
34 Correct 237 ms 15184 KB Output is correct
35 Correct 229 ms 15440 KB Output is correct
36 Correct 234 ms 14164 KB Output is correct
37 Correct 240 ms 16228 KB Output is correct
38 Correct 258 ms 14196 KB Output is correct
39 Correct 271 ms 15188 KB Output is correct
40 Correct 243 ms 15188 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 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 1 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 1 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 690 ms 39564 KB Output is correct
12 Correct 638 ms 39612 KB Output is correct
13 Correct 699 ms 39496 KB Output is correct
14 Correct 728 ms 39568 KB Output is correct
15 Correct 747 ms 39828 KB Output is correct
16 Correct 748 ms 39568 KB Output is correct
17 Correct 734 ms 39568 KB Output is correct
18 Correct 696 ms 39920 KB Output is correct
19 Correct 658 ms 39564 KB Output is correct
20 Correct 760 ms 39668 KB Output is correct
21 Correct 714 ms 39592 KB Output is correct
22 Correct 684 ms 39668 KB Output is correct
23 Correct 706 ms 39572 KB Output is correct
24 Correct 665 ms 39600 KB Output is correct
25 Correct 672 ms 39572 KB Output is correct
26 Correct 638 ms 39568 KB Output is correct
27 Correct 672 ms 39572 KB Output is correct
28 Correct 627 ms 39616 KB Output is correct
29 Correct 656 ms 39564 KB Output is correct
30 Correct 641 ms 39572 KB Output is correct
31 Correct 661 ms 39668 KB Output is correct
32 Correct 641 ms 39568 KB Output is correct
33 Correct 636 ms 39668 KB Output is correct
34 Correct 593 ms 39572 KB Output is correct
35 Correct 652 ms 39684 KB Output is correct
36 Correct 643 ms 39572 KB Output is correct
37 Correct 640 ms 39568 KB Output is correct
38 Correct 711 ms 39568 KB Output is correct
39 Correct 717 ms 39668 KB Output is correct
40 Correct 681 ms 39668 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 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 1 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 1 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 180 ms 16204 KB Output is correct
12 Correct 157 ms 15696 KB Output is correct
13 Correct 176 ms 14932 KB Output is correct
14 Correct 195 ms 15192 KB Output is correct
15 Correct 191 ms 16212 KB Output is correct
16 Correct 190 ms 15204 KB Output is correct
17 Correct 188 ms 15224 KB Output is correct
18 Correct 152 ms 16996 KB Output is correct
19 Correct 166 ms 14160 KB Output is correct
20 Correct 176 ms 15700 KB Output is correct
21 Correct 224 ms 16228 KB Output is correct
22 Correct 218 ms 16332 KB Output is correct
23 Correct 258 ms 15212 KB Output is correct
24 Correct 237 ms 15152 KB Output is correct
25 Correct 222 ms 17232 KB Output is correct
26 Correct 227 ms 15700 KB Output is correct
27 Correct 237 ms 15464 KB Output is correct
28 Correct 231 ms 18036 KB Output is correct
29 Correct 224 ms 14160 KB Output is correct
30 Correct 262 ms 16208 KB Output is correct
31 Correct 230 ms 16208 KB Output is correct
32 Correct 260 ms 16208 KB Output is correct
33 Correct 231 ms 14932 KB Output is correct
34 Correct 237 ms 15184 KB Output is correct
35 Correct 229 ms 15440 KB Output is correct
36 Correct 234 ms 14164 KB Output is correct
37 Correct 240 ms 16228 KB Output is correct
38 Correct 258 ms 14196 KB Output is correct
39 Correct 271 ms 15188 KB Output is correct
40 Correct 243 ms 15188 KB Output is correct
41 Correct 690 ms 39564 KB Output is correct
42 Correct 638 ms 39612 KB Output is correct
43 Correct 699 ms 39496 KB Output is correct
44 Correct 728 ms 39568 KB Output is correct
45 Correct 747 ms 39828 KB Output is correct
46 Correct 748 ms 39568 KB Output is correct
47 Correct 734 ms 39568 KB Output is correct
48 Correct 696 ms 39920 KB Output is correct
49 Correct 658 ms 39564 KB Output is correct
50 Correct 760 ms 39668 KB Output is correct
51 Correct 714 ms 39592 KB Output is correct
52 Correct 684 ms 39668 KB Output is correct
53 Correct 706 ms 39572 KB Output is correct
54 Correct 665 ms 39600 KB Output is correct
55 Correct 672 ms 39572 KB Output is correct
56 Correct 638 ms 39568 KB Output is correct
57 Correct 672 ms 39572 KB Output is correct
58 Correct 627 ms 39616 KB Output is correct
59 Correct 656 ms 39564 KB Output is correct
60 Correct 641 ms 39572 KB Output is correct
61 Correct 661 ms 39668 KB Output is correct
62 Correct 641 ms 39568 KB Output is correct
63 Correct 636 ms 39668 KB Output is correct
64 Correct 593 ms 39572 KB Output is correct
65 Correct 652 ms 39684 KB Output is correct
66 Correct 643 ms 39572 KB Output is correct
67 Correct 640 ms 39568 KB Output is correct
68 Correct 711 ms 39568 KB Output is correct
69 Correct 717 ms 39668 KB Output is correct
70 Correct 681 ms 39668 KB Output is correct
71 Correct 991 ms 55652 KB Output is correct
72 Correct 891 ms 55904 KB Output is correct
73 Correct 1209 ms 54376 KB Output is correct
74 Correct 1251 ms 54632 KB Output is correct
75 Correct 1030 ms 56676 KB Output is correct
76 Correct 1236 ms 55012 KB Output is correct
77 Correct 1244 ms 54768 KB Output is correct
78 Correct 926 ms 58576 KB Output is correct
79 Correct 939 ms 52584 KB Output is correct
80 Correct 945 ms 55908 KB Output is correct
81 Correct 1079 ms 55776 KB Output is correct
82 Correct 1192 ms 54624 KB Output is correct
83 Correct 1105 ms 53860 KB Output is correct
84 Correct 1270 ms 54628 KB Output is correct
85 Correct 1195 ms 55036 KB Output is correct
86 Correct 823 ms 52584 KB Output is correct
87 Correct 900 ms 55648 KB Output is correct
88 Correct 925 ms 52688 KB Output is correct
89 Correct 1091 ms 54376 KB Output is correct
90 Correct 1244 ms 54760 KB Output is correct
91 Correct 1004 ms 53748 KB Output is correct
92 Correct 1154 ms 55028 KB Output is correct
93 Correct 1144 ms 54880 KB Output is correct
94 Correct 833 ms 52704 KB Output is correct
95 Correct 1196 ms 54740 KB Output is correct
96 Correct 1218 ms 54772 KB Output is correct
97 Correct 1142 ms 55028 KB Output is correct
98 Correct 1212 ms 54768 KB Output is correct
99 Correct 1254 ms 54884 KB Output is correct
100 Correct 1229 ms 54880 KB Output is correct