oj.uz

답안 #991643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991643 2024-06-02T17:37:56 Z GrindMachine Snake Escaping (JOI18_snake_escaping) C++17
100 / 100
 1227 ms 25332 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,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> 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 184 ms 16204 KB Output is correct
12 Correct 142 ms 15712 KB Output is correct
13 Correct 193 ms 14952 KB Output is correct
14 Correct 159 ms 15192 KB Output is correct
15 Correct 164 ms 16208 KB Output is correct
16 Correct 170 ms 15192 KB Output is correct
17 Correct 172 ms 15188 KB Output is correct
18 Correct 146 ms 16980 KB Output is correct
19 Correct 167 ms 14160 KB Output is correct
20 Correct 190 ms 15868 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 184 ms 16204 KB Output is correct
12 Correct 142 ms 15712 KB Output is correct
13 Correct 193 ms 14952 KB Output is correct
14 Correct 159 ms 15192 KB Output is correct
15 Correct 164 ms 16208 KB Output is correct
16 Correct 170 ms 15192 KB Output is correct
17 Correct 172 ms 15188 KB Output is correct
18 Correct 146 ms 16980 KB Output is correct
19 Correct 167 ms 14160 KB Output is correct
20 Correct 190 ms 15868 KB Output is correct
21 Correct 238 ms 16212 KB Output is correct
22 Correct 200 ms 16464 KB Output is correct
23 Correct 225 ms 15208 KB Output is correct
24 Correct 216 ms 15188 KB Output is correct
25 Correct 212 ms 17232 KB Output is correct
26 Correct 255 ms 15732 KB Output is correct
27 Correct 227 ms 15696 KB Output is correct
28 Correct 196 ms 18256 KB Output is correct
29 Correct 223 ms 14196 KB Output is correct
30 Correct 245 ms 16228 KB Output is correct
31 Correct 223 ms 16244 KB Output is correct
32 Correct 230 ms 16236 KB Output is correct
33 Correct 217 ms 14928 KB Output is correct
34 Correct 231 ms 15188 KB Output is correct
35 Correct 227 ms 15440 KB Output is correct
36 Correct 188 ms 14164 KB Output is correct
37 Correct 198 ms 16212 KB Output is correct
38 Correct 231 ms 14196 KB Output is correct
39 Correct 227 ms 15232 KB Output is correct
40 Correct 224 ms 15188 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 377 ms 6256 KB Output is correct
12 Correct 370 ms 6388 KB Output is correct
13 Correct 386 ms 6244 KB Output is correct
14 Correct 401 ms 6384 KB Output is correct
15 Correct 440 ms 6496 KB Output is correct
16 Correct 383 ms 6260 KB Output is correct
17 Correct 396 ms 6240 KB Output is correct
18 Correct 364 ms 6496 KB Output is correct
19 Correct 373 ms 6140 KB Output is correct
20 Correct 369 ms 6492 KB Output is correct
21 Correct 394 ms 6496 KB Output is correct
22 Correct 385 ms 6432 KB Output is correct
23 Correct 373 ms 6388 KB Output is correct
24 Correct 409 ms 6240 KB Output is correct
25 Correct 392 ms 6260 KB Output is correct
26 Correct 414 ms 6240 KB Output is correct
27 Correct 377 ms 6388 KB Output is correct
28 Correct 389 ms 6248 KB Output is correct
29 Correct 383 ms 6388 KB Output is correct
30 Correct 378 ms 6384 KB Output is correct
31 Correct 369 ms 6388 KB Output is correct
32 Correct 385 ms 6240 KB Output is correct
33 Correct 377 ms 6256 KB Output is correct
34 Correct 368 ms 6148 KB Output is correct
35 Correct 389 ms 6388 KB Output is correct
36 Correct 390 ms 6384 KB Output is correct
37 Correct 400 ms 6244 KB Output is correct
38 Correct 430 ms 6236 KB Output is correct
39 Correct 385 ms 6240 KB Output is correct
40 Correct 378 ms 6388 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 184 ms 16204 KB Output is correct
12 Correct 142 ms 15712 KB Output is correct
13 Correct 193 ms 14952 KB Output is correct
14 Correct 159 ms 15192 KB Output is correct
15 Correct 164 ms 16208 KB Output is correct
16 Correct 170 ms 15192 KB Output is correct
17 Correct 172 ms 15188 KB Output is correct
18 Correct 146 ms 16980 KB Output is correct
19 Correct 167 ms 14160 KB Output is correct
20 Correct 190 ms 15868 KB Output is correct
21 Correct 238 ms 16212 KB Output is correct
22 Correct 200 ms 16464 KB Output is correct
23 Correct 225 ms 15208 KB Output is correct
24 Correct 216 ms 15188 KB Output is correct
25 Correct 212 ms 17232 KB Output is correct
26 Correct 255 ms 15732 KB Output is correct
27 Correct 227 ms 15696 KB Output is correct
28 Correct 196 ms 18256 KB Output is correct
29 Correct 223 ms 14196 KB Output is correct
30 Correct 245 ms 16228 KB Output is correct
31 Correct 223 ms 16244 KB Output is correct
32 Correct 230 ms 16236 KB Output is correct
33 Correct 217 ms 14928 KB Output is correct
34 Correct 231 ms 15188 KB Output is correct
35 Correct 227 ms 15440 KB Output is correct
36 Correct 188 ms 14164 KB Output is correct
37 Correct 198 ms 16212 KB Output is correct
38 Correct 231 ms 14196 KB Output is correct
39 Correct 227 ms 15232 KB Output is correct
40 Correct 224 ms 15188 KB Output is correct
41 Correct 377 ms 6256 KB Output is correct
42 Correct 370 ms 6388 KB Output is correct
43 Correct 386 ms 6244 KB Output is correct
44 Correct 401 ms 6384 KB Output is correct
45 Correct 440 ms 6496 KB Output is correct
46 Correct 383 ms 6260 KB Output is correct
47 Correct 396 ms 6240 KB Output is correct
48 Correct 364 ms 6496 KB Output is correct
49 Correct 373 ms 6140 KB Output is correct
50 Correct 369 ms 6492 KB Output is correct
51 Correct 394 ms 6496 KB Output is correct
52 Correct 385 ms 6432 KB Output is correct
53 Correct 373 ms 6388 KB Output is correct
54 Correct 409 ms 6240 KB Output is correct
55 Correct 392 ms 6260 KB Output is correct
56 Correct 414 ms 6240 KB Output is correct
57 Correct 377 ms 6388 KB Output is correct
58 Correct 389 ms 6248 KB Output is correct
59 Correct 383 ms 6388 KB Output is correct
60 Correct 378 ms 6384 KB Output is correct
61 Correct 369 ms 6388 KB Output is correct
62 Correct 385 ms 6240 KB Output is correct
63 Correct 377 ms 6256 KB Output is correct
64 Correct 368 ms 6148 KB Output is correct
65 Correct 389 ms 6388 KB Output is correct
66 Correct 390 ms 6384 KB Output is correct
67 Correct 400 ms 6244 KB Output is correct
68 Correct 430 ms 6236 KB Output is correct
69 Correct 385 ms 6240 KB Output is correct
70 Correct 378 ms 6388 KB Output is correct
71 Correct 919 ms 22480 KB Output is correct
72 Correct 952 ms 22504 KB Output is correct
73 Correct 1062 ms 21084 KB Output is correct
74 Correct 1095 ms 21492 KB Output is correct
75 Correct 993 ms 23388 KB Output is correct
76 Correct 1162 ms 21592 KB Output is correct
77 Correct 1142 ms 21600 KB Output is correct
78 Correct 850 ms 25332 KB Output is correct
79 Correct 952 ms 19296 KB Output is correct
80 Correct 950 ms 22516 KB Output is correct
81 Correct 1144 ms 22496 KB Output is correct
82 Correct 1079 ms 21492 KB Output is correct
83 Correct 1012 ms 20468 KB Output is correct
84 Correct 1179 ms 21356 KB Output is correct
85 Correct 1182 ms 21476 KB Output is correct
86 Correct 872 ms 19444 KB Output is correct
87 Correct 868 ms 22476 KB Output is correct
88 Correct 945 ms 19416 KB Output is correct
89 Correct 1147 ms 21248 KB Output is correct
90 Correct 1227 ms 21480 KB Output is correct
91 Correct 1018 ms 20464 KB Output is correct
92 Correct 1136 ms 21728 KB Output is correct
93 Correct 1103 ms 21724 KB Output is correct
94 Correct 825 ms 19440 KB Output is correct
95 Correct 1131 ms 21600 KB Output is correct
96 Correct 1094 ms 21596 KB Output is correct
97 Correct 1093 ms 21460 KB Output is correct
98 Correct 1190 ms 21612 KB Output is correct
99 Correct 1169 ms 21612 KB Output is correct
100 Correct 1185 ms 21472 KB Output is correct