oj.uz

답안 #589634

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589634 2022-07-05T02:29:03 Z wiwiho Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 40576 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())

using namespace std;
using namespace __gnu_pbds;

#define orz
#ifdef orz
#define print(a...)cerr<<"Line "<<__LINE__<<":",kout("[" + string(#a) + "] = ", a)
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); }
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
#else
#define print(a...)
void kout() {}
template<class T1, class ... T2> void kout(T1 a, T2 ... e) {}
#define printv(a, b)
#endif

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int main(){
    StarBurstStream

    int L, q;
    cin >> L >> q;
    int n = 1 << L;
    
    string ts;
    cin >> ts;

    vector<int> a(n);
    for(int i = 0; i < n; i++){
        a[i] = ts[i] - '0';
    }

    vector<int> one(n), zero(n);
    for(int i = 0; i < n; i++){
        int tmp = 0;
        for(int j = 0; j < L; j++){
            if(1 << j & i) tmp |= 1 << j;
        }
        one[tmp] += a[i];
        zero[((1 << L) - 1) ^ tmp] += a [i];
    }

    auto solvedp = [&](vector<int>& dp){
        for(int i = 0; i < L; i++){
            for(int j = 0; j < n; j++){
                if(1 << i & j) continue;
                dp[j] += dp[j ^ (1 << i)];
            }
        }
    };

    solvedp(zero);
    solvedp(one);

    auto solveq = [&](string& s){
        int now = 0;
        function<ll(int)> dfs = [&](int i){
            if(i == L) return (ll)a[now];
            now <<= 1;
            ll ans = 0;
            if(s[i] == '1'){
                now |= 1;
                ans += dfs(i + 1);
            }
            else if(s[i] == '0'){
                ans += dfs(i + 1);
            }
            else{
                ans += dfs(i + 1);
                now |= 1;
                ans += dfs(i + 1);
            }
            now >>= 1;
            return ans;
        };
        return dfs(0);
    };
    auto solve0 = [&](string& s){
        int now = 0;
        int cnt = 0;
        function<ll(int)> dfs = [&](int i){
            if(i == L) return (ll)one[now] * (cnt % 2 ? -1 : 1);
            now <<= 1;
            ll ans = 0;
            if(s[i] == '1'){
                now |= 1;
                ans += dfs(i + 1);
            }
            else if(s[i] == '0'){
                ans += dfs(i + 1);
                now |= 1;
                cnt++;
                ans += dfs(i + 1);
                cnt--;
            }
            else{
                ans += dfs(i + 1);
            }
            now >>= 1;
            return ans;
        };
        return dfs(0);
    };
    auto solve1 = [&](string& s){
        int now = 0;
        int cnt = 0;
        function<ll(int)> dfs = [&](int i){
            if(i == L) return (ll)zero[now] * (cnt % 2 ? -1 : 1);
            now <<= 1;
            ll ans = 0;
            if(s[i] == '1'){
                ans += dfs(i + 1);
                now |= 1;
                cnt++;
                ans += dfs(i + 1);
                cnt--;
            }
            else if(s[i] == '0'){
                now |= 1;
                ans += dfs(i + 1);
            }
            else{
                ans += dfs(i + 1);
            }
            now >>= 1;
            return ans;
        };
        return dfs(0);
    };

    while(q--){
        string s;
        cin >> s;
        int o = 0, z = 0, qm = 0;
        for(char i : s){
            if(i == '0') z++;
            else if(i == '1') o++;
            else qm++;
        }
        int mn = min({o, z, qm});
        ll ans = 0;
        if(mn == z) ans = solve0(s);
        else if(mn == o) ans = solve1(s);
        else ans = solveq(s);
        cout << ans << "\n";
    }


    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 333 ms 15040 KB Output is correct
12 Correct 357 ms 14672 KB Output is correct
13 Correct 515 ms 14084 KB Output is correct
14 Correct 731 ms 14004 KB Output is correct
15 Correct 421 ms 15148 KB Output is correct
16 Correct 687 ms 14224 KB Output is correct
17 Correct 634 ms 14152 KB Output is correct
18 Correct 286 ms 16080 KB Output is correct
19 Correct 323 ms 13064 KB Output is correct
20 Correct 354 ms 14708 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 333 ms 15040 KB Output is correct
12 Correct 357 ms 14672 KB Output is correct
13 Correct 515 ms 14084 KB Output is correct
14 Correct 731 ms 14004 KB Output is correct
15 Correct 421 ms 15148 KB Output is correct
16 Correct 687 ms 14224 KB Output is correct
17 Correct 634 ms 14152 KB Output is correct
18 Correct 286 ms 16080 KB Output is correct
19 Correct 323 ms 13064 KB Output is correct
20 Correct 354 ms 14708 KB Output is correct
21 Correct 413 ms 18132 KB Output is correct
22 Correct 408 ms 18304 KB Output is correct
23 Correct 838 ms 17320 KB Output is correct
24 Correct 1355 ms 17108 KB Output is correct
25 Correct 596 ms 19044 KB Output is correct
26 Correct 1140 ms 17664 KB Output is correct
27 Correct 952 ms 17500 KB Output is correct
28 Correct 309 ms 20112 KB Output is correct
29 Correct 402 ms 16112 KB Output is correct
30 Correct 409 ms 18292 KB Output is correct
31 Correct 813 ms 18064 KB Output is correct
32 Correct 1353 ms 18076 KB Output is correct
33 Correct 609 ms 16952 KB Output is correct
34 Correct 1100 ms 17140 KB Output is correct
35 Correct 937 ms 17600 KB Output is correct
36 Correct 316 ms 16048 KB Output is correct
37 Correct 427 ms 18036 KB Output is correct
38 Correct 397 ms 16056 KB Output is correct
39 Correct 843 ms 17408 KB Output is correct
40 Correct 1357 ms 17248 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 187 ms 16080 KB Output is correct
12 Correct 175 ms 16040 KB Output is correct
13 Correct 241 ms 15956 KB Output is correct
14 Correct 370 ms 16040 KB Output is correct
15 Correct 210 ms 16084 KB Output is correct
16 Correct 349 ms 16136 KB Output is correct
17 Correct 302 ms 15964 KB Output is correct
18 Correct 160 ms 16240 KB Output is correct
19 Correct 167 ms 15964 KB Output is correct
20 Correct 171 ms 16084 KB Output is correct
21 Correct 244 ms 15980 KB Output is correct
22 Correct 387 ms 16104 KB Output is correct
23 Correct 201 ms 15908 KB Output is correct
24 Correct 354 ms 15948 KB Output is correct
25 Correct 300 ms 15940 KB Output is correct
26 Correct 155 ms 15876 KB Output is correct
27 Correct 180 ms 16056 KB Output is correct
28 Correct 175 ms 15896 KB Output is correct
29 Correct 242 ms 15952 KB Output is correct
30 Correct 358 ms 15976 KB Output is correct
31 Correct 196 ms 15908 KB Output is correct
32 Correct 351 ms 15968 KB Output is correct
33 Correct 296 ms 15980 KB Output is correct
34 Correct 155 ms 15908 KB Output is correct
35 Correct 263 ms 16080 KB Output is correct
36 Correct 280 ms 15980 KB Output is correct
37 Correct 255 ms 15980 KB Output is correct
38 Correct 256 ms 15940 KB Output is correct
39 Correct 268 ms 16052 KB Output is correct
40 Correct 255 ms 16052 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 333 ms 15040 KB Output is correct
12 Correct 357 ms 14672 KB Output is correct
13 Correct 515 ms 14084 KB Output is correct
14 Correct 731 ms 14004 KB Output is correct
15 Correct 421 ms 15148 KB Output is correct
16 Correct 687 ms 14224 KB Output is correct
17 Correct 634 ms 14152 KB Output is correct
18 Correct 286 ms 16080 KB Output is correct
19 Correct 323 ms 13064 KB Output is correct
20 Correct 354 ms 14708 KB Output is correct
21 Correct 413 ms 18132 KB Output is correct
22 Correct 408 ms 18304 KB Output is correct
23 Correct 838 ms 17320 KB Output is correct
24 Correct 1355 ms 17108 KB Output is correct
25 Correct 596 ms 19044 KB Output is correct
26 Correct 1140 ms 17664 KB Output is correct
27 Correct 952 ms 17500 KB Output is correct
28 Correct 309 ms 20112 KB Output is correct
29 Correct 402 ms 16112 KB Output is correct
30 Correct 409 ms 18292 KB Output is correct
31 Correct 813 ms 18064 KB Output is correct
32 Correct 1353 ms 18076 KB Output is correct
33 Correct 609 ms 16952 KB Output is correct
34 Correct 1100 ms 17140 KB Output is correct
35 Correct 937 ms 17600 KB Output is correct
36 Correct 316 ms 16048 KB Output is correct
37 Correct 427 ms 18036 KB Output is correct
38 Correct 397 ms 16056 KB Output is correct
39 Correct 843 ms 17408 KB Output is correct
40 Correct 1357 ms 17248 KB Output is correct
41 Correct 187 ms 16080 KB Output is correct
42 Correct 175 ms 16040 KB Output is correct
43 Correct 241 ms 15956 KB Output is correct
44 Correct 370 ms 16040 KB Output is correct
45 Correct 210 ms 16084 KB Output is correct
46 Correct 349 ms 16136 KB Output is correct
47 Correct 302 ms 15964 KB Output is correct
48 Correct 160 ms 16240 KB Output is correct
49 Correct 167 ms 15964 KB Output is correct
50 Correct 171 ms 16084 KB Output is correct
51 Correct 244 ms 15980 KB Output is correct
52 Correct 387 ms 16104 KB Output is correct
53 Correct 201 ms 15908 KB Output is correct
54 Correct 354 ms 15948 KB Output is correct
55 Correct 300 ms 15940 KB Output is correct
56 Correct 155 ms 15876 KB Output is correct
57 Correct 180 ms 16056 KB Output is correct
58 Correct 175 ms 15896 KB Output is correct
59 Correct 242 ms 15952 KB Output is correct
60 Correct 358 ms 15976 KB Output is correct
61 Correct 196 ms 15908 KB Output is correct
62 Correct 351 ms 15968 KB Output is correct
63 Correct 296 ms 15980 KB Output is correct
64 Correct 155 ms 15908 KB Output is correct
65 Correct 263 ms 16080 KB Output is correct
66 Correct 280 ms 15980 KB Output is correct
67 Correct 255 ms 15980 KB Output is correct
68 Correct 256 ms 15940 KB Output is correct
69 Correct 268 ms 16052 KB Output is correct
70 Correct 255 ms 16052 KB Output is correct
71 Correct 766 ms 40508 KB Output is correct
72 Correct 785 ms 40576 KB Output is correct
73 Execution timed out 2067 ms 36000 KB Time limit exceeded
74 Halted 0 ms 0 KB -