oj.uz

Submission #533927

# Submission time Handle Problem Language Result Execution time Memory
533927 2022-03-07T16:02:38 Z radal Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1693 ms 65540 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];
map<ll,int> mp;
ll pw[N];
int main(){
    ios :: sync_with_stdio(0); cin.tie(0);
    int l,q;
    cin >> l >> q;
    pw[0] = 1;
    rep(i,1,l) pw[i] = 3*pw[i-1];
    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;
        ll jam = 0;
        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++;
                jam += pw[i];
                mask += (1 << i);
            }
            else if (t[i] == '0') t0++;
            else{
                t2++;
                jam += 2*pw[i];
            }
        }
        if (mp.find(jam) != mp.end()){
            cout << mp[jam] << endl;
            continue;
        }
        if (t2 < 7){
            rep(i,0,l) if (t[i] == '?') ve.pb(i);
            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;
            mp[jam] = ans;
            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;
            mp[jam] = ans;
            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;
        mp[jam] = ans;
    }
}

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 336 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 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 332 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 336 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 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 332 KB Output is correct
11 Correct 312 ms 4724 KB Output is correct
12 Correct 325 ms 4588 KB Output is correct
13 Correct 413 ms 4168 KB Output is correct
14 Correct 408 ms 4176 KB Output is correct
15 Correct 396 ms 4992 KB Output is correct
16 Correct 443 ms 4988 KB Output is correct
17 Correct 595 ms 7596 KB Output is correct
18 Correct 205 ms 5796 KB Output is correct
19 Correct 241 ms 2860 KB Output is correct
20 Correct 397 ms 4540 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 336 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 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 332 KB Output is correct
11 Correct 312 ms 4724 KB Output is correct
12 Correct 325 ms 4588 KB Output is correct
13 Correct 413 ms 4168 KB Output is correct
14 Correct 408 ms 4176 KB Output is correct
15 Correct 396 ms 4992 KB Output is correct
16 Correct 443 ms 4988 KB Output is correct
17 Correct 595 ms 7596 KB Output is correct
18 Correct 205 ms 5796 KB Output is correct
19 Correct 241 ms 2860 KB Output is correct
20 Correct 397 ms 4540 KB Output is correct
21 Correct 347 ms 5008 KB Output is correct
22 Correct 421 ms 5564 KB Output is correct
23 Correct 996 ms 17728 KB Output is correct
24 Correct 670 ms 9584 KB Output is correct
25 Correct 516 ms 8516 KB Output is correct
26 Correct 1207 ms 25816 KB Output is correct
27 Correct 1693 ms 50880 KB Output is correct
28 Correct 191 ms 6944 KB Output is correct
29 Correct 307 ms 3064 KB Output is correct
30 Correct 404 ms 5532 KB Output is correct
31 Correct 1129 ms 18616 KB Output is correct
32 Correct 680 ms 10548 KB Output is correct
33 Correct 506 ms 6416 KB Output is correct
34 Correct 1081 ms 25424 KB Output is correct
35 Correct 1534 ms 51056 KB Output is correct
36 Correct 197 ms 2996 KB Output is correct
37 Correct 321 ms 4924 KB Output is correct
38 Correct 389 ms 3288 KB Output is correct
39 Correct 914 ms 17548 KB Output is correct
40 Correct 635 ms 9480 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 336 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 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 332 KB Output is correct
11 Correct 125 ms 21216 KB Output is correct
12 Correct 105 ms 21488 KB Output is correct
13 Correct 136 ms 21512 KB Output is correct
14 Correct 235 ms 21552 KB Output is correct
15 Correct 112 ms 21612 KB Output is correct
16 Correct 186 ms 21540 KB Output is correct
17 Correct 177 ms 21612 KB Output is correct
18 Correct 74 ms 18720 KB Output is correct
19 Correct 108 ms 21096 KB Output is correct
20 Correct 101 ms 21484 KB Output is correct
21 Correct 160 ms 21580 KB Output is correct
22 Correct 218 ms 21520 KB Output is correct
23 Correct 111 ms 21520 KB Output is correct
24 Correct 137 ms 21532 KB Output is correct
25 Correct 154 ms 21588 KB Output is correct
26 Correct 69 ms 18404 KB Output is correct
27 Correct 99 ms 21252 KB Output is correct
28 Correct 96 ms 21348 KB Output is correct
29 Correct 166 ms 21472 KB Output is correct
30 Correct 153 ms 21608 KB Output is correct
31 Correct 103 ms 21480 KB Output is correct
32 Correct 173 ms 21608 KB Output is correct
33 Correct 206 ms 21536 KB Output is correct
34 Correct 66 ms 18404 KB Output is correct
35 Correct 131 ms 21184 KB Output is correct
36 Correct 146 ms 21120 KB Output is correct
37 Correct 134 ms 21140 KB Output is correct
38 Correct 123 ms 21124 KB Output is correct
39 Correct 126 ms 21220 KB Output is correct
40 Correct 137 ms 21220 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 336 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 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 332 KB Output is correct
11 Correct 312 ms 4724 KB Output is correct
12 Correct 325 ms 4588 KB Output is correct
13 Correct 413 ms 4168 KB Output is correct
14 Correct 408 ms 4176 KB Output is correct
15 Correct 396 ms 4992 KB Output is correct
16 Correct 443 ms 4988 KB Output is correct
17 Correct 595 ms 7596 KB Output is correct
18 Correct 205 ms 5796 KB Output is correct
19 Correct 241 ms 2860 KB Output is correct
20 Correct 397 ms 4540 KB Output is correct
21 Correct 347 ms 5008 KB Output is correct
22 Correct 421 ms 5564 KB Output is correct
23 Correct 996 ms 17728 KB Output is correct
24 Correct 670 ms 9584 KB Output is correct
25 Correct 516 ms 8516 KB Output is correct
26 Correct 1207 ms 25816 KB Output is correct
27 Correct 1693 ms 50880 KB Output is correct
28 Correct 191 ms 6944 KB Output is correct
29 Correct 307 ms 3064 KB Output is correct
30 Correct 404 ms 5532 KB Output is correct
31 Correct 1129 ms 18616 KB Output is correct
32 Correct 680 ms 10548 KB Output is correct
33 Correct 506 ms 6416 KB Output is correct
34 Correct 1081 ms 25424 KB Output is correct
35 Correct 1534 ms 51056 KB Output is correct
36 Correct 197 ms 2996 KB Output is correct
37 Correct 321 ms 4924 KB Output is correct
38 Correct 389 ms 3288 KB Output is correct
39 Correct 914 ms 17548 KB Output is correct
40 Correct 635 ms 9480 KB Output is correct
41 Correct 125 ms 21216 KB Output is correct
42 Correct 105 ms 21488 KB Output is correct
43 Correct 136 ms 21512 KB Output is correct
44 Correct 235 ms 21552 KB Output is correct
45 Correct 112 ms 21612 KB Output is correct
46 Correct 186 ms 21540 KB Output is correct
47 Correct 177 ms 21612 KB Output is correct
48 Correct 74 ms 18720 KB Output is correct
49 Correct 108 ms 21096 KB Output is correct
50 Correct 101 ms 21484 KB Output is correct
51 Correct 160 ms 21580 KB Output is correct
52 Correct 218 ms 21520 KB Output is correct
53 Correct 111 ms 21520 KB Output is correct
54 Correct 137 ms 21532 KB Output is correct
55 Correct 154 ms 21588 KB Output is correct
56 Correct 69 ms 18404 KB Output is correct
57 Correct 99 ms 21252 KB Output is correct
58 Correct 96 ms 21348 KB Output is correct
59 Correct 166 ms 21472 KB Output is correct
60 Correct 153 ms 21608 KB Output is correct
61 Correct 103 ms 21480 KB Output is correct
62 Correct 173 ms 21608 KB Output is correct
63 Correct 206 ms 21536 KB Output is correct
64 Correct 66 ms 18404 KB Output is correct
65 Correct 131 ms 21184 KB Output is correct
66 Correct 146 ms 21120 KB Output is correct
67 Correct 134 ms 21140 KB Output is correct
68 Correct 123 ms 21124 KB Output is correct
69 Correct 126 ms 21220 KB Output is correct
70 Correct 137 ms 21220 KB Output is correct
71 Correct 936 ms 34372 KB Output is correct
72 Correct 1632 ms 63272 KB Output is correct
73 Runtime error 1564 ms 65540 KB Execution killed with signal 9
74 Halted 0 ms 0 KB -