Submission #329339

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
329339	2020-11-20T15:29:42 Z	HoneyBadger	Snake Escaping (JOI18_snake_escaping)	C++17	22 / 100	2000 ms	60360 KB

snake_escaping

#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 = 7;

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


int n, q;
ll pw3[21];
int 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	1 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	1 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	667 ms	4612 KB	Output is correct
12	Correct	785 ms	4344 KB	Output is correct
13	Correct	461 ms	3436 KB	Output is correct
14	Correct	478 ms	3436 KB	Output is correct
15	Correct	1002 ms	4556 KB	Output is correct
16	Correct	580 ms	3692 KB	Output is correct
17	Correct	573 ms	3692 KB	Output is correct
18	Correct	433 ms	5356 KB	Output is correct
19	Correct	333 ms	2412 KB	Output is correct
20	Correct	801 ms	4184 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	1 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	667 ms	4612 KB	Output is correct
12	Correct	785 ms	4344 KB	Output is correct
13	Correct	461 ms	3436 KB	Output is correct
14	Correct	478 ms	3436 KB	Output is correct
15	Correct	1002 ms	4556 KB	Output is correct
16	Correct	580 ms	3692 KB	Output is correct
17	Correct	573 ms	3692 KB	Output is correct
18	Correct	433 ms	5356 KB	Output is correct
19	Correct	333 ms	2412 KB	Output is correct
20	Correct	801 ms	4184 KB	Output is correct
21	Correct	1799 ms	4852 KB	Output is correct
22	Correct	1016 ms	5108 KB	Output is correct
23	Correct	631 ms	3820 KB	Output is correct
24	Correct	593 ms	3436 KB	Output is correct
25	Correct	932 ms	8428 KB	Output is correct
26	Correct	847 ms	4608 KB	Output is correct
27	Correct	885 ms	5868 KB	Output is correct
28	Correct	505 ms	6764 KB	Output is correct
29	Correct	420 ms	2432 KB	Output is correct
30	Correct	1036 ms	4972 KB	Output is correct
31	Correct	1096 ms	4588 KB	Output is correct
32	Correct	778 ms	4588 KB	Output is correct
33	Correct	532 ms	3308 KB	Output is correct
34	Correct	593 ms	3564 KB	Output is correct
35	Correct	884 ms	5996 KB	Output is correct
36	Correct	305 ms	2412 KB	Output is correct
37	Correct	1068 ms	4588 KB	Output is correct
38	Correct	402 ms	2412 KB	Output is correct
39	Correct	661 ms	3824 KB	Output is correct
40	Correct	606 ms	3436 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	1 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	657 ms	20720 KB	Output is correct
12	Correct	1473 ms	47980 KB	Output is correct
13	Correct	99 ms	4844 KB	Output is correct
14	Correct	152 ms	4588 KB	Output is correct
15	Execution timed out	2075 ms	60360 KB	Time limit exceeded
16	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	1 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	667 ms	4612 KB	Output is correct
12	Correct	785 ms	4344 KB	Output is correct
13	Correct	461 ms	3436 KB	Output is correct
14	Correct	478 ms	3436 KB	Output is correct
15	Correct	1002 ms	4556 KB	Output is correct
16	Correct	580 ms	3692 KB	Output is correct
17	Correct	573 ms	3692 KB	Output is correct
18	Correct	433 ms	5356 KB	Output is correct
19	Correct	333 ms	2412 KB	Output is correct
20	Correct	801 ms	4184 KB	Output is correct
21	Correct	1799 ms	4852 KB	Output is correct
22	Correct	1016 ms	5108 KB	Output is correct
23	Correct	631 ms	3820 KB	Output is correct
24	Correct	593 ms	3436 KB	Output is correct
25	Correct	932 ms	8428 KB	Output is correct
26	Correct	847 ms	4608 KB	Output is correct
27	Correct	885 ms	5868 KB	Output is correct
28	Correct	505 ms	6764 KB	Output is correct
29	Correct	420 ms	2432 KB	Output is correct
30	Correct	1036 ms	4972 KB	Output is correct
31	Correct	1096 ms	4588 KB	Output is correct
32	Correct	778 ms	4588 KB	Output is correct
33	Correct	532 ms	3308 KB	Output is correct
34	Correct	593 ms	3564 KB	Output is correct
35	Correct	884 ms	5996 KB	Output is correct
36	Correct	305 ms	2412 KB	Output is correct
37	Correct	1068 ms	4588 KB	Output is correct
38	Correct	402 ms	2412 KB	Output is correct
39	Correct	661 ms	3824 KB	Output is correct
40	Correct	606 ms	3436 KB	Output is correct
41	Correct	657 ms	20720 KB	Output is correct
42	Correct	1473 ms	47980 KB	Output is correct
43	Correct	99 ms	4844 KB	Output is correct
44	Correct	152 ms	4588 KB	Output is correct
45	Execution timed out	2075 ms	60360 KB	Time limit exceeded
46	Halted	0 ms	0 KB	-

Submission #329339

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
0 / 53.0

Subtask #5
0 / 25.0