oj.uz

답안 #533929

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533929 2022-03-07T16:06:03 Z radal Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1599 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][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][(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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 332 KB Output is correct
5 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 332 KB Output is correct
5 Correct 1 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 233 ms 4260 KB Output is correct
12 Correct 370 ms 4044 KB Output is correct
13 Correct 390 ms 3744 KB Output is correct
14 Correct 359 ms 3524 KB Output is correct
15 Correct 416 ms 4564 KB Output is correct
16 Correct 453 ms 4424 KB Output is correct
17 Correct 551 ms 7144 KB Output is correct
18 Correct 174 ms 5296 KB Output is correct
19 Correct 276 ms 2364 KB Output is correct
20 Correct 299 ms 4028 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 332 KB Output is correct
5 Correct 1 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 233 ms 4260 KB Output is correct
12 Correct 370 ms 4044 KB Output is correct
13 Correct 390 ms 3744 KB Output is correct
14 Correct 359 ms 3524 KB Output is correct
15 Correct 416 ms 4564 KB Output is correct
16 Correct 453 ms 4424 KB Output is correct
17 Correct 551 ms 7144 KB Output is correct
18 Correct 174 ms 5296 KB Output is correct
19 Correct 276 ms 2364 KB Output is correct
20 Correct 299 ms 4028 KB Output is correct
21 Correct 321 ms 4584 KB Output is correct
22 Correct 477 ms 5060 KB Output is correct
23 Correct 939 ms 17228 KB Output is correct
24 Correct 625 ms 9024 KB Output is correct
25 Correct 521 ms 7960 KB Output is correct
26 Correct 1220 ms 25512 KB Output is correct
27 Correct 1599 ms 50392 KB Output is correct
28 Correct 173 ms 6464 KB Output is correct
29 Correct 311 ms 2520 KB Output is correct
30 Correct 435 ms 5144 KB Output is correct
31 Correct 971 ms 18044 KB Output is correct
32 Correct 662 ms 10044 KB Output is correct
33 Correct 524 ms 5924 KB Output is correct
34 Correct 1006 ms 24984 KB Output is correct
35 Correct 1540 ms 50532 KB Output is correct
36 Correct 159 ms 2452 KB Output is correct
37 Correct 316 ms 4548 KB Output is correct
38 Correct 390 ms 2928 KB Output is correct
39 Correct 956 ms 17172 KB Output is correct
40 Correct 648 ms 9116 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 332 KB Output is correct
5 Correct 1 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 96 ms 20704 KB Output is correct
12 Correct 105 ms 20952 KB Output is correct
13 Correct 116 ms 21012 KB Output is correct
14 Correct 224 ms 21136 KB Output is correct
15 Correct 106 ms 21108 KB Output is correct
16 Correct 164 ms 21092 KB Output is correct
17 Correct 139 ms 21084 KB Output is correct
18 Correct 71 ms 18264 KB Output is correct
19 Correct 98 ms 20580 KB Output is correct
20 Correct 104 ms 21080 KB Output is correct
21 Correct 123 ms 21092 KB Output is correct
22 Correct 199 ms 21084 KB Output is correct
23 Correct 110 ms 21032 KB Output is correct
24 Correct 138 ms 21060 KB Output is correct
25 Correct 137 ms 21076 KB Output is correct
26 Correct 66 ms 17912 KB Output is correct
27 Correct 104 ms 20696 KB Output is correct
28 Correct 96 ms 20824 KB Output is correct
29 Correct 118 ms 20964 KB Output is correct
30 Correct 134 ms 21032 KB Output is correct
31 Correct 116 ms 20920 KB Output is correct
32 Correct 166 ms 21080 KB Output is correct
33 Correct 139 ms 21092 KB Output is correct
34 Correct 66 ms 17892 KB Output is correct
35 Correct 145 ms 20568 KB Output is correct
36 Correct 126 ms 20656 KB Output is correct
37 Correct 122 ms 20696 KB Output is correct
38 Correct 125 ms 20576 KB Output is correct
39 Correct 123 ms 20708 KB Output is correct
40 Correct 130 ms 20632 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 332 KB Output is correct
5 Correct 1 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 233 ms 4260 KB Output is correct
12 Correct 370 ms 4044 KB Output is correct
13 Correct 390 ms 3744 KB Output is correct
14 Correct 359 ms 3524 KB Output is correct
15 Correct 416 ms 4564 KB Output is correct
16 Correct 453 ms 4424 KB Output is correct
17 Correct 551 ms 7144 KB Output is correct
18 Correct 174 ms 5296 KB Output is correct
19 Correct 276 ms 2364 KB Output is correct
20 Correct 299 ms 4028 KB Output is correct
21 Correct 321 ms 4584 KB Output is correct
22 Correct 477 ms 5060 KB Output is correct
23 Correct 939 ms 17228 KB Output is correct
24 Correct 625 ms 9024 KB Output is correct
25 Correct 521 ms 7960 KB Output is correct
26 Correct 1220 ms 25512 KB Output is correct
27 Correct 1599 ms 50392 KB Output is correct
28 Correct 173 ms 6464 KB Output is correct
29 Correct 311 ms 2520 KB Output is correct
30 Correct 435 ms 5144 KB Output is correct
31 Correct 971 ms 18044 KB Output is correct
32 Correct 662 ms 10044 KB Output is correct
33 Correct 524 ms 5924 KB Output is correct
34 Correct 1006 ms 24984 KB Output is correct
35 Correct 1540 ms 50532 KB Output is correct
36 Correct 159 ms 2452 KB Output is correct
37 Correct 316 ms 4548 KB Output is correct
38 Correct 390 ms 2928 KB Output is correct
39 Correct 956 ms 17172 KB Output is correct
40 Correct 648 ms 9116 KB Output is correct
41 Correct 96 ms 20704 KB Output is correct
42 Correct 105 ms 20952 KB Output is correct
43 Correct 116 ms 21012 KB Output is correct
44 Correct 224 ms 21136 KB Output is correct
45 Correct 106 ms 21108 KB Output is correct
46 Correct 164 ms 21092 KB Output is correct
47 Correct 139 ms 21084 KB Output is correct
48 Correct 71 ms 18264 KB Output is correct
49 Correct 98 ms 20580 KB Output is correct
50 Correct 104 ms 21080 KB Output is correct
51 Correct 123 ms 21092 KB Output is correct
52 Correct 199 ms 21084 KB Output is correct
53 Correct 110 ms 21032 KB Output is correct
54 Correct 138 ms 21060 KB Output is correct
55 Correct 137 ms 21076 KB Output is correct
56 Correct 66 ms 17912 KB Output is correct
57 Correct 104 ms 20696 KB Output is correct
58 Correct 96 ms 20824 KB Output is correct
59 Correct 118 ms 20964 KB Output is correct
60 Correct 134 ms 21032 KB Output is correct
61 Correct 116 ms 20920 KB Output is correct
62 Correct 166 ms 21080 KB Output is correct
63 Correct 139 ms 21092 KB Output is correct
64 Correct 66 ms 17892 KB Output is correct
65 Correct 145 ms 20568 KB Output is correct
66 Correct 126 ms 20656 KB Output is correct
67 Correct 122 ms 20696 KB Output is correct
68 Correct 125 ms 20576 KB Output is correct
69 Correct 123 ms 20708 KB Output is correct
70 Correct 130 ms 20632 KB Output is correct
71 Correct 910 ms 34272 KB Output is correct
72 Correct 1473 ms 63244 KB Output is correct
73 Runtime error 1420 ms 65540 KB Execution killed with signal 9
74 Halted 0 ms 0 KB -