oj.uz

Submission #101812

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

const int DIM = 20;

char str[1 << DIM], aux[DIM];
int udp[1 << DIM], ddp[1 << DIM], cbit[1 << 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] <= 7) {
			for (int axm = mskq, nr = (1 << cbit[mskq]); nr; (--axm) &= mskq, --nr) {
				ans += str[axm ^ msk1]; } }
		else if (cbit[msk0] <= 7) {
			for (int axm = msk0, nr = (1 << cbit[msk0]); nr; (--axm) &= msk0, --nr) {
				if (cbit[axm] & 1) { 	
					ans -= udp[msk1 ^ axm]; }
				else {
					ans += udp[msk1 ^ axm]; } } }
		else if (cbit[msk1] <= 7) {
			for (int axm = msk1, nr = (1 << cbit[msk1]); nr; (--axm) &= msk1, --nr) {
				if (cbit[axm] & 1) {
					ans -= ddp[mskq ^ msk1 ^ axm]; }
				else {
					ans += ddp[mskq ^ msk1 ^ axm]; } } }
		cout << ans << "\n"; }		   
	return 0; }

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 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 4 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 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 2005 ms 15236 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 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 2005 ms 15236 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 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 220 ms 16068 KB Output is correct
12 Correct 229 ms 15992 KB Output is correct
13 Correct 213 ms 15992 KB Output is correct
14 Correct 239 ms 15992 KB Output is correct
15 Correct 215 ms 16100 KB Output is correct
16 Correct 235 ms 15992 KB Output is correct
17 Correct 237 ms 16032 KB Output is correct
18 Correct 196 ms 16120 KB Output is correct
19 Correct 194 ms 15864 KB Output is correct
20 Correct 201 ms 16044 KB Output is correct
21 Correct 217 ms 15992 KB Output is correct
22 Correct 263 ms 16120 KB Output is correct
23 Correct 206 ms 15992 KB Output is correct
24 Correct 261 ms 15996 KB Output is correct
25 Correct 227 ms 15996 KB Output is correct
26 Correct 223 ms 15868 KB Output is correct
27 Correct 217 ms 15924 KB Output is correct
28 Correct 192 ms 15992 KB Output is correct
29 Correct 221 ms 15992 KB Output is correct
30 Correct 225 ms 15992 KB Output is correct
31 Correct 205 ms 15904 KB Output is correct
32 Correct 277 ms 16040 KB Output is correct
33 Correct 242 ms 15992 KB Output is correct
34 Correct 224 ms 15864 KB Output is correct
35 Correct 227 ms 15964 KB Output is correct
36 Correct 210 ms 15992 KB Output is correct
37 Correct 216 ms 15908 KB Output is correct
38 Correct 196 ms 15884 KB Output is correct
39 Correct 197 ms 15992 KB Output is correct
40 Correct 202 ms 15864 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 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 2005 ms 15236 KB Time limit exceeded
12 Halted 0 ms 0 KB -