oj.uz

Submission #64571

# Submission time Handle Problem Language Result Execution time Memory
64571 2018-08-04T23:42:50 Z keko37 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 798 ms 66484 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)];
		}
	}
}
  #define pcc(x) putchar(x);
    inline void writeInt (int n)
    {
        int N = n, rev, count = 0;
        rev = N;
        if (N == 0) { pcc('0'); pcc('\n'); return ;}
        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');
    }
    
int main () {
	cin >> n >> q;
	for (int i=0; i<(1<<n); i++) {
		do {
			cc = getchar();
		} 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();
			} 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;
		}
		writeInt(sol);
		putchar('\n');	
	}
	return 0;
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:65:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-a) & a);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:73:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-b) & b);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:82: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 3 ms 380 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 2 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 688 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 380 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 2 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 688 KB Output is correct
11 Correct 287 ms 7156 KB Output is correct
12 Correct 280 ms 7156 KB Output is correct
13 Correct 277 ms 7156 KB Output is correct
14 Correct 336 ms 7156 KB Output is correct
15 Correct 320 ms 7348 KB Output is correct
16 Correct 401 ms 7348 KB Output is correct
17 Correct 338 ms 7348 KB Output is correct
18 Correct 260 ms 9248 KB Output is correct
19 Correct 229 ms 9248 KB Output is correct
20 Correct 248 ms 9248 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 380 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 2 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 688 KB Output is correct
11 Correct 287 ms 7156 KB Output is correct
12 Correct 280 ms 7156 KB Output is correct
13 Correct 277 ms 7156 KB Output is correct
14 Correct 336 ms 7156 KB Output is correct
15 Correct 320 ms 7348 KB Output is correct
16 Correct 401 ms 7348 KB Output is correct
17 Correct 338 ms 7348 KB Output is correct
18 Correct 260 ms 9248 KB Output is correct
19 Correct 229 ms 9248 KB Output is correct
20 Correct 248 ms 9248 KB Output is correct
21 Correct 306 ms 9248 KB Output is correct
22 Correct 343 ms 9248 KB Output is correct
23 Correct 313 ms 9248 KB Output is correct
24 Correct 405 ms 9248 KB Output is correct
25 Correct 393 ms 22932 KB Output is correct
26 Correct 387 ms 28072 KB Output is correct
27 Correct 411 ms 28072 KB Output is correct
28 Correct 302 ms 30600 KB Output is correct
29 Correct 284 ms 30600 KB Output is correct
30 Correct 372 ms 30600 KB Output is correct
31 Correct 521 ms 30600 KB Output is correct
32 Correct 445 ms 30600 KB Output is correct
33 Correct 368 ms 30600 KB Output is correct
34 Correct 330 ms 30600 KB Output is correct
35 Correct 379 ms 41484 KB Output is correct
36 Correct 221 ms 41484 KB Output is correct
37 Correct 402 ms 42192 KB Output is correct
38 Correct 291 ms 42192 KB Output is correct
39 Correct 414 ms 42192 KB Output is correct
40 Correct 402 ms 42192 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 380 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 2 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 688 KB Output is correct
11 Correct 125 ms 42192 KB Output is correct
12 Correct 135 ms 42192 KB Output is correct
13 Correct 106 ms 42192 KB Output is correct
14 Correct 145 ms 42192 KB Output is correct
15 Correct 100 ms 42192 KB Output is correct
16 Correct 151 ms 42192 KB Output is correct
17 Correct 143 ms 42192 KB Output is correct
18 Correct 103 ms 42192 KB Output is correct
19 Correct 102 ms 42192 KB Output is correct
20 Correct 129 ms 42192 KB Output is correct
21 Correct 134 ms 42192 KB Output is correct
22 Correct 231 ms 42192 KB Output is correct
23 Correct 105 ms 42192 KB Output is correct
24 Correct 137 ms 42192 KB Output is correct
25 Correct 133 ms 42192 KB Output is correct
26 Correct 95 ms 42192 KB Output is correct
27 Correct 91 ms 42192 KB Output is correct
28 Correct 106 ms 42192 KB Output is correct
29 Correct 121 ms 42192 KB Output is correct
30 Correct 133 ms 42192 KB Output is correct
31 Correct 86 ms 42192 KB Output is correct
32 Correct 173 ms 42192 KB Output is correct
33 Correct 149 ms 42192 KB Output is correct
34 Correct 79 ms 42192 KB Output is correct
35 Correct 128 ms 42192 KB Output is correct
36 Correct 104 ms 42192 KB Output is correct
37 Correct 108 ms 42192 KB Output is correct
38 Correct 128 ms 42192 KB Output is correct
39 Correct 121 ms 42192 KB Output is correct
40 Correct 127 ms 42192 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 380 KB Output is correct
2 Correct 3 ms 496 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 3 ms 552 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 3 ms 628 KB Output is correct
8 Correct 2 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 688 KB Output is correct
11 Correct 287 ms 7156 KB Output is correct
12 Correct 280 ms 7156 KB Output is correct
13 Correct 277 ms 7156 KB Output is correct
14 Correct 336 ms 7156 KB Output is correct
15 Correct 320 ms 7348 KB Output is correct
16 Correct 401 ms 7348 KB Output is correct
17 Correct 338 ms 7348 KB Output is correct
18 Correct 260 ms 9248 KB Output is correct
19 Correct 229 ms 9248 KB Output is correct
20 Correct 248 ms 9248 KB Output is correct
21 Correct 306 ms 9248 KB Output is correct
22 Correct 343 ms 9248 KB Output is correct
23 Correct 313 ms 9248 KB Output is correct
24 Correct 405 ms 9248 KB Output is correct
25 Correct 393 ms 22932 KB Output is correct
26 Correct 387 ms 28072 KB Output is correct
27 Correct 411 ms 28072 KB Output is correct
28 Correct 302 ms 30600 KB Output is correct
29 Correct 284 ms 30600 KB Output is correct
30 Correct 372 ms 30600 KB Output is correct
31 Correct 521 ms 30600 KB Output is correct
32 Correct 445 ms 30600 KB Output is correct
33 Correct 368 ms 30600 KB Output is correct
34 Correct 330 ms 30600 KB Output is correct
35 Correct 379 ms 41484 KB Output is correct
36 Correct 221 ms 41484 KB Output is correct
37 Correct 402 ms 42192 KB Output is correct
38 Correct 291 ms 42192 KB Output is correct
39 Correct 414 ms 42192 KB Output is correct
40 Correct 402 ms 42192 KB Output is correct
41 Correct 125 ms 42192 KB Output is correct
42 Correct 135 ms 42192 KB Output is correct
43 Correct 106 ms 42192 KB Output is correct
44 Correct 145 ms 42192 KB Output is correct
45 Correct 100 ms 42192 KB Output is correct
46 Correct 151 ms 42192 KB Output is correct
47 Correct 143 ms 42192 KB Output is correct
48 Correct 103 ms 42192 KB Output is correct
49 Correct 102 ms 42192 KB Output is correct
50 Correct 129 ms 42192 KB Output is correct
51 Correct 134 ms 42192 KB Output is correct
52 Correct 231 ms 42192 KB Output is correct
53 Correct 105 ms 42192 KB Output is correct
54 Correct 137 ms 42192 KB Output is correct
55 Correct 133 ms 42192 KB Output is correct
56 Correct 95 ms 42192 KB Output is correct
57 Correct 91 ms 42192 KB Output is correct
58 Correct 106 ms 42192 KB Output is correct
59 Correct 121 ms 42192 KB Output is correct
60 Correct 133 ms 42192 KB Output is correct
61 Correct 86 ms 42192 KB Output is correct
62 Correct 173 ms 42192 KB Output is correct
63 Correct 149 ms 42192 KB Output is correct
64 Correct 79 ms 42192 KB Output is correct
65 Correct 128 ms 42192 KB Output is correct
66 Correct 104 ms 42192 KB Output is correct
67 Correct 108 ms 42192 KB Output is correct
68 Correct 128 ms 42192 KB Output is correct
69 Correct 121 ms 42192 KB Output is correct
70 Correct 127 ms 42192 KB Output is correct
71 Runtime error 798 ms 66484 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.
72 Halted 0 ms 0 KB -