oj.uz

Submission #315422

# Submission time Handle Problem Language Result Execution time Memory
315422 2020-10-22T21:33:05 Z aZvezda Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 1628 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 = 4800000; ll MAX_LEFT = 6;
int pow3[50];
int dp[MAX_RIGHT];
int price[MAX_N];
string queries[MAX_N];
ll ans[MAX_N];
int n, q;
int sum[MAX_RIGHT], first2[MAX_RIGHT];
int 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 23 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 22 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 23 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 22 ms 31744 KB Output is correct
11 Correct 1177 ms 55872 KB Output is correct
12 Correct 1232 ms 55216 KB Output is correct
13 Correct 1178 ms 48476 KB Output is correct
14 Correct 1294 ms 47552 KB Output is correct
15 Correct 1424 ms 47756 KB Output is correct
16 Correct 1340 ms 47432 KB Output is correct
17 Correct 1347 ms 46800 KB Output is correct
18 Correct 1604 ms 59896 KB Output is correct
19 Correct 1063 ms 45724 KB Output is correct
20 Correct 1239 ms 56140 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 23 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 22 ms 31744 KB Output is correct
11 Correct 1177 ms 55872 KB Output is correct
12 Correct 1232 ms 55216 KB Output is correct
13 Correct 1178 ms 48476 KB Output is correct
14 Correct 1294 ms 47552 KB Output is correct
15 Correct 1424 ms 47756 KB Output is correct
16 Correct 1340 ms 47432 KB Output is correct
17 Correct 1347 ms 46800 KB Output is correct
18 Correct 1604 ms 59896 KB Output is correct
19 Correct 1063 ms 45724 KB Output is correct
20 Correct 1239 ms 56140 KB Output is correct
21 Correct 1290 ms 59792 KB Output is correct
22 Correct 1255 ms 55764 KB Output is correct
23 Correct 1249 ms 48756 KB Output is correct
24 Correct 1317 ms 47836 KB Output is correct
25 Correct 1387 ms 48680 KB Output is correct
26 Correct 1369 ms 48044 KB Output is correct
27 Correct 1376 ms 47308 KB Output is correct
28 Correct 1628 ms 59884 KB Output is correct
29 Correct 1072 ms 46116 KB Output is correct
30 Correct 1258 ms 56200 KB Output is correct
31 Correct 1403 ms 49680 KB Output is correct
32 Correct 1366 ms 48676 KB Output is correct
33 Correct 1004 ms 47644 KB Output is correct
34 Correct 1347 ms 46732 KB Output is correct
35 Correct 1377 ms 47300 KB Output is correct
36 Correct 451 ms 51428 KB Output is correct
37 Correct 1162 ms 55348 KB Output is correct
38 Correct 1089 ms 45684 KB Output is correct
39 Correct 1255 ms 46900 KB Output is correct
40 Correct 1319 ms 47736 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 23 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 22 ms 31744 KB Output is correct
11 Runtime error 148 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 23 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 22 ms 31744 KB Output is correct
11 Correct 1177 ms 55872 KB Output is correct
12 Correct 1232 ms 55216 KB Output is correct
13 Correct 1178 ms 48476 KB Output is correct
14 Correct 1294 ms 47552 KB Output is correct
15 Correct 1424 ms 47756 KB Output is correct
16 Correct 1340 ms 47432 KB Output is correct
17 Correct 1347 ms 46800 KB Output is correct
18 Correct 1604 ms 59896 KB Output is correct
19 Correct 1063 ms 45724 KB Output is correct
20 Correct 1239 ms 56140 KB Output is correct
21 Correct 1290 ms 59792 KB Output is correct
22 Correct 1255 ms 55764 KB Output is correct
23 Correct 1249 ms 48756 KB Output is correct
24 Correct 1317 ms 47836 KB Output is correct
25 Correct 1387 ms 48680 KB Output is correct
26 Correct 1369 ms 48044 KB Output is correct
27 Correct 1376 ms 47308 KB Output is correct
28 Correct 1628 ms 59884 KB Output is correct
29 Correct 1072 ms 46116 KB Output is correct
30 Correct 1258 ms 56200 KB Output is correct
31 Correct 1403 ms 49680 KB Output is correct
32 Correct 1366 ms 48676 KB Output is correct
33 Correct 1004 ms 47644 KB Output is correct
34 Correct 1347 ms 46732 KB Output is correct
35 Correct 1377 ms 47300 KB Output is correct
36 Correct 451 ms 51428 KB Output is correct
37 Correct 1162 ms 55348 KB Output is correct
38 Correct 1089 ms 45684 KB Output is correct
39 Correct 1255 ms 46900 KB Output is correct
40 Correct 1319 ms 47736 KB Output is correct
41 Runtime error 148 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
42 Halted 0 ms 0 KB -