oj.uz

Submission #329342

# Submission time Handle Problem Language Result Execution time Memory
329342 2020-11-20T15:31:28 Z HoneyBadger Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 1105 ms 65540 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>
#include <unordered_map>


#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 double EPS = 1e-9;
const int BUBEN = 6;

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


int n, q;
ll pw3[21];
char a[1 << 20];

map<ll, int> ht;
void init() {
    pw3[0] = 1;
    fi(1, 21) pw3[i] = pw3[i - 1] * 3;
}

//pos3.size() <= BUBEN slow

int gen(int mask, vi &pos3) {
	if (pos3.empty())
		return a[mask];
	int i = pos3.back();
	pos3.ppb;
	int res = gen(mask + (1 << i), pos3) + gen(mask, pos3); 
	pos3.pb(i);
	return res;
}

int get(ll mask3, int mask2, vi &pos3) {
	if (pos3.size() <= BUBEN) {
		return gen(mask2, pos3);
	}
	auto it = ht.find(mask3);
	if (it == ht.end()) {
		int i = pos3.back();
		pos3.ppb;
		int res = get(mask3 - pw3[i], mask2 ^ (1 << i), pos3) + get(mask3 - 2 * pw3[i], mask2, pos3);
		pos3.pb(i);
		ht[mask3] = res;
		return res;
	} else {
		return it->second;
	}
}

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

    init();

    cin >> n >> q;
    for (int i = 0; i < (1 << n); ++i) {
    	char c;
    	cin >> c;
    	a[i] = c - '0';
    }
    while (q--) {
    	vi pos3;
    	ll mask3 = 0;
    	int mask2 = 0;
    	fi(0, n) {
    		char c;
    		cin >> c;
    		if (c == '1') {
    			mask2 += 1 << (n - i - 1);
    			mask3 += 1 * pw3[n - i - 1];
    		} else if (c == '?') {
    			mask3 += 2 * pw3[n - i - 1];
    			pos3.pb(n - i - 1);
    		}	
    	}
    	cout << get(mask3, mask2, pos3) << '\n';
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 660 ms 4508 KB Output is correct
12 Correct 644 ms 4092 KB Output is correct
13 Correct 446 ms 3308 KB Output is correct
14 Correct 470 ms 3308 KB Output is correct
15 Correct 982 ms 4460 KB Output is correct
16 Correct 553 ms 3564 KB Output is correct
17 Correct 550 ms 3900 KB Output is correct
18 Correct 427 ms 5484 KB Output is correct
19 Correct 330 ms 2412 KB Output is correct
20 Correct 645 ms 4204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 660 ms 4508 KB Output is correct
12 Correct 644 ms 4092 KB Output is correct
13 Correct 446 ms 3308 KB Output is correct
14 Correct 470 ms 3308 KB Output is correct
15 Correct 982 ms 4460 KB Output is correct
16 Correct 553 ms 3564 KB Output is correct
17 Correct 550 ms 3900 KB Output is correct
18 Correct 427 ms 5484 KB Output is correct
19 Correct 330 ms 2412 KB Output is correct
20 Correct 645 ms 4204 KB Output is correct
21 Correct 642 ms 4844 KB Output is correct
22 Correct 808 ms 5232 KB Output is correct
23 Correct 620 ms 3692 KB Output is correct
24 Correct 583 ms 3564 KB Output is correct
25 Correct 1086 ms 11104 KB Output is correct
26 Correct 816 ms 6168 KB Output is correct
27 Correct 891 ms 10476 KB Output is correct
28 Correct 502 ms 6380 KB Output is correct
29 Correct 395 ms 2412 KB Output is correct
30 Correct 798 ms 5228 KB Output is correct
31 Correct 1105 ms 4808 KB Output is correct
32 Correct 769 ms 4332 KB Output is correct
33 Correct 533 ms 3308 KB Output is correct
34 Correct 616 ms 3436 KB Output is correct
35 Correct 875 ms 10220 KB Output is correct
36 Correct 313 ms 2412 KB Output is correct
37 Correct 1072 ms 4460 KB Output is correct
38 Correct 399 ms 2540 KB Output is correct
39 Correct 652 ms 3820 KB Output is correct
40 Correct 605 ms 3372 KB Output is correct

Subtask #4
0 / 53.0

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

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 660 ms 4508 KB Output is correct
12 Correct 644 ms 4092 KB Output is correct
13 Correct 446 ms 3308 KB Output is correct
14 Correct 470 ms 3308 KB Output is correct
15 Correct 982 ms 4460 KB Output is correct
16 Correct 553 ms 3564 KB Output is correct
17 Correct 550 ms 3900 KB Output is correct
18 Correct 427 ms 5484 KB Output is correct
19 Correct 330 ms 2412 KB Output is correct
20 Correct 645 ms 4204 KB Output is correct
21 Correct 642 ms 4844 KB Output is correct
22 Correct 808 ms 5232 KB Output is correct
23 Correct 620 ms 3692 KB Output is correct
24 Correct 583 ms 3564 KB Output is correct
25 Correct 1086 ms 11104 KB Output is correct
26 Correct 816 ms 6168 KB Output is correct
27 Correct 891 ms 10476 KB Output is correct
28 Correct 502 ms 6380 KB Output is correct
29 Correct 395 ms 2412 KB Output is correct
30 Correct 798 ms 5228 KB Output is correct
31 Correct 1105 ms 4808 KB Output is correct
32 Correct 769 ms 4332 KB Output is correct
33 Correct 533 ms 3308 KB Output is correct
34 Correct 616 ms 3436 KB Output is correct
35 Correct 875 ms 10220 KB Output is correct
36 Correct 313 ms 2412 KB Output is correct
37 Correct 1072 ms 4460 KB Output is correct
38 Correct 399 ms 2540 KB Output is correct
39 Correct 652 ms 3820 KB Output is correct
40 Correct 605 ms 3372 KB Output is correct
41 Correct 549 ms 29804 KB Output is correct
42 Runtime error 1038 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -