oj.uz

Submission #64584

# Submission time Handle Problem Language Result Execution time Memory
64584 2018-08-05T00:32:35 Z keko37 Snake Escaping (JOI18_snake_escaping) C++11
75 / 100
 1916 ms 66560 KB 
#include<iostream>

using namespace std;

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

int n, q, a, b, c, sol, mask, N, rev, count, i, j, tc;
char l[30], cc;
int val[MAXN], sum0[MAXN], sum1[MAXN], pc[MAXN];

void precompute () {
	for (i=0; i<(1<<n); i++) {
		pc[i] = __builtin_popcount(i);
		sum0[i] = val[i];
		sum1[i] = val[i ^ ((1<<n) - 1)];
	}
	for (i=0; i<n; i++) {
		for (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)];
		}
	}
}
  #define pcc(x) putchar(x);
    
int main () {
	cin >> n >> q;
	do {
		cc = getchar();
	} while (!(cc>='0' && cc<='9'));
	for (i=0; i<(1<<n); i++) {
		if (i>0) {
			cc = getchar();
		}
		val[i] = cc - '0';
	}
	precompute();
	for (tc=0; tc<q; tc++) {
		a = b = c = 0;
		do {
			cc = getchar();
		} while (!(cc=='0' || cc=='1' || cc=='?'));
		for (i=0; i<n; i++) {
			if (i>0) cc = getchar();
			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 {
				rev = mask | a;
				if (pc[rev] & 1) {
					sol -= sum1[rev];
				} else {
					sol += sum1[rev];
				}
			} while (mask = (mask-b) & b);
			if (sol < 0) sol = -sol;
		} else {
			do {
				rev = mask | a;
				if (pc[rev] & 1) {
					sol -= sum0[rev];
				} else {
					sol += sum0[rev];
				}
			} while (mask = (mask-c) & c);
			if (sol < 0) sol = -sol;
		}

        N = sol, rev, count = 0;
        rev = N;
        if (N == 0) { pcc('0'); putchar('\n'); continue ;}
        while ((rev % 10) == 0) { count++; rev /= 10;} //obtain the count of the number of 0s
        rev = 0;
        while (N != 0) { rev = (rev<<3) + (rev<<1) + N % 10; N /= 10;}  //store reverse of N in rev
        while (rev != 0) { pcc(rev % 10 + '0'); rev /= 10;}
        while (count--) pcc('0');
		putchar('\n');
	}
	return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:58:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-a) & a);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:67:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-b) & b);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:77:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-c) & c);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:81:31: warning: right operand of comma operator has no effect [-Wunused-value]
         N = sol, rev, count = 0;
                               ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 3 ms 652 KB Output is correct
6 Correct 3 ms 652 KB Output is correct
7 Correct 3 ms 652 KB Output is correct
8 Correct 3 ms 652 KB Output is correct
9 Correct 4 ms 652 KB Output is correct
10 Correct 3 ms 652 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 3 ms 652 KB Output is correct
6 Correct 3 ms 652 KB Output is correct
7 Correct 3 ms 652 KB Output is correct
8 Correct 3 ms 652 KB Output is correct
9 Correct 4 ms 652 KB Output is correct
10 Correct 3 ms 652 KB Output is correct
11 Correct 264 ms 4676 KB Output is correct
12 Correct 283 ms 4676 KB Output is correct
13 Correct 279 ms 4676 KB Output is correct
14 Correct 279 ms 4676 KB Output is correct
15 Correct 299 ms 4676 KB Output is correct
16 Correct 292 ms 4676 KB Output is correct
17 Correct 286 ms 4676 KB Output is correct
18 Correct 345 ms 5564 KB Output is correct
19 Correct 238 ms 5564 KB Output is correct
20 Correct 275 ms 5564 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 3 ms 652 KB Output is correct
6 Correct 3 ms 652 KB Output is correct
7 Correct 3 ms 652 KB Output is correct
8 Correct 3 ms 652 KB Output is correct
9 Correct 4 ms 652 KB Output is correct
10 Correct 3 ms 652 KB Output is correct
11 Correct 264 ms 4676 KB Output is correct
12 Correct 283 ms 4676 KB Output is correct
13 Correct 279 ms 4676 KB Output is correct
14 Correct 279 ms 4676 KB Output is correct
15 Correct 299 ms 4676 KB Output is correct
16 Correct 292 ms 4676 KB Output is correct
17 Correct 286 ms 4676 KB Output is correct
18 Correct 345 ms 5564 KB Output is correct
19 Correct 238 ms 5564 KB Output is correct
20 Correct 275 ms 5564 KB Output is correct
21 Correct 327 ms 5564 KB Output is correct
22 Correct 463 ms 5564 KB Output is correct
23 Correct 370 ms 5564 KB Output is correct
24 Correct 357 ms 5564 KB Output is correct
25 Correct 381 ms 5668 KB Output is correct
26 Correct 426 ms 5668 KB Output is correct
27 Correct 463 ms 5668 KB Output is correct
28 Correct 327 ms 6716 KB Output is correct
29 Correct 303 ms 6716 KB Output is correct
30 Correct 322 ms 6716 KB Output is correct
31 Correct 402 ms 6716 KB Output is correct
32 Correct 378 ms 6716 KB Output is correct
33 Correct 291 ms 6716 KB Output is correct
34 Correct 311 ms 6716 KB Output is correct
35 Correct 404 ms 6716 KB Output is correct
36 Correct 253 ms 6716 KB Output is correct
37 Correct 383 ms 6716 KB Output is correct
38 Correct 281 ms 6716 KB Output is correct
39 Correct 378 ms 6716 KB Output is correct
40 Correct 316 ms 6716 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 3 ms 652 KB Output is correct
6 Correct 3 ms 652 KB Output is correct
7 Correct 3 ms 652 KB Output is correct
8 Correct 3 ms 652 KB Output is correct
9 Correct 4 ms 652 KB Output is correct
10 Correct 3 ms 652 KB Output is correct
11 Correct 106 ms 17320 KB Output is correct
12 Correct 115 ms 17344 KB Output is correct
13 Correct 118 ms 17344 KB Output is correct
14 Correct 160 ms 17344 KB Output is correct
15 Correct 97 ms 17468 KB Output is correct
16 Correct 164 ms 17468 KB Output is correct
17 Correct 165 ms 17468 KB Output is correct
18 Correct 102 ms 17484 KB Output is correct
19 Correct 98 ms 17484 KB Output is correct
20 Correct 110 ms 17484 KB Output is correct
21 Correct 114 ms 17484 KB Output is correct
22 Correct 231 ms 17484 KB Output is correct
23 Correct 102 ms 17484 KB Output is correct
24 Correct 137 ms 17484 KB Output is correct
25 Correct 153 ms 17484 KB Output is correct
26 Correct 96 ms 17484 KB Output is correct
27 Correct 93 ms 17484 KB Output is correct
28 Correct 90 ms 17484 KB Output is correct
29 Correct 106 ms 17484 KB Output is correct
30 Correct 101 ms 17484 KB Output is correct
31 Correct 111 ms 17484 KB Output is correct
32 Correct 203 ms 17484 KB Output is correct
33 Correct 168 ms 17484 KB Output is correct
34 Correct 99 ms 17484 KB Output is correct
35 Correct 147 ms 17484 KB Output is correct
36 Correct 139 ms 17484 KB Output is correct
37 Correct 131 ms 17484 KB Output is correct
38 Correct 123 ms 17484 KB Output is correct
39 Correct 119 ms 17484 KB Output is correct
40 Correct 171 ms 17484 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 3 ms 652 KB Output is correct
6 Correct 3 ms 652 KB Output is correct
7 Correct 3 ms 652 KB Output is correct
8 Correct 3 ms 652 KB Output is correct
9 Correct 4 ms 652 KB Output is correct
10 Correct 3 ms 652 KB Output is correct
11 Correct 264 ms 4676 KB Output is correct
12 Correct 283 ms 4676 KB Output is correct
13 Correct 279 ms 4676 KB Output is correct
14 Correct 279 ms 4676 KB Output is correct
15 Correct 299 ms 4676 KB Output is correct
16 Correct 292 ms 4676 KB Output is correct
17 Correct 286 ms 4676 KB Output is correct
18 Correct 345 ms 5564 KB Output is correct
19 Correct 238 ms 5564 KB Output is correct
20 Correct 275 ms 5564 KB Output is correct
21 Correct 327 ms 5564 KB Output is correct
22 Correct 463 ms 5564 KB Output is correct
23 Correct 370 ms 5564 KB Output is correct
24 Correct 357 ms 5564 KB Output is correct
25 Correct 381 ms 5668 KB Output is correct
26 Correct 426 ms 5668 KB Output is correct
27 Correct 463 ms 5668 KB Output is correct
28 Correct 327 ms 6716 KB Output is correct
29 Correct 303 ms 6716 KB Output is correct
30 Correct 322 ms 6716 KB Output is correct
31 Correct 402 ms 6716 KB Output is correct
32 Correct 378 ms 6716 KB Output is correct
33 Correct 291 ms 6716 KB Output is correct
34 Correct 311 ms 6716 KB Output is correct
35 Correct 404 ms 6716 KB Output is correct
36 Correct 253 ms 6716 KB Output is correct
37 Correct 383 ms 6716 KB Output is correct
38 Correct 281 ms 6716 KB Output is correct
39 Correct 378 ms 6716 KB Output is correct
40 Correct 316 ms 6716 KB Output is correct
41 Correct 106 ms 17320 KB Output is correct
42 Correct 115 ms 17344 KB Output is correct
43 Correct 118 ms 17344 KB Output is correct
44 Correct 160 ms 17344 KB Output is correct
45 Correct 97 ms 17468 KB Output is correct
46 Correct 164 ms 17468 KB Output is correct
47 Correct 165 ms 17468 KB Output is correct
48 Correct 102 ms 17484 KB Output is correct
49 Correct 98 ms 17484 KB Output is correct
50 Correct 110 ms 17484 KB Output is correct
51 Correct 114 ms 17484 KB Output is correct
52 Correct 231 ms 17484 KB Output is correct
53 Correct 102 ms 17484 KB Output is correct
54 Correct 137 ms 17484 KB Output is correct
55 Correct 153 ms 17484 KB Output is correct
56 Correct 96 ms 17484 KB Output is correct
57 Correct 93 ms 17484 KB Output is correct
58 Correct 90 ms 17484 KB Output is correct
59 Correct 106 ms 17484 KB Output is correct
60 Correct 101 ms 17484 KB Output is correct
61 Correct 111 ms 17484 KB Output is correct
62 Correct 203 ms 17484 KB Output is correct
63 Correct 168 ms 17484 KB Output is correct
64 Correct 99 ms 17484 KB Output is correct
65 Correct 147 ms 17484 KB Output is correct
66 Correct 139 ms 17484 KB Output is correct
67 Correct 131 ms 17484 KB Output is correct
68 Correct 123 ms 17484 KB Output is correct
69 Correct 119 ms 17484 KB Output is correct
70 Correct 171 ms 17484 KB Output is correct
71 Correct 780 ms 22020 KB Output is correct
72 Correct 767 ms 22132 KB Output is correct
73 Correct 950 ms 22132 KB Output is correct
74 Correct 1607 ms 22132 KB Output is correct
75 Correct 888 ms 44820 KB Output is correct
76 Correct 1916 ms 44820 KB Output is correct
77 Correct 1195 ms 64608 KB Output is correct
78 Runtime error 452 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.
79 Halted 0 ms 0 KB -