oj.uz

Submission #64576

# Submission time Handle Problem Language Result Execution time Memory
64576 2018-08-05T00:03:13 Z keko37 Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 761 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;
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 nn)
    {
        N = nn, 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;
	do {
		cc = getchar();
	} while (!(cc>='0' && cc<='9'));
	for (int i=0; i<(1<<n); i++) {
		if (i>0) {
			cc = getchar();
		}
		val[i] = cc - '0';
	}
	precompute();
	for (int tc=0; tc<q; tc++) {
		a = b = c = 0;
		do {
			cc = getchar();
		} while (!(cc=='0' || cc=='1' || cc=='?'));
		for (int 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 {
				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 'void writeInt(int)':
snake_escaping.cpp:27:30: warning: right operand of comma operator has no effect [-Wunused-value]
         N = nn, rev, count = 0;
                              ^
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:69:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-a) & a);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:77:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    } while (mask = (mask-b) & b);
             ~~~~~^~~~~~~~~~~~~~
snake_escaping.cpp:86: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 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 576 KB Output is correct
4 Correct 4 ms 576 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 628 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 3 ms 664 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 4 ms 376 KB Output is correct
3 Correct 5 ms 576 KB Output is correct
4 Correct 4 ms 576 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 628 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 3 ms 664 KB Output is correct
11 Correct 312 ms 10608 KB Output is correct
12 Correct 403 ms 15252 KB Output is correct
13 Correct 304 ms 16656 KB Output is correct
14 Correct 298 ms 16884 KB Output is correct
15 Correct 314 ms 17956 KB Output is correct
16 Correct 388 ms 17956 KB Output is correct
17 Correct 322 ms 18848 KB Output is correct
18 Correct 259 ms 26632 KB Output is correct
19 Correct 238 ms 26632 KB Output is correct
20 Correct 332 ms 26632 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 4 ms 376 KB Output is correct
3 Correct 5 ms 576 KB Output is correct
4 Correct 4 ms 576 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 628 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 3 ms 664 KB Output is correct
11 Correct 312 ms 10608 KB Output is correct
12 Correct 403 ms 15252 KB Output is correct
13 Correct 304 ms 16656 KB Output is correct
14 Correct 298 ms 16884 KB Output is correct
15 Correct 314 ms 17956 KB Output is correct
16 Correct 388 ms 17956 KB Output is correct
17 Correct 322 ms 18848 KB Output is correct
18 Correct 259 ms 26632 KB Output is correct
19 Correct 238 ms 26632 KB Output is correct
20 Correct 332 ms 26632 KB Output is correct
21 Correct 356 ms 26632 KB Output is correct
22 Correct 401 ms 26632 KB Output is correct
23 Correct 388 ms 26632 KB Output is correct
24 Correct 430 ms 26632 KB Output is correct
25 Correct 425 ms 27752 KB Output is correct
26 Correct 446 ms 27752 KB Output is correct
27 Correct 428 ms 27752 KB Output is correct
28 Correct 320 ms 30228 KB Output is correct
29 Correct 326 ms 32216 KB Output is correct
30 Correct 381 ms 34104 KB Output is correct
31 Correct 440 ms 34104 KB Output is correct
32 Correct 459 ms 34104 KB Output is correct
33 Correct 379 ms 34104 KB Output is correct
34 Correct 463 ms 34104 KB Output is correct
35 Correct 458 ms 35808 KB Output is correct
36 Correct 258 ms 35808 KB Output is correct
37 Correct 371 ms 37652 KB Output is correct
38 Correct 327 ms 37652 KB Output is correct
39 Correct 363 ms 37652 KB Output is correct
40 Correct 388 ms 50472 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 4 ms 376 KB Output is correct
3 Correct 5 ms 576 KB Output is correct
4 Correct 4 ms 576 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 628 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 3 ms 664 KB Output is correct
11 Correct 115 ms 63928 KB Output is correct
12 Correct 115 ms 63988 KB Output is correct
13 Correct 124 ms 63988 KB Output is correct
14 Correct 174 ms 63988 KB Output is correct
15 Correct 117 ms 64116 KB Output is correct
16 Correct 165 ms 64116 KB Output is correct
17 Correct 162 ms 64116 KB Output is correct
18 Correct 110 ms 64132 KB Output is correct
19 Correct 110 ms 64132 KB Output is correct
20 Correct 120 ms 64132 KB Output is correct
21 Correct 132 ms 64132 KB Output is correct
22 Correct 184 ms 64132 KB Output is correct
23 Correct 125 ms 64132 KB Output is correct
24 Correct 144 ms 64132 KB Output is correct
25 Correct 156 ms 64132 KB Output is correct
26 Correct 100 ms 64132 KB Output is correct
27 Correct 112 ms 64132 KB Output is correct
28 Correct 117 ms 64132 KB Output is correct
29 Correct 128 ms 64132 KB Output is correct
30 Correct 147 ms 64132 KB Output is correct
31 Correct 122 ms 64132 KB Output is correct
32 Correct 175 ms 64132 KB Output is correct
33 Correct 145 ms 64132 KB Output is correct
34 Correct 113 ms 64132 KB Output is correct
35 Correct 135 ms 64132 KB Output is correct
36 Correct 135 ms 64132 KB Output is correct
37 Correct 142 ms 64132 KB Output is correct
38 Correct 130 ms 64132 KB Output is correct
39 Correct 131 ms 64132 KB Output is correct
40 Correct 142 ms 64132 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 4 ms 376 KB Output is correct
3 Correct 5 ms 576 KB Output is correct
4 Correct 4 ms 576 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 628 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 3 ms 664 KB Output is correct
11 Correct 312 ms 10608 KB Output is correct
12 Correct 403 ms 15252 KB Output is correct
13 Correct 304 ms 16656 KB Output is correct
14 Correct 298 ms 16884 KB Output is correct
15 Correct 314 ms 17956 KB Output is correct
16 Correct 388 ms 17956 KB Output is correct
17 Correct 322 ms 18848 KB Output is correct
18 Correct 259 ms 26632 KB Output is correct
19 Correct 238 ms 26632 KB Output is correct
20 Correct 332 ms 26632 KB Output is correct
21 Correct 356 ms 26632 KB Output is correct
22 Correct 401 ms 26632 KB Output is correct
23 Correct 388 ms 26632 KB Output is correct
24 Correct 430 ms 26632 KB Output is correct
25 Correct 425 ms 27752 KB Output is correct
26 Correct 446 ms 27752 KB Output is correct
27 Correct 428 ms 27752 KB Output is correct
28 Correct 320 ms 30228 KB Output is correct
29 Correct 326 ms 32216 KB Output is correct
30 Correct 381 ms 34104 KB Output is correct
31 Correct 440 ms 34104 KB Output is correct
32 Correct 459 ms 34104 KB Output is correct
33 Correct 379 ms 34104 KB Output is correct
34 Correct 463 ms 34104 KB Output is correct
35 Correct 458 ms 35808 KB Output is correct
36 Correct 258 ms 35808 KB Output is correct
37 Correct 371 ms 37652 KB Output is correct
38 Correct 327 ms 37652 KB Output is correct
39 Correct 363 ms 37652 KB Output is correct
40 Correct 388 ms 50472 KB Output is correct
41 Correct 115 ms 63928 KB Output is correct
42 Correct 115 ms 63988 KB Output is correct
43 Correct 124 ms 63988 KB Output is correct
44 Correct 174 ms 63988 KB Output is correct
45 Correct 117 ms 64116 KB Output is correct
46 Correct 165 ms 64116 KB Output is correct
47 Correct 162 ms 64116 KB Output is correct
48 Correct 110 ms 64132 KB Output is correct
49 Correct 110 ms 64132 KB Output is correct
50 Correct 120 ms 64132 KB Output is correct
51 Correct 132 ms 64132 KB Output is correct
52 Correct 184 ms 64132 KB Output is correct
53 Correct 125 ms 64132 KB Output is correct
54 Correct 144 ms 64132 KB Output is correct
55 Correct 156 ms 64132 KB Output is correct
56 Correct 100 ms 64132 KB Output is correct
57 Correct 112 ms 64132 KB Output is correct
58 Correct 117 ms 64132 KB Output is correct
59 Correct 128 ms 64132 KB Output is correct
60 Correct 147 ms 64132 KB Output is correct
61 Correct 122 ms 64132 KB Output is correct
62 Correct 175 ms 64132 KB Output is correct
63 Correct 145 ms 64132 KB Output is correct
64 Correct 113 ms 64132 KB Output is correct
65 Correct 135 ms 64132 KB Output is correct
66 Correct 135 ms 64132 KB Output is correct
67 Correct 142 ms 64132 KB Output is correct
68 Correct 130 ms 64132 KB Output is correct
69 Correct 131 ms 64132 KB Output is correct
70 Correct 142 ms 64132 KB Output is correct
71 Runtime error 761 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.
72 Halted 0 ms 0 KB -