oj.uz

Submission #533922

# Submission time Handle Problem Language Result Execution time Memory
533922 2022-03-07T15:53:18 Z radal Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 22960 KB 
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr ll N = 2e6+20,mod = 1e9+7,inf = 1e9+10,maxm = 1e6;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
    if (a+b < 0) return a+b+mod;
    return a+b;
}

inline int poww(int a,int k){
    if (k < 0) return 0;
    int z = 1;
    while (k){
        if (k&1) z = 1ll*z*a%mod;
        a = 1ll*a*a%mod;
        k >>= 1;
    }
    return z;
}
int sos[N][2][2];
int main(){
    ios :: sync_with_stdio(0); cin.tie(0);
    int l,q;
    cin >> l >> q;
    string s;
    cin >> s;
    int n = s.size();
    rep(i,0,n)
        sos[i][(l&1)][1] = sos[i][(l&1)][0] = (s[i]-'0');
    repr(j,l-1,0){
        bool d = (j&1);
        rep(i,0,n){
            sos[i][d][0] = sos[i][1-d][0];
            sos[i][d][1] = sos[i][1-d][1];
            if (i&(1 << j))
                sos[i][d][1] += sos[i-(1 << j)][!d][1];
            else
                sos[i][d][0] += sos[i+(1 << j)][!d][0];
        }
    }
    while (q--){
        string t;
        cin >> t;
        reverse(t.begin(),t.end());
        int t0 = 0,t2 = 0,t1 = 0,mask = 0;
        vector<int> ve;
        rep(i,0,l){
            if (t[i] == '1'){
                t1++;
                mask += (1 << i);
            }
            else if (t[i] == '0') t0++;
            else
                t2++;
        }
        if (t2 < 7){
            rep(i,0,l) if (t[i] == '?') ve.pb(i);
            if (!t2){
                cout << s[mask] << endl;
                continue;
            }
            int y = (1 << t2);
            int ans = 0;
            rep(j,0,y){
                int sum = mask;
                rep(k,0,t2)
                    if (j&(1 << k)) 
                        sum += (1 << ve[k]);
                ans += (s[sum]-'0');
            }
            cout << ans << endl;
            continue;
        }
        if (t1 <= t0){
            rep(i,0,l){
                if (t[i] == '1') ve.pb(i);
                if (t[i] == '?') mask += (1 << i);
            }
            int y = (1 << t1),ans = 0;
            rep(i,0,y){
                int cnt = 0,sum = mask;
                rep(j,0,t1){
                    if ((1 << j)&i){
                        sum -= (1 << ve[j]);
                        cnt ^= 1;
                    }
                }
                if (cnt) ans -= sos[sum][0][1];
                else ans += sos[sum][0][1];
            }
            cout << ans << endl;
            continue;
        }
        rep(i,0,l)
            if (t[i] == '0')
                ve.pb(i);
        int y = (1 << t0),ans = 0;
        rep(i,0,y){
            int cnt = 0,sum = mask;
            rep(j,0,t0)
                if ((1 << j)&i){
                    sum += (1 << ve[j]);
                    cnt ^= 1;
                }
            if (cnt) ans -= sos[sum][0][0];
            else ans += sos[sum][0][0];
        }
        cout << ans << endl;
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 587 ms 5360 KB Output is correct
12 Correct 618 ms 5056 KB Output is correct
13 Correct 415 ms 4256 KB Output is correct
14 Correct 368 ms 4276 KB Output is correct
15 Correct 952 ms 5288 KB Output is correct
16 Correct 486 ms 4504 KB Output is correct
17 Correct 468 ms 4392 KB Output is correct
18 Correct 241 ms 6340 KB Output is correct
19 Correct 183 ms 3288 KB Output is correct
20 Correct 548 ms 5000 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 587 ms 5360 KB Output is correct
12 Correct 618 ms 5056 KB Output is correct
13 Correct 415 ms 4256 KB Output is correct
14 Correct 368 ms 4276 KB Output is correct
15 Correct 952 ms 5288 KB Output is correct
16 Correct 486 ms 4504 KB Output is correct
17 Correct 468 ms 4392 KB Output is correct
18 Correct 241 ms 6340 KB Output is correct
19 Correct 183 ms 3288 KB Output is correct
20 Correct 548 ms 5000 KB Output is correct
21 Correct 244 ms 5464 KB Output is correct
22 Correct 563 ms 5608 KB Output is correct
23 Correct 543 ms 4612 KB Output is correct
24 Correct 486 ms 4408 KB Output is correct
25 Correct 391 ms 6468 KB Output is correct
26 Correct 644 ms 4912 KB Output is correct
27 Correct 588 ms 4904 KB Output is correct
28 Correct 197 ms 7412 KB Output is correct
29 Correct 232 ms 3444 KB Output is correct
30 Correct 511 ms 5548 KB Output is correct
31 Correct 957 ms 5440 KB Output is correct
32 Correct 655 ms 5388 KB Output is correct
33 Correct 416 ms 4384 KB Output is correct
34 Correct 501 ms 4404 KB Output is correct
35 Correct 635 ms 5044 KB Output is correct
36 Correct 157 ms 3460 KB Output is correct
37 Correct 962 ms 5428 KB Output is correct
38 Correct 215 ms 3456 KB Output is correct
39 Correct 560 ms 4556 KB Output is correct
40 Correct 482 ms 4548 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 77 ms 19352 KB Output is correct
12 Correct 84 ms 18780 KB Output is correct
13 Correct 101 ms 18660 KB Output is correct
14 Correct 166 ms 18692 KB Output is correct
15 Correct 88 ms 18760 KB Output is correct
16 Correct 132 ms 18744 KB Output is correct
17 Correct 138 ms 18656 KB Output is correct
18 Correct 71 ms 18908 KB Output is correct
19 Correct 80 ms 18584 KB Output is correct
20 Correct 80 ms 18664 KB Output is correct
21 Correct 108 ms 18668 KB Output is correct
22 Correct 162 ms 18648 KB Output is correct
23 Correct 91 ms 18552 KB Output is correct
24 Correct 129 ms 18628 KB Output is correct
25 Correct 150 ms 18716 KB Output is correct
26 Correct 71 ms 18608 KB Output is correct
27 Correct 81 ms 18680 KB Output is correct
28 Correct 73 ms 18580 KB Output is correct
29 Correct 103 ms 18648 KB Output is correct
30 Correct 117 ms 18644 KB Output is correct
31 Correct 87 ms 18656 KB Output is correct
32 Correct 127 ms 18628 KB Output is correct
33 Correct 113 ms 18656 KB Output is correct
34 Correct 66 ms 18596 KB Output is correct
35 Correct 106 ms 18660 KB Output is correct
36 Correct 126 ms 18692 KB Output is correct
37 Correct 113 ms 18696 KB Output is correct
38 Correct 115 ms 18664 KB Output is correct
39 Correct 135 ms 18800 KB Output is correct
40 Correct 113 ms 18612 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 587 ms 5360 KB Output is correct
12 Correct 618 ms 5056 KB Output is correct
13 Correct 415 ms 4256 KB Output is correct
14 Correct 368 ms 4276 KB Output is correct
15 Correct 952 ms 5288 KB Output is correct
16 Correct 486 ms 4504 KB Output is correct
17 Correct 468 ms 4392 KB Output is correct
18 Correct 241 ms 6340 KB Output is correct
19 Correct 183 ms 3288 KB Output is correct
20 Correct 548 ms 5000 KB Output is correct
21 Correct 244 ms 5464 KB Output is correct
22 Correct 563 ms 5608 KB Output is correct
23 Correct 543 ms 4612 KB Output is correct
24 Correct 486 ms 4408 KB Output is correct
25 Correct 391 ms 6468 KB Output is correct
26 Correct 644 ms 4912 KB Output is correct
27 Correct 588 ms 4904 KB Output is correct
28 Correct 197 ms 7412 KB Output is correct
29 Correct 232 ms 3444 KB Output is correct
30 Correct 511 ms 5548 KB Output is correct
31 Correct 957 ms 5440 KB Output is correct
32 Correct 655 ms 5388 KB Output is correct
33 Correct 416 ms 4384 KB Output is correct
34 Correct 501 ms 4404 KB Output is correct
35 Correct 635 ms 5044 KB Output is correct
36 Correct 157 ms 3460 KB Output is correct
37 Correct 962 ms 5428 KB Output is correct
38 Correct 215 ms 3456 KB Output is correct
39 Correct 560 ms 4556 KB Output is correct
40 Correct 482 ms 4548 KB Output is correct
41 Correct 77 ms 19352 KB Output is correct
42 Correct 84 ms 18780 KB Output is correct
43 Correct 101 ms 18660 KB Output is correct
44 Correct 166 ms 18692 KB Output is correct
45 Correct 88 ms 18760 KB Output is correct
46 Correct 132 ms 18744 KB Output is correct
47 Correct 138 ms 18656 KB Output is correct
48 Correct 71 ms 18908 KB Output is correct
49 Correct 80 ms 18584 KB Output is correct
50 Correct 80 ms 18664 KB Output is correct
51 Correct 108 ms 18668 KB Output is correct
52 Correct 162 ms 18648 KB Output is correct
53 Correct 91 ms 18552 KB Output is correct
54 Correct 129 ms 18628 KB Output is correct
55 Correct 150 ms 18716 KB Output is correct
56 Correct 71 ms 18608 KB Output is correct
57 Correct 81 ms 18680 KB Output is correct
58 Correct 73 ms 18580 KB Output is correct
59 Correct 103 ms 18648 KB Output is correct
60 Correct 117 ms 18644 KB Output is correct
61 Correct 87 ms 18656 KB Output is correct
62 Correct 127 ms 18628 KB Output is correct
63 Correct 113 ms 18656 KB Output is correct
64 Correct 66 ms 18596 KB Output is correct
65 Correct 106 ms 18660 KB Output is correct
66 Correct 126 ms 18692 KB Output is correct
67 Correct 113 ms 18696 KB Output is correct
68 Correct 115 ms 18664 KB Output is correct
69 Correct 135 ms 18800 KB Output is correct
70 Correct 113 ms 18612 KB Output is correct
71 Correct 528 ms 22812 KB Output is correct
72 Correct 658 ms 22960 KB Output is correct
73 Correct 913 ms 21608 KB Output is correct
74 Execution timed out 2073 ms 22192 KB Time limit exceeded
75 Halted 0 ms 0 KB -