oj.uz

Submission #64582

# Submission time Handle Problem Language Result Execution time Memory
64582 2018-08-05T00:20:37 Z keko37 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 1726 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 4 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 564 KB Output is correct
4 Correct 3 ms 636 KB Output is correct
5 Correct 5 ms 636 KB Output is correct
6 Correct 4 ms 636 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 4 ms 636 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 564 KB Output is correct
4 Correct 3 ms 636 KB Output is correct
5 Correct 5 ms 636 KB Output is correct
6 Correct 4 ms 636 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 4 ms 636 KB Output is correct
11 Correct 293 ms 4668 KB Output is correct
12 Correct 259 ms 4668 KB Output is correct
13 Correct 293 ms 4668 KB Output is correct
14 Correct 284 ms 4668 KB Output is correct
15 Correct 332 ms 4668 KB Output is correct
16 Correct 345 ms 4668 KB Output is correct
17 Correct 264 ms 4668 KB Output is correct
18 Correct 243 ms 5676 KB Output is correct
19 Correct 275 ms 5676 KB Output is correct
20 Correct 275 ms 5676 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 564 KB Output is correct
4 Correct 3 ms 636 KB Output is correct
5 Correct 5 ms 636 KB Output is correct
6 Correct 4 ms 636 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 4 ms 636 KB Output is correct
11 Correct 293 ms 4668 KB Output is correct
12 Correct 259 ms 4668 KB Output is correct
13 Correct 293 ms 4668 KB Output is correct
14 Correct 284 ms 4668 KB Output is correct
15 Correct 332 ms 4668 KB Output is correct
16 Correct 345 ms 4668 KB Output is correct
17 Correct 264 ms 4668 KB Output is correct
18 Correct 243 ms 5676 KB Output is correct
19 Correct 275 ms 5676 KB Output is correct
20 Correct 275 ms 5676 KB Output is correct
21 Correct 357 ms 5676 KB Output is correct
22 Correct 320 ms 5676 KB Output is correct
23 Correct 371 ms 5676 KB Output is correct
24 Correct 384 ms 5676 KB Output is correct
25 Correct 336 ms 5752 KB Output is correct
26 Correct 431 ms 5752 KB Output is correct
27 Correct 386 ms 5752 KB Output is correct
28 Correct 283 ms 6700 KB Output is correct
29 Correct 327 ms 6700 KB Output is correct
30 Correct 429 ms 6700 KB Output is correct
31 Correct 435 ms 6700 KB Output is correct
32 Correct 412 ms 6700 KB Output is correct
33 Correct 326 ms 6700 KB Output is correct
34 Correct 344 ms 6700 KB Output is correct
35 Correct 369 ms 6700 KB Output is correct
36 Correct 202 ms 6700 KB Output is correct
37 Correct 432 ms 6700 KB Output is correct
38 Correct 259 ms 6700 KB Output is correct
39 Correct 368 ms 6700 KB Output is correct
40 Correct 358 ms 6700 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 564 KB Output is correct
4 Correct 3 ms 636 KB Output is correct
5 Correct 5 ms 636 KB Output is correct
6 Correct 4 ms 636 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 4 ms 636 KB Output is correct
11 Correct 144 ms 17324 KB Output is correct
12 Correct 108 ms 17324 KB Output is correct
13 Correct 114 ms 17324 KB Output is correct
14 Correct 125 ms 17324 KB Output is correct
15 Correct 109 ms 17324 KB Output is correct
16 Correct 153 ms 17324 KB Output is correct
17 Correct 136 ms 17324 KB Output is correct
18 Correct 77 ms 17452 KB Output is correct
19 Correct 104 ms 17452 KB Output is correct
20 Correct 101 ms 17452 KB Output is correct
21 Correct 131 ms 17452 KB Output is correct
22 Correct 181 ms 17452 KB Output is correct
23 Correct 121 ms 17452 KB Output is correct
24 Correct 133 ms 17452 KB Output is correct
25 Correct 182 ms 17452 KB Output is correct
26 Correct 72 ms 17452 KB Output is correct
27 Correct 124 ms 17452 KB Output is correct
28 Correct 89 ms 17452 KB Output is correct
29 Correct 115 ms 17452 KB Output is correct
30 Correct 108 ms 17452 KB Output is correct
31 Correct 129 ms 17452 KB Output is correct
32 Correct 206 ms 17452 KB Output is correct
33 Correct 181 ms 17452 KB Output is correct
34 Correct 97 ms 17452 KB Output is correct
35 Correct 117 ms 17452 KB Output is correct
36 Correct 138 ms 17452 KB Output is correct
37 Correct 126 ms 17452 KB Output is correct
38 Correct 132 ms 17452 KB Output is correct
39 Correct 129 ms 17452 KB Output is correct
40 Correct 133 ms 17452 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 2 ms 376 KB Output is correct
3 Correct 4 ms 564 KB Output is correct
4 Correct 3 ms 636 KB Output is correct
5 Correct 5 ms 636 KB Output is correct
6 Correct 4 ms 636 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 3 ms 636 KB Output is correct
9 Correct 3 ms 636 KB Output is correct
10 Correct 4 ms 636 KB Output is correct
11 Correct 293 ms 4668 KB Output is correct
12 Correct 259 ms 4668 KB Output is correct
13 Correct 293 ms 4668 KB Output is correct
14 Correct 284 ms 4668 KB Output is correct
15 Correct 332 ms 4668 KB Output is correct
16 Correct 345 ms 4668 KB Output is correct
17 Correct 264 ms 4668 KB Output is correct
18 Correct 243 ms 5676 KB Output is correct
19 Correct 275 ms 5676 KB Output is correct
20 Correct 275 ms 5676 KB Output is correct
21 Correct 357 ms 5676 KB Output is correct
22 Correct 320 ms 5676 KB Output is correct
23 Correct 371 ms 5676 KB Output is correct
24 Correct 384 ms 5676 KB Output is correct
25 Correct 336 ms 5752 KB Output is correct
26 Correct 431 ms 5752 KB Output is correct
27 Correct 386 ms 5752 KB Output is correct
28 Correct 283 ms 6700 KB Output is correct
29 Correct 327 ms 6700 KB Output is correct
30 Correct 429 ms 6700 KB Output is correct
31 Correct 435 ms 6700 KB Output is correct
32 Correct 412 ms 6700 KB Output is correct
33 Correct 326 ms 6700 KB Output is correct
34 Correct 344 ms 6700 KB Output is correct
35 Correct 369 ms 6700 KB Output is correct
36 Correct 202 ms 6700 KB Output is correct
37 Correct 432 ms 6700 KB Output is correct
38 Correct 259 ms 6700 KB Output is correct
39 Correct 368 ms 6700 KB Output is correct
40 Correct 358 ms 6700 KB Output is correct
41 Correct 144 ms 17324 KB Output is correct
42 Correct 108 ms 17324 KB Output is correct
43 Correct 114 ms 17324 KB Output is correct
44 Correct 125 ms 17324 KB Output is correct
45 Correct 109 ms 17324 KB Output is correct
46 Correct 153 ms 17324 KB Output is correct
47 Correct 136 ms 17324 KB Output is correct
48 Correct 77 ms 17452 KB Output is correct
49 Correct 104 ms 17452 KB Output is correct
50 Correct 101 ms 17452 KB Output is correct
51 Correct 131 ms 17452 KB Output is correct
52 Correct 181 ms 17452 KB Output is correct
53 Correct 121 ms 17452 KB Output is correct
54 Correct 133 ms 17452 KB Output is correct
55 Correct 182 ms 17452 KB Output is correct
56 Correct 72 ms 17452 KB Output is correct
57 Correct 124 ms 17452 KB Output is correct
58 Correct 89 ms 17452 KB Output is correct
59 Correct 115 ms 17452 KB Output is correct
60 Correct 108 ms 17452 KB Output is correct
61 Correct 129 ms 17452 KB Output is correct
62 Correct 206 ms 17452 KB Output is correct
63 Correct 181 ms 17452 KB Output is correct
64 Correct 97 ms 17452 KB Output is correct
65 Correct 117 ms 17452 KB Output is correct
66 Correct 138 ms 17452 KB Output is correct
67 Correct 126 ms 17452 KB Output is correct
68 Correct 132 ms 17452 KB Output is correct
69 Correct 129 ms 17452 KB Output is correct
70 Correct 133 ms 17452 KB Output is correct
71 Correct 726 ms 22028 KB Output is correct
72 Correct 807 ms 22188 KB Output is correct
73 Correct 680 ms 22188 KB Output is correct
74 Correct 1726 ms 24216 KB Output is correct
75 Correct 794 ms 47716 KB Output is correct
76 Runtime error 1326 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.
77 Halted 0 ms 0 KB -