oj.uz

Submission #533937

# Submission time Handle Problem Language Result Execution time Memory
533937 2022-03-07T16:17:37 Z radal Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 1632 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 int 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];
map<ll,int> mp;
ll pw[40];
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][1] = sos[i][0] = (s[i]-'0');
    repr(j,l-1,0)
        repr(i,n-1,0)
            if (i&(1 << j))
                sos[i][1] += sos[i-(1 << j)][1];
    repr(j,l-1,0){
        rep(i,0,n){
            if ((i&(1 << j)) == 0)
                sos[i][0] += sos[i+(1 << j)][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][1];
                else ans += sos[sum][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];
            else ans += sos[sum][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 2 ms 332 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 388 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 2 ms 332 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 388 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 257 ms 4332 KB Output is correct
12 Correct 310 ms 3984 KB Output is correct
13 Correct 405 ms 3624 KB Output is correct
14 Correct 352 ms 3524 KB Output is correct
15 Correct 352 ms 4548 KB Output is correct
16 Correct 465 ms 4592 KB Output is correct
17 Correct 553 ms 7304 KB Output is correct
18 Correct 160 ms 5308 KB Output is correct
19 Correct 254 ms 2280 KB Output is correct
20 Correct 284 ms 4056 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 2 ms 332 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 388 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 257 ms 4332 KB Output is correct
12 Correct 310 ms 3984 KB Output is correct
13 Correct 405 ms 3624 KB Output is correct
14 Correct 352 ms 3524 KB Output is correct
15 Correct 352 ms 4548 KB Output is correct
16 Correct 465 ms 4592 KB Output is correct
17 Correct 553 ms 7304 KB Output is correct
18 Correct 160 ms 5308 KB Output is correct
19 Correct 254 ms 2280 KB Output is correct
20 Correct 284 ms 4056 KB Output is correct
21 Correct 394 ms 4472 KB Output is correct
22 Correct 402 ms 4964 KB Output is correct
23 Correct 981 ms 17180 KB Output is correct
24 Correct 667 ms 8980 KB Output is correct
25 Correct 504 ms 7948 KB Output is correct
26 Correct 1173 ms 25456 KB Output is correct
27 Correct 1507 ms 50412 KB Output is correct
28 Correct 175 ms 6304 KB Output is correct
29 Correct 330 ms 2496 KB Output is correct
30 Correct 401 ms 5072 KB Output is correct
31 Correct 1014 ms 17988 KB Output is correct
32 Correct 642 ms 10020 KB Output is correct
33 Correct 530 ms 5784 KB Output is correct
34 Correct 1083 ms 24796 KB Output is correct
35 Correct 1632 ms 50364 KB Output is correct
36 Correct 159 ms 2436 KB Output is correct
37 Correct 314 ms 4396 KB Output is correct
38 Correct 419 ms 2840 KB Output is correct
39 Correct 1002 ms 17260 KB Output is correct
40 Correct 691 ms 8940 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 2 ms 332 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 388 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 77 ms 12556 KB Output is correct
12 Correct 112 ms 12820 KB Output is correct
13 Correct 111 ms 12852 KB Output is correct
14 Correct 150 ms 12832 KB Output is correct
15 Correct 90 ms 12848 KB Output is correct
16 Correct 139 ms 12852 KB Output is correct
17 Correct 133 ms 12876 KB Output is correct
18 Correct 51 ms 9996 KB Output is correct
19 Correct 76 ms 12364 KB Output is correct
20 Correct 89 ms 12916 KB Output is correct
21 Correct 139 ms 12852 KB Output is correct
22 Correct 161 ms 12756 KB Output is correct
23 Correct 89 ms 12820 KB Output is correct
24 Correct 117 ms 12872 KB Output is correct
25 Correct 130 ms 12880 KB Output is correct
26 Correct 59 ms 9688 KB Output is correct
27 Correct 80 ms 12500 KB Output is correct
28 Correct 75 ms 12644 KB Output is correct
29 Correct 113 ms 12744 KB Output is correct
30 Correct 131 ms 12788 KB Output is correct
31 Correct 96 ms 12936 KB Output is correct
32 Correct 139 ms 12832 KB Output is correct
33 Correct 138 ms 12884 KB Output is correct
34 Correct 51 ms 9680 KB Output is correct
35 Correct 118 ms 12488 KB Output is correct
36 Correct 105 ms 12392 KB Output is correct
37 Correct 115 ms 12504 KB Output is correct
38 Correct 111 ms 12484 KB Output is correct
39 Correct 105 ms 12376 KB Output is correct
40 Correct 104 ms 12388 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 2 ms 332 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 388 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 257 ms 4332 KB Output is correct
12 Correct 310 ms 3984 KB Output is correct
13 Correct 405 ms 3624 KB Output is correct
14 Correct 352 ms 3524 KB Output is correct
15 Correct 352 ms 4548 KB Output is correct
16 Correct 465 ms 4592 KB Output is correct
17 Correct 553 ms 7304 KB Output is correct
18 Correct 160 ms 5308 KB Output is correct
19 Correct 254 ms 2280 KB Output is correct
20 Correct 284 ms 4056 KB Output is correct
21 Correct 394 ms 4472 KB Output is correct
22 Correct 402 ms 4964 KB Output is correct
23 Correct 981 ms 17180 KB Output is correct
24 Correct 667 ms 8980 KB Output is correct
25 Correct 504 ms 7948 KB Output is correct
26 Correct 1173 ms 25456 KB Output is correct
27 Correct 1507 ms 50412 KB Output is correct
28 Correct 175 ms 6304 KB Output is correct
29 Correct 330 ms 2496 KB Output is correct
30 Correct 401 ms 5072 KB Output is correct
31 Correct 1014 ms 17988 KB Output is correct
32 Correct 642 ms 10020 KB Output is correct
33 Correct 530 ms 5784 KB Output is correct
34 Correct 1083 ms 24796 KB Output is correct
35 Correct 1632 ms 50364 KB Output is correct
36 Correct 159 ms 2436 KB Output is correct
37 Correct 314 ms 4396 KB Output is correct
38 Correct 419 ms 2840 KB Output is correct
39 Correct 1002 ms 17260 KB Output is correct
40 Correct 691 ms 8940 KB Output is correct
41 Correct 77 ms 12556 KB Output is correct
42 Correct 112 ms 12820 KB Output is correct
43 Correct 111 ms 12852 KB Output is correct
44 Correct 150 ms 12832 KB Output is correct
45 Correct 90 ms 12848 KB Output is correct
46 Correct 139 ms 12852 KB Output is correct
47 Correct 133 ms 12876 KB Output is correct
48 Correct 51 ms 9996 KB Output is correct
49 Correct 76 ms 12364 KB Output is correct
50 Correct 89 ms 12916 KB Output is correct
51 Correct 139 ms 12852 KB Output is correct
52 Correct 161 ms 12756 KB Output is correct
53 Correct 89 ms 12820 KB Output is correct
54 Correct 117 ms 12872 KB Output is correct
55 Correct 130 ms 12880 KB Output is correct
56 Correct 59 ms 9688 KB Output is correct
57 Correct 80 ms 12500 KB Output is correct
58 Correct 75 ms 12644 KB Output is correct
59 Correct 113 ms 12744 KB Output is correct
60 Correct 131 ms 12788 KB Output is correct
61 Correct 96 ms 12936 KB Output is correct
62 Correct 139 ms 12832 KB Output is correct
63 Correct 138 ms 12884 KB Output is correct
64 Correct 51 ms 9680 KB Output is correct
65 Correct 118 ms 12488 KB Output is correct
66 Correct 105 ms 12392 KB Output is correct
67 Correct 115 ms 12504 KB Output is correct
68 Correct 111 ms 12484 KB Output is correct
69 Correct 105 ms 12376 KB Output is correct
70 Correct 104 ms 12388 KB Output is correct
71 Correct 909 ms 26052 KB Output is correct
72 Correct 1421 ms 55012 KB Output is correct
73 Runtime error 1619 ms 65540 KB Execution killed with signal 9
74 Halted 0 ms 0 KB -