oj.uz

Submission #334732

# Submission time Handle Problem Language Result Execution time Memory
334732 2020-12-09T22:46:31 Z HoneyBadger Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 380 ms 26348 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>


/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
*/


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif

#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 1 << 20;
const int PW = 20;
const double EPS = 1e-9;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


int n, q;
int a[MX];
int dp[2 * MX];
int pw[PW];

void calc() {
    pw[0] = 1;
    fi(1, PW) pw[i] = pw[i - 1] * 3;
    for (int mask = 0; mask < pw[n]; ++mask) {
        int cur = mask;
        int pos = -1;
        int mask2 = 0;
        fi(0, n) {
            int x = cur % 3;
            cur /= 3;
            mask2 += x << i;
            if (x == 2) pos = i;
        } 
        if (pos == -1)
            dp[mask] = a[mask2];
        else
            dp[mask] = dp[mask - 2 * pw[pos]] + dp[mask - pw[pos]];
    }
}

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

    cin >> n >> q;
    for (int i = 0; i < (1 << n); ++i) {
        char c;
        cin >> c;
        a[i] = c - '0';
    }

    calc();
    
    while (q--) {
        str s;
        cin >> s;
        int mask = 0;
        fx(c, s) {
            mask *= 3;
            if (c == '?')
                mask += 2;
            else if (c == '1')
                ++mask;
        }
        cout << dp[mask] << '\n';
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 231 ms 15468 KB Output is correct
12 Correct 240 ms 15084 KB Output is correct
13 Correct 217 ms 14316 KB Output is correct
14 Correct 234 ms 14444 KB Output is correct
15 Correct 252 ms 15496 KB Output is correct
16 Correct 228 ms 14572 KB Output is correct
17 Correct 227 ms 14444 KB Output is correct
18 Correct 182 ms 16492 KB Output is correct
19 Correct 184 ms 13292 KB Output is correct
20 Correct 242 ms 15092 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 231 ms 15468 KB Output is correct
12 Correct 240 ms 15084 KB Output is correct
13 Correct 217 ms 14316 KB Output is correct
14 Correct 234 ms 14444 KB Output is correct
15 Correct 252 ms 15496 KB Output is correct
16 Correct 228 ms 14572 KB Output is correct
17 Correct 227 ms 14444 KB Output is correct
18 Correct 182 ms 16492 KB Output is correct
19 Correct 184 ms 13292 KB Output is correct
20 Correct 242 ms 15092 KB Output is correct
21 Correct 294 ms 24492 KB Output is correct
22 Correct 313 ms 24800 KB Output is correct
23 Correct 343 ms 23460 KB Output is correct
24 Correct 336 ms 23532 KB Output is correct
25 Correct 313 ms 25324 KB Output is correct
26 Correct 365 ms 23788 KB Output is correct
27 Correct 380 ms 23788 KB Output is correct
28 Correct 241 ms 26348 KB Output is correct
29 Correct 239 ms 22508 KB Output is correct
30 Correct 314 ms 24556 KB Output is correct
31 Correct 355 ms 24556 KB Output is correct
32 Correct 344 ms 24428 KB Output is correct
33 Correct 291 ms 23276 KB Output is correct
34 Correct 348 ms 23404 KB Output is correct
35 Correct 377 ms 23788 KB Output is correct
36 Correct 233 ms 22380 KB Output is correct
37 Correct 292 ms 24300 KB Output is correct
38 Correct 257 ms 22380 KB Output is correct
39 Correct 343 ms 23532 KB Output is correct
40 Correct 340 ms 23488 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Runtime error 26 ms 10092 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 620 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 2 ms 620 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 231 ms 15468 KB Output is correct
12 Correct 240 ms 15084 KB Output is correct
13 Correct 217 ms 14316 KB Output is correct
14 Correct 234 ms 14444 KB Output is correct
15 Correct 252 ms 15496 KB Output is correct
16 Correct 228 ms 14572 KB Output is correct
17 Correct 227 ms 14444 KB Output is correct
18 Correct 182 ms 16492 KB Output is correct
19 Correct 184 ms 13292 KB Output is correct
20 Correct 242 ms 15092 KB Output is correct
21 Correct 294 ms 24492 KB Output is correct
22 Correct 313 ms 24800 KB Output is correct
23 Correct 343 ms 23460 KB Output is correct
24 Correct 336 ms 23532 KB Output is correct
25 Correct 313 ms 25324 KB Output is correct
26 Correct 365 ms 23788 KB Output is correct
27 Correct 380 ms 23788 KB Output is correct
28 Correct 241 ms 26348 KB Output is correct
29 Correct 239 ms 22508 KB Output is correct
30 Correct 314 ms 24556 KB Output is correct
31 Correct 355 ms 24556 KB Output is correct
32 Correct 344 ms 24428 KB Output is correct
33 Correct 291 ms 23276 KB Output is correct
34 Correct 348 ms 23404 KB Output is correct
35 Correct 377 ms 23788 KB Output is correct
36 Correct 233 ms 22380 KB Output is correct
37 Correct 292 ms 24300 KB Output is correct
38 Correct 257 ms 22380 KB Output is correct
39 Correct 343 ms 23532 KB Output is correct
40 Correct 340 ms 23488 KB Output is correct
41 Runtime error 26 ms 10092 KB Execution killed with signal 11 (could be triggered by violating memory limits)
42 Halted 0 ms 0 KB -