oj.uz

Submission #315421

# Submission time Handle Problem Language Result Execution time Memory
315421 2020-10-22T21:31:04 Z aZvezda Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 1690 ms 65540 KB 
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

const ll MAX_N = 1e6 + 10;
const ll MAX_RIGHT = 6000000; ll MAX_LEFT = 6;
ll pow3[50];
ll dp[MAX_RIGHT];
ll price[MAX_N];
string queries[MAX_N];
ll ans[MAX_N];
ll n, q;
ll sum[MAX_RIGHT], first2[MAX_RIGHT];
ll rightPart[MAX_N];

void prec() {
	for(ll i = 0; i < q; i ++) {
		ll currMask = 0;
		for(ll j = n - 1; j >= MAX_LEFT; j --) {
			currMask *= 3;
			currMask += (ll)(queries[i][j] - '0');
		}
		rightPart[i] = currMask;
	}

	ll triBits = n - MAX_LEFT;
	for(ll i = 0; i < pow3[triBits]; i ++) {
		bool flag = false;
		for(ll j = triBits - 1; j >= 0; j --) {
			if((i / pow3[j]) % 3 == 2) {
				first2[i] = j;
				flag = true;
				break;
			}
		}
		if(!flag) {
			ll currMask = 0;
			for(ll j = triBits - 1; j >= 0; j --) {
				currMask += ((i / pow3[j]) % 3) * (1 << (j + MAX_LEFT));
			}
			sum[i] = currMask;
			first2[i] = -1;
		}
	}
}

void getAns(ll mask) {
	vector<ll> indices;
	for(ll i = 0; i < q; i ++) {
		for(ll j = 0; j < MAX_LEFT; j ++) {
			if(mask & (1 << j)) {
				if(queries[i][j] == '0') {
					break;
				}
			} else {
				if(queries[i][j] == '1') {
					break;
				}				
			}
			if(j == MAX_LEFT - 1) {
				indices.push_back(i);
			}
		}
	}
	
	ll triBits = n - MAX_LEFT;
	for(ll i = 0; i < pow3[triBits]; i ++) {
		if(first2[i] != -1) {
			ll j = first2[i];		
			dp[i] = dp[i - pow3[j]] + dp[i - 2 * pow3[j]]; 
		} else {
			ll currMask = mask + sum[i];
			dp[i] = price[currMask];			
		}
	}
	
	for(auto it : indices) {
		ans[it] += dp[rightPart[it]];
	}
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	pow3[0] = 1;
	for(ll i = 1; i < 50; i ++) {
		pow3[i] = pow3[i - 1] * 3ll;
	}
	cin >> n >> q;
	chkmin(MAX_LEFT, n);
	string in;
	cin >> in;
	for(ll i = 0; i < (1 << n); i ++) {
		price[i] = in[i] - '0';
	}
	for(ll i = 0; i < q; i ++) {
		cin >> queries[i];
		reverse(queries[i].begin(), queries[i].end());
		for(auto &it : queries[i]) {
			if(it == '?') {
				it = '2';
			}
		}
	}
		
	prec();
	for(ll mask = 0; mask < (1 << MAX_LEFT); mask ++) {
		getAns(mask);
	}
	for(ll i = 0; i < q; i ++) {
		cout << ans[i] << endl;
	}
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 31744 KB Output is correct
2 Correct 22 ms 31744 KB Output is correct
3 Correct 22 ms 31744 KB Output is correct
4 Correct 22 ms 31744 KB Output is correct
5 Correct 22 ms 31744 KB Output is correct
6 Correct 22 ms 31744 KB Output is correct
7 Correct 22 ms 31744 KB Output is correct
8 Correct 22 ms 31744 KB Output is correct
9 Correct 22 ms 31744 KB Output is correct
10 Correct 23 ms 31744 KB Output is correct
11 Correct 1240 ms 59668 KB Output is correct
12 Correct 1276 ms 59000 KB Output is correct
13 Correct 1206 ms 52496 KB Output is correct
14 Correct 1336 ms 51864 KB Output is correct
15 Correct 1410 ms 51868 KB Output is correct
16 Correct 1389 ms 51700 KB Output is correct
17 Correct 1405 ms 50568 KB Output is correct
18 Correct 1681 ms 63928 KB Output is correct
19 Correct 1116 ms 49772 KB Output is correct
20 Correct 1309 ms 60156 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 31744 KB Output is correct
2 Correct 22 ms 31744 KB Output is correct
3 Correct 22 ms 31744 KB Output is correct
4 Correct 22 ms 31744 KB Output is correct
5 Correct 22 ms 31744 KB Output is correct
6 Correct 22 ms 31744 KB Output is correct
7 Correct 22 ms 31744 KB Output is correct
8 Correct 22 ms 31744 KB Output is correct
9 Correct 22 ms 31744 KB Output is correct
10 Correct 23 ms 31744 KB Output is correct
11 Correct 1240 ms 59668 KB Output is correct
12 Correct 1276 ms 59000 KB Output is correct
13 Correct 1206 ms 52496 KB Output is correct
14 Correct 1336 ms 51864 KB Output is correct
15 Correct 1410 ms 51868 KB Output is correct
16 Correct 1389 ms 51700 KB Output is correct
17 Correct 1405 ms 50568 KB Output is correct
18 Correct 1681 ms 63928 KB Output is correct
19 Correct 1116 ms 49772 KB Output is correct
20 Correct 1309 ms 60156 KB Output is correct
21 Correct 1356 ms 63744 KB Output is correct
22 Correct 1308 ms 59700 KB Output is correct
23 Correct 1290 ms 52568 KB Output is correct
24 Correct 1369 ms 51468 KB Output is correct
25 Correct 1433 ms 52652 KB Output is correct
26 Correct 1420 ms 51880 KB Output is correct
27 Correct 1417 ms 51420 KB Output is correct
28 Correct 1690 ms 63824 KB Output is correct
29 Correct 1133 ms 49796 KB Output is correct
30 Correct 1336 ms 59804 KB Output is correct
31 Correct 1431 ms 53844 KB Output is correct
32 Correct 1416 ms 52436 KB Output is correct
33 Correct 1060 ms 51468 KB Output is correct
34 Correct 1391 ms 51096 KB Output is correct
35 Correct 1413 ms 51132 KB Output is correct
36 Correct 467 ms 55460 KB Output is correct
37 Correct 1190 ms 59472 KB Output is correct
38 Correct 1152 ms 49608 KB Output is correct
39 Correct 1301 ms 50888 KB Output is correct
40 Correct 1367 ms 51672 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 31744 KB Output is correct
2 Correct 22 ms 31744 KB Output is correct
3 Correct 22 ms 31744 KB Output is correct
4 Correct 22 ms 31744 KB Output is correct
5 Correct 22 ms 31744 KB Output is correct
6 Correct 22 ms 31744 KB Output is correct
7 Correct 22 ms 31744 KB Output is correct
8 Correct 22 ms 31744 KB Output is correct
9 Correct 22 ms 31744 KB Output is correct
10 Correct 23 ms 31744 KB Output is correct
11 Runtime error 129 ms 65540 KB Execution killed with signal 9 (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 22 ms 31744 KB Output is correct
2 Correct 22 ms 31744 KB Output is correct
3 Correct 22 ms 31744 KB Output is correct
4 Correct 22 ms 31744 KB Output is correct
5 Correct 22 ms 31744 KB Output is correct
6 Correct 22 ms 31744 KB Output is correct
7 Correct 22 ms 31744 KB Output is correct
8 Correct 22 ms 31744 KB Output is correct
9 Correct 22 ms 31744 KB Output is correct
10 Correct 23 ms 31744 KB Output is correct
11 Correct 1240 ms 59668 KB Output is correct
12 Correct 1276 ms 59000 KB Output is correct
13 Correct 1206 ms 52496 KB Output is correct
14 Correct 1336 ms 51864 KB Output is correct
15 Correct 1410 ms 51868 KB Output is correct
16 Correct 1389 ms 51700 KB Output is correct
17 Correct 1405 ms 50568 KB Output is correct
18 Correct 1681 ms 63928 KB Output is correct
19 Correct 1116 ms 49772 KB Output is correct
20 Correct 1309 ms 60156 KB Output is correct
21 Correct 1356 ms 63744 KB Output is correct
22 Correct 1308 ms 59700 KB Output is correct
23 Correct 1290 ms 52568 KB Output is correct
24 Correct 1369 ms 51468 KB Output is correct
25 Correct 1433 ms 52652 KB Output is correct
26 Correct 1420 ms 51880 KB Output is correct
27 Correct 1417 ms 51420 KB Output is correct
28 Correct 1690 ms 63824 KB Output is correct
29 Correct 1133 ms 49796 KB Output is correct
30 Correct 1336 ms 59804 KB Output is correct
31 Correct 1431 ms 53844 KB Output is correct
32 Correct 1416 ms 52436 KB Output is correct
33 Correct 1060 ms 51468 KB Output is correct
34 Correct 1391 ms 51096 KB Output is correct
35 Correct 1413 ms 51132 KB Output is correct
36 Correct 467 ms 55460 KB Output is correct
37 Correct 1190 ms 59472 KB Output is correct
38 Correct 1152 ms 49608 KB Output is correct
39 Correct 1301 ms 50888 KB Output is correct
40 Correct 1367 ms 51672 KB Output is correct
41 Runtime error 129 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
42 Halted 0 ms 0 KB -