oj.uz

Submission #1050530

# Submission time Handle Problem Language Result Execution time Memory
1050530 2024-08-09T10:32:02 Z vjudge1 Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 42064 KB 
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define static_assert(...);
#include <tr2/dynamic_bitset>
using custom_bitset = tr2::dynamic_bitset<__uint128_t>;
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define bigInt __int128
#define dl double long
#define fl float
#define all(s) s.begin(), s.end()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pob_front
#define ins insert
#define F first
#define S second
#define len length
const int N = 100010;
const int M = 1010;
const int LN = 131072;
const int INF = 1000000000000000000;
const int MOD = 1e9 + 7;
const int BLOCK = 500;
int binpow(int a, int b, int MOD) {
    int res = 1;
    while (b > 0) {
        if (b & 1) {
            res = res * a;
            res %= MOD;
        }
        a = a * a;
        a %= MOD;
        b >>= 1;
    }
    return res;
}
int MMI(int a, int MOD) {
    int ret = binpow(a, MOD - 2, MOD);
    return ret;
}
// int mdiv(int a, int b) {
//     int ret = a*MMI(b);
//     ret %= MOD;
//     return ret;
// }
int mmul(int a, int b) {
    int ret = (a % MOD) * (b % MOD);
    ret %= MOD;
    return ret;
}
int madd(int a, int b) {
    int ret = (a % MOD) + (b % MOD);
    ret %= MOD;
    return ret;
}
int msub(int a, int b) {
    int ret = (a % MOD) - (b % MOD);
    ret += MOD;
    ret %= MOD;
    return ret;
}
int GCD(int a, int b) {
    if (b == 0) {
        return a;
    }
    return GCD(b, a % b);
}
int LCM(int a, int b) {
    return a*b / GCD(a, b);
}
struct pqComp
{
    bool operator()(const pair<int, int>& p1, const pair<int, int>& p2) const
    {
        return (p1.F < p2.F) || (p1.F == p2.F && p1.S < p2.S);
    }
};
bool pCompF(pair<int, int>& p1, pair<int, int>& p2)
{
    return p1.F < p2.F;
}
bool pCompS(pair<int, int>& p1, pair<int, int>& p2)
{
    return p1.S < p2.S;
}
bool pCompFS(pair<int, int>& p1, pair<int, int>& p2)
{
    return (p1.S < p2.S) || (p1.S == p2.S && p1.F < p2.F);
}
vector <pair<int, int>> DS {{1, 0}, {0, 1}};//{{0, -1}, {1, 0}, {0, 1}, {-1, 0}};//, {-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
int n, q, a[11*N], sub[11*N], sup[11*N];

void solve() {
    cin >> n >> q;
    for (int i = 0; i < (1 << n); ++i) {
        char c; cin >> c;
        a[i] = (c - '0');
    }
    for (int i = 0; i < (1 << n); ++i) {
        sub[i] = a[i];
        sup[i] = a[i];
    }
    for (int i = 0; i < n; ++i) {
        for (int mask = 0; mask < (1 << n); ++mask) {
            if (((mask >> i) & 1)) {
                sub[mask] += sub[mask - (1 << i)];
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int mask = (1 << n) - 1; mask >= 0; --mask) {
            if (!((mask >> i) & 1)) {
                sup[mask] += sup[mask + (1 << i)];
            }
        }
    }
    while (q--) {
        string s; cin >> s;
        map<char,int> cnt;
        for (char c: s) {
            ++cnt[c];
        }
        reverse(all(s));
        int mask = 0;
        map<char,vector<int>> v;
        for (int i = 0; i < n; ++i) {
            v[s[i]].pub(i);
            if (s[i] != '?') {
                mask ^= (1 << i)*(s[i] - '0');
            }
        }
        int ans = 0;
        if (cnt['?'] <= 6) {
            for (int mask1 = 0; mask1 < (1 << cnt['?']); ++mask1) {
                int nmask = mask;
                for (int i = 0; i < cnt['?']; ++i) {
                    if ((mask1 >> i) & 1) {
                        nmask ^= (1 << v['?'][i]);
                    }
                }
                ans += a[nmask];
            }
        }
        else if (cnt['1'] <= 6) {
            for (int i: v['?']) {
                mask += (1 << i);
            }
            for (int mask1 = 0; mask1 < (1 << cnt['1']); ++mask1) {
                int nmask = mask;
                for (int i = 0; i < cnt['1']; ++i) {
                    if ((mask1 >> i) & 1) {
                        nmask ^= (1 << v['1'][i]);
                    }
                }
                if (__builtin_popcount(mask1) % 2) {
                    ans -= sub[nmask];
                }
                else {
                    ans += sub[nmask];
                }
            }
        }
        else {
            for (int mask1 = 0; mask1 < (1 << cnt['0']); ++mask1) {
                int nmask = mask;
                for (int i = 0; i < cnt['0']; ++i) {
                    if ((mask1 >> i) & 1) {
                        nmask ^= (1 << v['0'][i]);
                    }
                }
                if (__builtin_popcount(mask1) % 2) {
                    ans -= sup[nmask];
                }
                else {
                    ans += sup[nmask];
                }
            }
        }
        cout << ans << '\n';
    }
}
 
signed main() {
    speed;
    int T = 1;
    //cin >> T;
    while (T--) {
        solve();
    }
}
/*
НЕ ЗАХОДИТ РЕШЕНИЕ?
1) ПРОВЕРЬ НА ОЧЕВИДНЫЕ ОШИБКИ В КОДЕ
2) ПРОВЕРЬ НА ПЕРЕПОЛНЕНИЯ
3) УБЕДИСЬ В ПРАВИЛЬНОСТИ АЛГОРИТМА
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 2 ms 4588 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4568 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 2 ms 4588 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4568 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1070 ms 17536 KB Output is correct
12 Correct 951 ms 16532 KB Output is correct
13 Correct 635 ms 16208 KB Output is correct
14 Correct 569 ms 15948 KB Output is correct
15 Correct 1750 ms 16980 KB Output is correct
16 Correct 732 ms 16188 KB Output is correct
17 Correct 761 ms 15956 KB Output is correct
18 Correct 287 ms 18000 KB Output is correct
19 Correct 406 ms 14992 KB Output is correct
20 Correct 990 ms 16460 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 2 ms 4588 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4568 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1070 ms 17536 KB Output is correct
12 Correct 951 ms 16532 KB Output is correct
13 Correct 635 ms 16208 KB Output is correct
14 Correct 569 ms 15948 KB Output is correct
15 Correct 1750 ms 16980 KB Output is correct
16 Correct 732 ms 16188 KB Output is correct
17 Correct 761 ms 15956 KB Output is correct
18 Correct 287 ms 18000 KB Output is correct
19 Correct 406 ms 14992 KB Output is correct
20 Correct 990 ms 16460 KB Output is correct
21 Correct 1965 ms 18600 KB Output is correct
22 Correct 941 ms 15748 KB Output is correct
23 Correct 897 ms 15180 KB Output is correct
24 Correct 795 ms 14996 KB Output is correct
25 Correct 637 ms 16792 KB Output is correct
26 Correct 990 ms 15444 KB Output is correct
27 Correct 986 ms 15188 KB Output is correct
28 Correct 285 ms 17744 KB Output is correct
29 Correct 427 ms 13648 KB Output is correct
30 Correct 1397 ms 15956 KB Output is correct
31 Correct 1887 ms 15784 KB Output is correct
32 Correct 1105 ms 15696 KB Output is correct
33 Correct 614 ms 14672 KB Output is correct
34 Correct 814 ms 14672 KB Output is correct
35 Correct 978 ms 15304 KB Output is correct
36 Correct 261 ms 13908 KB Output is correct
37 Correct 1946 ms 15712 KB Output is correct
38 Correct 456 ms 13652 KB Output is correct
39 Correct 852 ms 14932 KB Output is correct
40 Correct 804 ms 14672 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 2 ms 4588 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4568 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 56 ms 27988 KB Output is correct
12 Correct 61 ms 28132 KB Output is correct
13 Correct 88 ms 27988 KB Output is correct
14 Correct 143 ms 28244 KB Output is correct
15 Correct 75 ms 27988 KB Output is correct
16 Correct 119 ms 27912 KB Output is correct
17 Correct 110 ms 27988 KB Output is correct
18 Correct 44 ms 28100 KB Output is correct
19 Correct 62 ms 27988 KB Output is correct
20 Correct 66 ms 27984 KB Output is correct
21 Correct 92 ms 27988 KB Output is correct
22 Correct 148 ms 27988 KB Output is correct
23 Correct 72 ms 27924 KB Output is correct
24 Correct 132 ms 28100 KB Output is correct
25 Correct 104 ms 27988 KB Output is correct
26 Correct 43 ms 27912 KB Output is correct
27 Correct 58 ms 27984 KB Output is correct
28 Correct 57 ms 27984 KB Output is correct
29 Correct 88 ms 27960 KB Output is correct
30 Correct 130 ms 28056 KB Output is correct
31 Correct 71 ms 27992 KB Output is correct
32 Correct 129 ms 27988 KB Output is correct
33 Correct 111 ms 27984 KB Output is correct
34 Correct 41 ms 27920 KB Output is correct
35 Correct 90 ms 27916 KB Output is correct
36 Correct 96 ms 27920 KB Output is correct
37 Correct 97 ms 28244 KB Output is correct
38 Correct 91 ms 27984 KB Output is correct
39 Correct 95 ms 28056 KB Output is correct
40 Correct 97 ms 27988 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 2 ms 4588 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4568 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1070 ms 17536 KB Output is correct
12 Correct 951 ms 16532 KB Output is correct
13 Correct 635 ms 16208 KB Output is correct
14 Correct 569 ms 15948 KB Output is correct
15 Correct 1750 ms 16980 KB Output is correct
16 Correct 732 ms 16188 KB Output is correct
17 Correct 761 ms 15956 KB Output is correct
18 Correct 287 ms 18000 KB Output is correct
19 Correct 406 ms 14992 KB Output is correct
20 Correct 990 ms 16460 KB Output is correct
21 Correct 1965 ms 18600 KB Output is correct
22 Correct 941 ms 15748 KB Output is correct
23 Correct 897 ms 15180 KB Output is correct
24 Correct 795 ms 14996 KB Output is correct
25 Correct 637 ms 16792 KB Output is correct
26 Correct 990 ms 15444 KB Output is correct
27 Correct 986 ms 15188 KB Output is correct
28 Correct 285 ms 17744 KB Output is correct
29 Correct 427 ms 13648 KB Output is correct
30 Correct 1397 ms 15956 KB Output is correct
31 Correct 1887 ms 15784 KB Output is correct
32 Correct 1105 ms 15696 KB Output is correct
33 Correct 614 ms 14672 KB Output is correct
34 Correct 814 ms 14672 KB Output is correct
35 Correct 978 ms 15304 KB Output is correct
36 Correct 261 ms 13908 KB Output is correct
37 Correct 1946 ms 15712 KB Output is correct
38 Correct 456 ms 13652 KB Output is correct
39 Correct 852 ms 14932 KB Output is correct
40 Correct 804 ms 14672 KB Output is correct
41 Correct 56 ms 27988 KB Output is correct
42 Correct 61 ms 28132 KB Output is correct
43 Correct 88 ms 27988 KB Output is correct
44 Correct 143 ms 28244 KB Output is correct
45 Correct 75 ms 27988 KB Output is correct
46 Correct 119 ms 27912 KB Output is correct
47 Correct 110 ms 27988 KB Output is correct
48 Correct 44 ms 28100 KB Output is correct
49 Correct 62 ms 27988 KB Output is correct
50 Correct 66 ms 27984 KB Output is correct
51 Correct 92 ms 27988 KB Output is correct
52 Correct 148 ms 27988 KB Output is correct
53 Correct 72 ms 27924 KB Output is correct
54 Correct 132 ms 28100 KB Output is correct
55 Correct 104 ms 27988 KB Output is correct
56 Correct 43 ms 27912 KB Output is correct
57 Correct 58 ms 27984 KB Output is correct
58 Correct 57 ms 27984 KB Output is correct
59 Correct 88 ms 27960 KB Output is correct
60 Correct 130 ms 28056 KB Output is correct
61 Correct 71 ms 27992 KB Output is correct
62 Correct 129 ms 27988 KB Output is correct
63 Correct 111 ms 27984 KB Output is correct
64 Correct 41 ms 27920 KB Output is correct
65 Correct 90 ms 27916 KB Output is correct
66 Correct 96 ms 27920 KB Output is correct
67 Correct 97 ms 28244 KB Output is correct
68 Correct 91 ms 27984 KB Output is correct
69 Correct 95 ms 28056 KB Output is correct
70 Correct 97 ms 27988 KB Output is correct
71 Correct 641 ms 41716 KB Output is correct
72 Correct 761 ms 42064 KB Output is correct
73 Correct 1322 ms 40396 KB Output is correct
74 Execution timed out 2086 ms 38996 KB Time limit exceeded
75 Halted 0 ms 0 KB -