oj.uz

Submission #533935

# Submission time Handle Problem Language Result Execution time Memory
533935 2022-03-07T16:14:53 Z radal Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 1660 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 2 ms 332 KB Output is correct
2 Correct 1 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 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 328 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 2 ms 332 KB Output is correct
2 Correct 1 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 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 328 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 294 ms 4444 KB Output is correct
12 Correct 291 ms 4496 KB Output is correct
13 Correct 401 ms 4352 KB Output is correct
14 Correct 389 ms 3996 KB Output is correct
15 Correct 339 ms 4956 KB Output is correct
16 Correct 463 ms 4920 KB Output is correct
17 Correct 582 ms 7624 KB Output is correct
18 Correct 187 ms 5828 KB Output is correct
19 Correct 226 ms 2756 KB Output is correct
20 Correct 300 ms 4464 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1 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 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 328 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 294 ms 4444 KB Output is correct
12 Correct 291 ms 4496 KB Output is correct
13 Correct 401 ms 4352 KB Output is correct
14 Correct 389 ms 3996 KB Output is correct
15 Correct 339 ms 4956 KB Output is correct
16 Correct 463 ms 4920 KB Output is correct
17 Correct 582 ms 7624 KB Output is correct
18 Correct 187 ms 5828 KB Output is correct
19 Correct 226 ms 2756 KB Output is correct
20 Correct 300 ms 4464 KB Output is correct
21 Correct 320 ms 5004 KB Output is correct
22 Correct 422 ms 5592 KB Output is correct
23 Correct 935 ms 17620 KB Output is correct
24 Correct 685 ms 9528 KB Output is correct
25 Correct 513 ms 8540 KB Output is correct
26 Correct 1410 ms 25504 KB Output is correct
27 Correct 1614 ms 50740 KB Output is correct
28 Correct 174 ms 6852 KB Output is correct
29 Correct 344 ms 2748 KB Output is correct
30 Correct 463 ms 5400 KB Output is correct
31 Correct 1108 ms 18368 KB Output is correct
32 Correct 631 ms 10308 KB Output is correct
33 Correct 510 ms 6156 KB Output is correct
34 Correct 1168 ms 25276 KB Output is correct
35 Correct 1568 ms 50836 KB Output is correct
36 Correct 171 ms 2668 KB Output is correct
37 Correct 396 ms 4808 KB Output is correct
38 Correct 396 ms 3196 KB Output is correct
39 Correct 941 ms 17576 KB Output is correct
40 Correct 657 ms 9568 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1 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 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 328 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 87 ms 12692 KB Output is correct
12 Correct 93 ms 12992 KB Output is correct
13 Correct 107 ms 13024 KB Output is correct
14 Correct 169 ms 13144 KB Output is correct
15 Correct 92 ms 13140 KB Output is correct
16 Correct 170 ms 12996 KB Output is correct
17 Correct 145 ms 13084 KB Output is correct
18 Correct 52 ms 10168 KB Output is correct
19 Correct 79 ms 12772 KB Output is correct
20 Correct 84 ms 13296 KB Output is correct
21 Correct 134 ms 13048 KB Output is correct
22 Correct 158 ms 13280 KB Output is correct
23 Correct 92 ms 13176 KB Output is correct
24 Correct 120 ms 13292 KB Output is correct
25 Correct 129 ms 13256 KB Output is correct
26 Correct 50 ms 10116 KB Output is correct
27 Correct 82 ms 12660 KB Output is correct
28 Correct 78 ms 13056 KB Output is correct
29 Correct 105 ms 13364 KB Output is correct
30 Correct 118 ms 13300 KB Output is correct
31 Correct 92 ms 13188 KB Output is correct
32 Correct 153 ms 13332 KB Output is correct
33 Correct 124 ms 13284 KB Output is correct
34 Correct 53 ms 10256 KB Output is correct
35 Correct 109 ms 12900 KB Output is correct
36 Correct 117 ms 12840 KB Output is correct
37 Correct 107 ms 12932 KB Output is correct
38 Correct 110 ms 12920 KB Output is correct
39 Correct 113 ms 12864 KB Output is correct
40 Correct 121 ms 12900 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1 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 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 328 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 294 ms 4444 KB Output is correct
12 Correct 291 ms 4496 KB Output is correct
13 Correct 401 ms 4352 KB Output is correct
14 Correct 389 ms 3996 KB Output is correct
15 Correct 339 ms 4956 KB Output is correct
16 Correct 463 ms 4920 KB Output is correct
17 Correct 582 ms 7624 KB Output is correct
18 Correct 187 ms 5828 KB Output is correct
19 Correct 226 ms 2756 KB Output is correct
20 Correct 300 ms 4464 KB Output is correct
21 Correct 320 ms 5004 KB Output is correct
22 Correct 422 ms 5592 KB Output is correct
23 Correct 935 ms 17620 KB Output is correct
24 Correct 685 ms 9528 KB Output is correct
25 Correct 513 ms 8540 KB Output is correct
26 Correct 1410 ms 25504 KB Output is correct
27 Correct 1614 ms 50740 KB Output is correct
28 Correct 174 ms 6852 KB Output is correct
29 Correct 344 ms 2748 KB Output is correct
30 Correct 463 ms 5400 KB Output is correct
31 Correct 1108 ms 18368 KB Output is correct
32 Correct 631 ms 10308 KB Output is correct
33 Correct 510 ms 6156 KB Output is correct
34 Correct 1168 ms 25276 KB Output is correct
35 Correct 1568 ms 50836 KB Output is correct
36 Correct 171 ms 2668 KB Output is correct
37 Correct 396 ms 4808 KB Output is correct
38 Correct 396 ms 3196 KB Output is correct
39 Correct 941 ms 17576 KB Output is correct
40 Correct 657 ms 9568 KB Output is correct
41 Correct 87 ms 12692 KB Output is correct
42 Correct 93 ms 12992 KB Output is correct
43 Correct 107 ms 13024 KB Output is correct
44 Correct 169 ms 13144 KB Output is correct
45 Correct 92 ms 13140 KB Output is correct
46 Correct 170 ms 12996 KB Output is correct
47 Correct 145 ms 13084 KB Output is correct
48 Correct 52 ms 10168 KB Output is correct
49 Correct 79 ms 12772 KB Output is correct
50 Correct 84 ms 13296 KB Output is correct
51 Correct 134 ms 13048 KB Output is correct
52 Correct 158 ms 13280 KB Output is correct
53 Correct 92 ms 13176 KB Output is correct
54 Correct 120 ms 13292 KB Output is correct
55 Correct 129 ms 13256 KB Output is correct
56 Correct 50 ms 10116 KB Output is correct
57 Correct 82 ms 12660 KB Output is correct
58 Correct 78 ms 13056 KB Output is correct
59 Correct 105 ms 13364 KB Output is correct
60 Correct 118 ms 13300 KB Output is correct
61 Correct 92 ms 13188 KB Output is correct
62 Correct 153 ms 13332 KB Output is correct
63 Correct 124 ms 13284 KB Output is correct
64 Correct 53 ms 10256 KB Output is correct
65 Correct 109 ms 12900 KB Output is correct
66 Correct 117 ms 12840 KB Output is correct
67 Correct 107 ms 12932 KB Output is correct
68 Correct 110 ms 12920 KB Output is correct
69 Correct 113 ms 12864 KB Output is correct
70 Correct 121 ms 12900 KB Output is correct
71 Correct 1025 ms 26184 KB Output is correct
72 Correct 1449 ms 55232 KB Output is correct
73 Runtime error 1660 ms 65540 KB Execution killed with signal 9
74 Halted 0 ms 0 KB -