oj.uz

Submission #1098448

# Submission time Handle Problem Language Result Execution time Memory
1098448 2024-10-09T11:50:26 Z anhthi Snake Escaping (JOI18_snake_escaping) C++14
12 / 100
 2000 ms 20052 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define fi first
#define se second
#define ll long long
#define mp(x, y) make_pair(x, y)
#define sz(v) ((int) (v).size())
#define all(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define BIT(x, y) (((x) >> (y)) & 1)
#define pb push_back
#define heap priority_queue
#define max_rng *max_element
#define min_rng *min_element
#define rep(i, n) for(int i = 1, _n = (n); i <= _n; ++i)
#define forn(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define ford(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)

 
template <class X, class Y>
    inline bool maximize(X &x, Y y) {
        return (x < y ? x = y, true : false);
    }
 
template <class X, class Y>
    inline bool minimize(X &x, Y y) {
        return (x > y ? x = y, true : false);
    }
 
template <class X>
    inline void compress(vector<X> &a) {
        sort(all(a));
        a.resize(unique(all(a)) - a.begin());
    }
 
int ctz(ll x) { return __builtin_ctzll(x); }
int lg(ll x) { return 63 - __builtin_clzll(x); }
int popcnt(ll x) { return __builtin_popcount(x); }
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) {
    return l + abs((ll) rng()) % (r - l + 1);
}
 
const ll oo = (ll) 1e18 + 5;
const int inf = (ll) 1e9 + 7, mod = (ll) 1e9 + 7;
 
const int N = 21, LOG = 21;
 
void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }

int L, Q;
char cost[MASK(N) + 5];
ll f[MASK(N) + 5], dp[MASK(N) + 5];

int main(void) {
 
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> L >> Q;
    forn(i, 0, MASK(L) - 1) {
        cin >> cost[i];
        f[i] = dp[i] = cost[i] - '0'; 
    }

    forn(i, 0, L - 1) forn(msk, 0, MASK(L) - 1)
        if (BIT(msk, i)) f[msk] += f[msk - MASK(i)];
    forn(i, 0, L - 1) forn(msk, 0, MASK(L) - 1)
        if (!BIT(msk, i)) dp[msk] += dp[msk + MASK(i)];

    string s;
    rep(_, Q) {
        cin >> s;

        int mask1 = 0, mask2 = 0;
        forn(i, 0, L - 1) {
            int cur = MASK(L - i - 1);
            if (s[i] == '1')
                mask1 += cur;
            else if (s[i] == '?') mask2 += cur;
        }
        ll res = 0;
        if (popcnt(mask2) <= 10) {
            for (int msk = mask2; ; msk = (msk - 1) & mask2) {
                res += cost[msk + mask1] - '0';
                if (!msk) break;
            }
        }
        else {
            for (int msk = mask1; ; msk = (msk - 1) & mask1) {
                if (popcnt(msk) & 1) res -= dp[msk + mask2];
                else res += dp[msk + mask2];
            }    
        }
        cout << res << '\n';
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 158 ms 15088 KB Output is correct
12 Correct 172 ms 14764 KB Output is correct
13 Correct 139 ms 13976 KB Output is correct
14 Correct 132 ms 14160 KB Output is correct
15 Correct 178 ms 15188 KB Output is correct
16 Correct 158 ms 14280 KB Output is correct
17 Correct 151 ms 14164 KB Output is correct
18 Correct 1104 ms 16192 KB Output is correct
19 Correct 132 ms 13160 KB Output is correct
20 Correct 192 ms 14676 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 158 ms 15088 KB Output is correct
12 Correct 172 ms 14764 KB Output is correct
13 Correct 139 ms 13976 KB Output is correct
14 Correct 132 ms 14160 KB Output is correct
15 Correct 178 ms 15188 KB Output is correct
16 Correct 158 ms 14280 KB Output is correct
17 Correct 151 ms 14164 KB Output is correct
18 Correct 1104 ms 16192 KB Output is correct
19 Correct 132 ms 13160 KB Output is correct
20 Correct 192 ms 14676 KB Output is correct
21 Correct 283 ms 18100 KB Output is correct
22 Execution timed out 2070 ms 480 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 103 ms 20052 KB Output is correct
12 Execution timed out 2073 ms 19036 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 158 ms 15088 KB Output is correct
12 Correct 172 ms 14764 KB Output is correct
13 Correct 139 ms 13976 KB Output is correct
14 Correct 132 ms 14160 KB Output is correct
15 Correct 178 ms 15188 KB Output is correct
16 Correct 158 ms 14280 KB Output is correct
17 Correct 151 ms 14164 KB Output is correct
18 Correct 1104 ms 16192 KB Output is correct
19 Correct 132 ms 13160 KB Output is correct
20 Correct 192 ms 14676 KB Output is correct
21 Correct 283 ms 18100 KB Output is correct
22 Execution timed out 2070 ms 480 KB Time limit exceeded
23 Halted 0 ms 0 KB -