Submission #64570

# Submission time Handle Problem Language Result Execution time Memory
64570 2018-08-04T23:39:44 Z keko37 Snake Escaping (JOI18_snake_escaping) C++14
12 / 100
434 ms 66560 KB
#include<iostream>

using namespace std;

const int MAXN = (1<<20) + 10;

int n, q, a, b, c, sol, mask;
char l[30], cc;
int val[MAXN], sum0[MAXN], sum1[MAXN], pc[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)];
		}
	}
}

int main () {
	cin >> n >> q;
	for (int i=0; i<(1<<n); i++) {
		do {
			cc = getchar_unlocked();
		} while (!((cc>='0' && cc<='9') || cc=='?'));
		val[i] = cc - '0';
	}
	precompute();
	for (int tc=0; tc<q; tc++) {
		a = b = c = 0;
		for (int i=0; i<n; i++) {
			do {
				cc = getchar_unlocked();
			} while (!((cc>='0' && cc<='9') || cc=='?'));
			l[i] = cc;
			if (l[i] == '?') {
				a ^= (1<<(n-1-i));
			} else if (l[i] == '0') {
				b ^= (1<<(n-1-i));
			} else {
				c ^= (1<<(n-1-i));
			}
		}
		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;
		}
		printf("%d\n", sol);
	}
	return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:53:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-a) & a);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:61:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-b) & b);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:70:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-c) & c);
             ~~~~~^~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 4 ms 464 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 3 ms 584 KB Output is correct
6 Correct 4 ms 616 KB Output is correct
7 Correct 3 ms 704 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 4 ms 716 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 4 ms 464 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 3 ms 584 KB Output is correct
6 Correct 4 ms 616 KB Output is correct
7 Correct 3 ms 704 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 4 ms 716 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 252 ms 7196 KB Output is correct
12 Correct 345 ms 7196 KB Output is correct
13 Correct 280 ms 7196 KB Output is correct
14 Correct 263 ms 7196 KB Output is correct
15 Correct 324 ms 7508 KB Output is correct
16 Correct 407 ms 7508 KB Output is correct
17 Correct 328 ms 7508 KB Output is correct
18 Correct 218 ms 9312 KB Output is correct
19 Correct 250 ms 9312 KB Output is correct
20 Correct 298 ms 9312 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 4 ms 464 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 3 ms 584 KB Output is correct
6 Correct 4 ms 616 KB Output is correct
7 Correct 3 ms 704 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 4 ms 716 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 252 ms 7196 KB Output is correct
12 Correct 345 ms 7196 KB Output is correct
13 Correct 280 ms 7196 KB Output is correct
14 Correct 263 ms 7196 KB Output is correct
15 Correct 324 ms 7508 KB Output is correct
16 Correct 407 ms 7508 KB Output is correct
17 Correct 328 ms 7508 KB Output is correct
18 Correct 218 ms 9312 KB Output is correct
19 Correct 250 ms 9312 KB Output is correct
20 Correct 298 ms 9312 KB Output is correct
21 Correct 294 ms 9312 KB Output is correct
22 Correct 305 ms 9312 KB Output is correct
23 Correct 284 ms 9312 KB Output is correct
24 Correct 276 ms 9312 KB Output is correct
25 Correct 296 ms 23168 KB Output is correct
26 Correct 420 ms 35324 KB Output is correct
27 Correct 434 ms 48904 KB Output is correct
28 Correct 208 ms 51420 KB Output is correct
29 Correct 329 ms 51420 KB Output is correct
30 Correct 350 ms 51420 KB Output is correct
31 Correct 315 ms 51420 KB Output is correct
32 Correct 360 ms 51420 KB Output is correct
33 Correct 367 ms 62764 KB Output is correct
34 Runtime error 361 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
35 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 4 ms 464 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 3 ms 584 KB Output is correct
6 Correct 4 ms 616 KB Output is correct
7 Correct 3 ms 704 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 4 ms 716 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Runtime error 86 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
12 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 428 KB Output is correct
3 Correct 4 ms 464 KB Output is correct
4 Correct 2 ms 540 KB Output is correct
5 Correct 3 ms 584 KB Output is correct
6 Correct 4 ms 616 KB Output is correct
7 Correct 3 ms 704 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 4 ms 716 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 252 ms 7196 KB Output is correct
12 Correct 345 ms 7196 KB Output is correct
13 Correct 280 ms 7196 KB Output is correct
14 Correct 263 ms 7196 KB Output is correct
15 Correct 324 ms 7508 KB Output is correct
16 Correct 407 ms 7508 KB Output is correct
17 Correct 328 ms 7508 KB Output is correct
18 Correct 218 ms 9312 KB Output is correct
19 Correct 250 ms 9312 KB Output is correct
20 Correct 298 ms 9312 KB Output is correct
21 Correct 294 ms 9312 KB Output is correct
22 Correct 305 ms 9312 KB Output is correct
23 Correct 284 ms 9312 KB Output is correct
24 Correct 276 ms 9312 KB Output is correct
25 Correct 296 ms 23168 KB Output is correct
26 Correct 420 ms 35324 KB Output is correct
27 Correct 434 ms 48904 KB Output is correct
28 Correct 208 ms 51420 KB Output is correct
29 Correct 329 ms 51420 KB Output is correct
30 Correct 350 ms 51420 KB Output is correct
31 Correct 315 ms 51420 KB Output is correct
32 Correct 360 ms 51420 KB Output is correct
33 Correct 367 ms 62764 KB Output is correct
34 Runtime error 361 ms 66560 KB Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
35 Halted 0 ms 0 KB -