oj.uz

Submission #101826

# Submission time Handle Problem Language Result Execution time Memory
101826 2019-03-20T12:10:26 Z KCSC Snake Escaping (JOI18_snake_escaping) C++14
58 / 100
 2000 ms 14104 KB 
#include <bits/stdc++.h>
using namespace std;

const int DIM = (1 << 20) + 5;

char str[DIM], aux[DIM];
int udp[DIM], ddp[DIM], cbit[DIM];

int main(void) {
#ifdef HOME
	freopen("snake.in", "r", stdin);
	freopen("snake.out", "w", stdout);
#endif
	int n, q; cin >> n >> q >> str;
	for (int msk = 0; msk < (1 << n); ++msk) {
		cbit[msk] = cbit[msk >> 1] + (msk & 1);
		udp[msk] = ddp[msk] = str[msk] - '0'; }
	for (int b = 0; b < n; ++b) {
		for (int msk = 0; msk < (1 << n); ++msk) {
			if (msk & (1 << b)) {
				udp[msk ^ (1 << b)] += udp[msk]; }
			else {
				ddp[msk ^ (1 << b)] += ddp[msk]; } } }
	while (q--) {
		int msk0 = 0, msk1 = 0, mskq = 0; 
		cin >> aux; reverse(aux, aux + n);
		for (int i = 0; i < n; ++i) {
			if (aux[i] == '0') { msk0 ^= (1 << i); } 
			if (aux[i] == '1') { msk1 ^= (1 << i); }
			if (aux[i] == '?') { mskq ^= (1 << i); } }
		int ans = 0;
		if (cbit[mskq] <= cbit[msk0] and cbit[mskq] <= cbit[msk1]) {
			for (int axm = mskq, nr = (1 << cbit[mskq]); nr; (--axm) &= mskq, --nr) {
				ans += str[axm ^ msk1] - '0'; } }
		else if (cbit[msk0] <= cbit[msk1]) {
			for (int axm = msk0, nr = (1 << cbit[msk0]); nr; (--axm) &= msk0, --nr) {
				ans += udp[msk1 ^ axm] * ((cbit[axm] & 1) ? -1 : 1); } }
		else {
			for (int axm = msk1, nr = (1 << cbit[msk1]); nr; (--axm) &= msk1, --nr) {
				ans += ddp[mskq ^ msk1 ^ axm] * ((cbit[axm] & 1) ? -1 : 1); } }
		cout << ans << "\n"; }		   
	return 0; }

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 356 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Execution timed out 2048 ms 4412 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 356 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Execution timed out 2048 ms 4412 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 356 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 212 ms 14104 KB Output is correct
12 Correct 280 ms 13996 KB Output is correct
13 Correct 242 ms 13816 KB Output is correct
14 Correct 233 ms 13816 KB Output is correct
15 Correct 192 ms 13944 KB Output is correct
16 Correct 234 ms 13816 KB Output is correct
17 Correct 219 ms 13944 KB Output is correct
18 Correct 210 ms 14072 KB Output is correct
19 Correct 198 ms 13772 KB Output is correct
20 Correct 206 ms 13916 KB Output is correct
21 Correct 292 ms 13984 KB Output is correct
22 Correct 257 ms 13872 KB Output is correct
23 Correct 214 ms 13816 KB Output is correct
24 Correct 247 ms 13964 KB Output is correct
25 Correct 231 ms 13944 KB Output is correct
26 Correct 185 ms 13688 KB Output is correct
27 Correct 201 ms 13836 KB Output is correct
28 Correct 218 ms 13900 KB Output is correct
29 Correct 259 ms 13916 KB Output is correct
30 Correct 211 ms 13992 KB Output is correct
31 Correct 262 ms 13840 KB Output is correct
32 Correct 248 ms 13944 KB Output is correct
33 Correct 242 ms 13904 KB Output is correct
34 Correct 187 ms 13816 KB Output is correct
35 Correct 222 ms 13916 KB Output is correct
36 Correct 248 ms 13816 KB Output is correct
37 Correct 281 ms 13988 KB Output is correct
38 Correct 215 ms 13944 KB Output is correct
39 Correct 255 ms 14024 KB Output is correct
40 Correct 257 ms 13944 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 356 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Execution timed out 2048 ms 4412 KB Time limit exceeded
12 Halted 0 ms 0 KB -