oj.uz

답안 #991646

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

    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 344 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 344 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 344 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 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 210 ms 16212 KB Output is correct
12 Correct 173 ms 15696 KB Output is correct
13 Correct 174 ms 14924 KB Output is correct
14 Correct 188 ms 15184 KB Output is correct
15 Correct 168 ms 15972 KB Output is correct
16 Correct 205 ms 15204 KB Output is correct
17 Correct 183 ms 15204 KB Output is correct
18 Correct 160 ms 17000 KB Output is correct
19 Correct 176 ms 14160 KB Output is correct
20 Correct 200 ms 15696 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 344 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 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 210 ms 16212 KB Output is correct
12 Correct 173 ms 15696 KB Output is correct
13 Correct 174 ms 14924 KB Output is correct
14 Correct 188 ms 15184 KB Output is correct
15 Correct 168 ms 15972 KB Output is correct
16 Correct 205 ms 15204 KB Output is correct
17 Correct 183 ms 15204 KB Output is correct
18 Correct 160 ms 17000 KB Output is correct
19 Correct 176 ms 14160 KB Output is correct
20 Correct 200 ms 15696 KB Output is correct
21 Correct 268 ms 16212 KB Output is correct
22 Correct 198 ms 16208 KB Output is correct
23 Correct 312 ms 15228 KB Output is correct
24 Correct 259 ms 15224 KB Output is correct
25 Correct 227 ms 17252 KB Output is correct
26 Correct 237 ms 15700 KB Output is correct
27 Correct 247 ms 15476 KB Output is correct
28 Correct 208 ms 18100 KB Output is correct
29 Correct 265 ms 14180 KB Output is correct
30 Correct 256 ms 16224 KB Output is correct
31 Correct 227 ms 16240 KB Output is correct
32 Correct 264 ms 16212 KB Output is correct
33 Correct 230 ms 14952 KB Output is correct
34 Correct 230 ms 15204 KB Output is correct
35 Correct 244 ms 15480 KB Output is correct
36 Correct 315 ms 14048 KB Output is correct
37 Correct 215 ms 16212 KB Output is correct
38 Correct 237 ms 14164 KB Output is correct
39 Correct 250 ms 15220 KB Output is correct
40 Correct 269 ms 15224 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 344 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 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 496 ms 3480 KB Output is correct
12 Correct 506 ms 3564 KB Output is correct
13 Correct 517 ms 3456 KB Output is correct
14 Correct 515 ms 3456 KB Output is correct
15 Correct 569 ms 3572 KB Output is correct
16 Correct 690 ms 3460 KB Output is correct
17 Correct 558 ms 3472 KB Output is correct
18 Correct 510 ms 3716 KB Output is correct
19 Correct 502 ms 3464 KB Output is correct
20 Correct 514 ms 3476 KB Output is correct
21 Correct 546 ms 3568 KB Output is correct
22 Correct 568 ms 3460 KB Output is correct
23 Correct 536 ms 3456 KB Output is correct
24 Correct 542 ms 3460 KB Output is correct
25 Correct 519 ms 3460 KB Output is correct
26 Correct 511 ms 3328 KB Output is correct
27 Correct 497 ms 3572 KB Output is correct
28 Correct 508 ms 3476 KB Output is correct
29 Correct 519 ms 3456 KB Output is correct
30 Correct 574 ms 3476 KB Output is correct
31 Correct 541 ms 3472 KB Output is correct
32 Correct 524 ms 3568 KB Output is correct
33 Correct 571 ms 3428 KB Output is correct
34 Correct 508 ms 3328 KB Output is correct
35 Correct 538 ms 3460 KB Output is correct
36 Correct 504 ms 3472 KB Output is correct
37 Correct 546 ms 3572 KB Output is correct
38 Correct 600 ms 3580 KB Output is correct
39 Correct 521 ms 3572 KB Output is correct
40 Correct 606 ms 3568 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 344 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 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 210 ms 16212 KB Output is correct
12 Correct 173 ms 15696 KB Output is correct
13 Correct 174 ms 14924 KB Output is correct
14 Correct 188 ms 15184 KB Output is correct
15 Correct 168 ms 15972 KB Output is correct
16 Correct 205 ms 15204 KB Output is correct
17 Correct 183 ms 15204 KB Output is correct
18 Correct 160 ms 17000 KB Output is correct
19 Correct 176 ms 14160 KB Output is correct
20 Correct 200 ms 15696 KB Output is correct
21 Correct 268 ms 16212 KB Output is correct
22 Correct 198 ms 16208 KB Output is correct
23 Correct 312 ms 15228 KB Output is correct
24 Correct 259 ms 15224 KB Output is correct
25 Correct 227 ms 17252 KB Output is correct
26 Correct 237 ms 15700 KB Output is correct
27 Correct 247 ms 15476 KB Output is correct
28 Correct 208 ms 18100 KB Output is correct
29 Correct 265 ms 14180 KB Output is correct
30 Correct 256 ms 16224 KB Output is correct
31 Correct 227 ms 16240 KB Output is correct
32 Correct 264 ms 16212 KB Output is correct
33 Correct 230 ms 14952 KB Output is correct
34 Correct 230 ms 15204 KB Output is correct
35 Correct 244 ms 15480 KB Output is correct
36 Correct 315 ms 14048 KB Output is correct
37 Correct 215 ms 16212 KB Output is correct
38 Correct 237 ms 14164 KB Output is correct
39 Correct 250 ms 15220 KB Output is correct
40 Correct 269 ms 15224 KB Output is correct
41 Correct 496 ms 3480 KB Output is correct
42 Correct 506 ms 3564 KB Output is correct
43 Correct 517 ms 3456 KB Output is correct
44 Correct 515 ms 3456 KB Output is correct
45 Correct 569 ms 3572 KB Output is correct
46 Correct 690 ms 3460 KB Output is correct
47 Correct 558 ms 3472 KB Output is correct
48 Correct 510 ms 3716 KB Output is correct
49 Correct 502 ms 3464 KB Output is correct
50 Correct 514 ms 3476 KB Output is correct
51 Correct 546 ms 3568 KB Output is correct
52 Correct 568 ms 3460 KB Output is correct
53 Correct 536 ms 3456 KB Output is correct
54 Correct 542 ms 3460 KB Output is correct
55 Correct 519 ms 3460 KB Output is correct
56 Correct 511 ms 3328 KB Output is correct
57 Correct 497 ms 3572 KB Output is correct
58 Correct 508 ms 3476 KB Output is correct
59 Correct 519 ms 3456 KB Output is correct
60 Correct 574 ms 3476 KB Output is correct
61 Correct 541 ms 3472 KB Output is correct
62 Correct 524 ms 3568 KB Output is correct
63 Correct 571 ms 3428 KB Output is correct
64 Correct 508 ms 3328 KB Output is correct
65 Correct 538 ms 3460 KB Output is correct
66 Correct 504 ms 3472 KB Output is correct
67 Correct 546 ms 3572 KB Output is correct
68 Correct 600 ms 3580 KB Output is correct
69 Correct 521 ms 3572 KB Output is correct
70 Correct 606 ms 3568 KB Output is correct
71 Correct 1392 ms 19484 KB Output is correct
72 Correct 1359 ms 19740 KB Output is correct
73 Correct 1527 ms 18204 KB Output is correct
74 Correct 1624 ms 18456 KB Output is correct
75 Correct 1428 ms 20516 KB Output is correct
76 Correct 1671 ms 18716 KB Output is correct
77 Correct 1753 ms 18644 KB Output is correct
78 Correct 1334 ms 22500 KB Output is correct
79 Correct 1369 ms 16596 KB Output is correct
80 Correct 1352 ms 19700 KB Output is correct
81 Correct 1595 ms 19432 KB Output is correct
82 Correct 1637 ms 18420 KB Output is correct
83 Correct 1569 ms 17692 KB Output is correct
84 Correct 1648 ms 18400 KB Output is correct
85 Correct 1630 ms 18716 KB Output is correct
86 Correct 1222 ms 16624 KB Output is correct
87 Correct 1255 ms 19444 KB Output is correct
88 Correct 1300 ms 16612 KB Output is correct
89 Correct 1501 ms 18164 KB Output is correct
90 Correct 1593 ms 18408 KB Output is correct
91 Correct 1376 ms 17668 KB Output is correct
92 Correct 1588 ms 18908 KB Output is correct
93 Correct 1569 ms 18672 KB Output is correct
94 Correct 1226 ms 16416 KB Output is correct
95 Correct 1606 ms 18668 KB Output is correct
96 Correct 1536 ms 18676 KB Output is correct
97 Correct 1529 ms 18720 KB Output is correct
98 Correct 1520 ms 18676 KB Output is correct
99 Correct 1509 ms 18724 KB Output is correct
100 Correct 1508 ms 18672 KB Output is correct