oj.uz

Submission #64560

# Submission time Handle Problem Language Result Execution time Memory
64560 2018-08-04T23:06:21 Z keko37 Snake Escaping (JOI18_snake_escaping) C++14
58 / 100
 2000 ms 28476 KB 
#include<iostream>

using namespace std;

const int MAXN = 21;

int n, q;
char l[MAXN];
int val[1<<MAXN], sum0[1<<MAXN], sum1[1<<MAXN], pc[1<<MAXN];

void precompute () {
	for (int i=0; i<(1<<n); i++) {
		pc[i] = __builtin_popcount(i);
		sum0[i] = val[i];
		sum1[i] = val[i ^ ((1<<n) - 1)];
	}
	for (int i=0; i<n; i++) {
		for (int j=0; j<(1<<n); j++) {
			if (j & (1<<i)) sum0[j] += sum0[j ^ (1<<i)];
			if (j & (1<<i)) sum1[j] += sum1[j ^ (1<<i)];
		}
	}
}

void ispis (int x) {
	for (int i=n-1; i>=0; i--) {
		cout << (bool) (x & (1<<i));
	}
	cout << endl;
}

int main () {
	std::ios::sync_with_stdio(false);
	cin >> n >> q;
	for (int i=0; i<(1<<n); i++) {
		char c;
		cin >> c;
		val[i] = c - '0';
	}
	precompute();
	for (int tc=0; tc<q; tc++) {
		int a = 0, b = 0, c = 0;
		for (int i=0; i<n; i++) {
			cin >> l[i];
			if (l[i] == '?') {
				a ^= (1<<(n-1-i));
			} else if (l[i] == '0') {
				b ^= (1<<(n-1-i));
			} else {
				c ^= (1<<(n-1-i));
			}
		}
		int sol = 0, mask = 0;
		if (pc[a] <= n/3) {
			do {
				sol += val[mask | c];
			} while (mask = (mask-a) & a);
		} else if (pc[b] <= n/3) {
			do {
				if (pc[mask | a] & 1) {
					sol -= sum1[mask | a];
				} else {
					sol += sum1[mask | a];
				}
			} while (mask = (mask-b) & b);
			if (sol < 0) sol = -sol;
		} else {
			do {
				if (pc[mask | a] & 1) {
					sol -= sum0[mask | a];
				} else {
					sol += sum0[mask | a];
				}
			} while (mask = (mask-c) & c);
			if (sol < 0) sol = -sol;
		}
		cout << sol << "\n";
	}
	return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:57:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-a) & a);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:65:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-b) & b);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:74:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-c) & c);
             ~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 408 KB Output is correct
4 Correct 5 ms 408 KB Output is correct
5 Correct 6 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 6 ms 648 KB Output is correct
10 Correct 4 ms 672 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 408 KB Output is correct
4 Correct 5 ms 408 KB Output is correct
5 Correct 6 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 6 ms 648 KB Output is correct
10 Correct 4 ms 672 KB Output is correct
11 Correct 1981 ms 4844 KB Output is correct
12 Execution timed out 2052 ms 15156 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 408 KB Output is correct
4 Correct 5 ms 408 KB Output is correct
5 Correct 6 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 6 ms 648 KB Output is correct
10 Correct 4 ms 672 KB Output is correct
11 Correct 1981 ms 4844 KB Output is correct
12 Execution timed out 2052 ms 15156 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 408 KB Output is correct
4 Correct 5 ms 408 KB Output is correct
5 Correct 6 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 6 ms 648 KB Output is correct
10 Correct 4 ms 672 KB Output is correct
11 Correct 236 ms 28472 KB Output is correct
12 Correct 182 ms 28472 KB Output is correct
13 Correct 237 ms 28472 KB Output is correct
14 Correct 332 ms 28472 KB Output is correct
15 Correct 206 ms 28472 KB Output is correct
16 Correct 258 ms 28472 KB Output is correct
17 Correct 260 ms 28472 KB Output is correct
18 Correct 190 ms 28476 KB Output is correct
19 Correct 207 ms 28476 KB Output is correct
20 Correct 234 ms 28476 KB Output is correct
21 Correct 269 ms 28476 KB Output is correct
22 Correct 272 ms 28476 KB Output is correct
23 Correct 210 ms 28476 KB Output is correct
24 Correct 194 ms 28476 KB Output is correct
25 Correct 216 ms 28476 KB Output is correct
26 Correct 185 ms 28476 KB Output is correct
27 Correct 238 ms 28476 KB Output is correct
28 Correct 280 ms 28476 KB Output is correct
29 Correct 235 ms 28476 KB Output is correct
30 Correct 223 ms 28476 KB Output is correct
31 Correct 183 ms 28476 KB Output is correct
32 Correct 239 ms 28476 KB Output is correct
33 Correct 242 ms 28476 KB Output is correct
34 Correct 179 ms 28476 KB Output is correct
35 Correct 240 ms 28476 KB Output is correct
36 Correct 239 ms 28476 KB Output is correct
37 Correct 232 ms 28476 KB Output is correct
38 Correct 227 ms 28476 KB Output is correct
39 Correct 285 ms 28476 KB Output is correct
40 Correct 276 ms 28476 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 408 KB Output is correct
4 Correct 5 ms 408 KB Output is correct
5 Correct 6 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 5 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 6 ms 648 KB Output is correct
10 Correct 4 ms 672 KB Output is correct
11 Correct 1981 ms 4844 KB Output is correct
12 Execution timed out 2052 ms 15156 KB Time limit exceeded
13 Halted 0 ms 0 KB -