답안 #64587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
64587 2018-08-05T00:49:58 Z keko37 Snake Escaping (JOI18_snake_escaping) C++11
75 / 100
1485 ms 65816 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] <= pc[b] && pc[a] <= pc[c]) {
			for (mask = a; ; mask = (mask - 1) & a) {
				sol += val[mask | c];
				if (!mask) break;
			}
		} else if (pc[b] <= pc[a] && pc[b] <= pc[c]) {
			for (mask = b; ; mask = (mask-1) & b) {
				rev = mask | a;
				if (pc[rev] & 1) {
					sol -= sum1[rev];
				} else {
					sol += sum1[rev];
				}
				if (!mask) break;
			}
			if (sol < 0) sol = -sol;
		} else {
			for (mask = c; ; mask = (mask - 1) & c) {
				rev = mask | a;
				if (pc[rev] & 1) {
					sol -= sum0[rev];
				} else {
					sol += sum0[rev];
				}
				if (!mask) break;
			}
			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:84:31: warning: right operand of comma operator has no effect [-Wunused-value]
         N = sol, rev, count = 0;
                               ^
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 412 KB Output is correct
4 Correct 3 ms 412 KB Output is correct
5 Correct 3 ms 412 KB Output is correct
6 Correct 3 ms 412 KB Output is correct
7 Correct 4 ms 412 KB Output is correct
8 Correct 3 ms 412 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 3 ms 628 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 412 KB Output is correct
4 Correct 3 ms 412 KB Output is correct
5 Correct 3 ms 412 KB Output is correct
6 Correct 3 ms 412 KB Output is correct
7 Correct 4 ms 412 KB Output is correct
8 Correct 3 ms 412 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 3 ms 628 KB Output is correct
11 Correct 269 ms 4528 KB Output is correct
12 Correct 302 ms 4528 KB Output is correct
13 Correct 334 ms 4528 KB Output is correct
14 Correct 317 ms 4528 KB Output is correct
15 Correct 287 ms 4700 KB Output is correct
16 Correct 274 ms 4700 KB Output is correct
17 Correct 299 ms 4700 KB Output is correct
18 Correct 207 ms 5584 KB Output is correct
19 Correct 238 ms 5584 KB Output is correct
20 Correct 306 ms 5584 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 412 KB Output is correct
4 Correct 3 ms 412 KB Output is correct
5 Correct 3 ms 412 KB Output is correct
6 Correct 3 ms 412 KB Output is correct
7 Correct 4 ms 412 KB Output is correct
8 Correct 3 ms 412 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 3 ms 628 KB Output is correct
11 Correct 269 ms 4528 KB Output is correct
12 Correct 302 ms 4528 KB Output is correct
13 Correct 334 ms 4528 KB Output is correct
14 Correct 317 ms 4528 KB Output is correct
15 Correct 287 ms 4700 KB Output is correct
16 Correct 274 ms 4700 KB Output is correct
17 Correct 299 ms 4700 KB Output is correct
18 Correct 207 ms 5584 KB Output is correct
19 Correct 238 ms 5584 KB Output is correct
20 Correct 306 ms 5584 KB Output is correct
21 Correct 287 ms 5584 KB Output is correct
22 Correct 372 ms 5584 KB Output is correct
23 Correct 451 ms 5584 KB Output is correct
24 Correct 353 ms 5584 KB Output is correct
25 Correct 407 ms 5720 KB Output is correct
26 Correct 442 ms 5720 KB Output is correct
27 Correct 467 ms 5720 KB Output is correct
28 Correct 258 ms 6572 KB Output is correct
29 Correct 290 ms 6572 KB Output is correct
30 Correct 318 ms 6572 KB Output is correct
31 Correct 380 ms 6572 KB Output is correct
32 Correct 458 ms 6572 KB Output is correct
33 Correct 312 ms 6572 KB Output is correct
34 Correct 347 ms 6572 KB Output is correct
35 Correct 353 ms 6572 KB Output is correct
36 Correct 180 ms 6572 KB Output is correct
37 Correct 339 ms 6572 KB Output is correct
38 Correct 301 ms 6572 KB Output is correct
39 Correct 298 ms 6572 KB Output is correct
40 Correct 398 ms 6572 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 412 KB Output is correct
4 Correct 3 ms 412 KB Output is correct
5 Correct 3 ms 412 KB Output is correct
6 Correct 3 ms 412 KB Output is correct
7 Correct 4 ms 412 KB Output is correct
8 Correct 3 ms 412 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 3 ms 628 KB Output is correct
11 Correct 104 ms 17324 KB Output is correct
12 Correct 103 ms 17324 KB Output is correct
13 Correct 128 ms 17324 KB Output is correct
14 Correct 165 ms 17392 KB Output is correct
15 Correct 109 ms 17392 KB Output is correct
16 Correct 150 ms 17392 KB Output is correct
17 Correct 135 ms 17392 KB Output is correct
18 Correct 106 ms 17580 KB Output is correct
19 Correct 105 ms 17580 KB Output is correct
20 Correct 87 ms 17580 KB Output is correct
21 Correct 120 ms 17580 KB Output is correct
22 Correct 139 ms 17580 KB Output is correct
23 Correct 89 ms 17580 KB Output is correct
24 Correct 151 ms 17580 KB Output is correct
25 Correct 113 ms 17580 KB Output is correct
26 Correct 89 ms 17580 KB Output is correct
27 Correct 98 ms 17580 KB Output is correct
28 Correct 111 ms 17580 KB Output is correct
29 Correct 118 ms 17580 KB Output is correct
30 Correct 108 ms 17580 KB Output is correct
31 Correct 94 ms 17580 KB Output is correct
32 Correct 128 ms 17580 KB Output is correct
33 Correct 136 ms 17580 KB Output is correct
34 Correct 75 ms 17580 KB Output is correct
35 Correct 110 ms 17580 KB Output is correct
36 Correct 131 ms 17580 KB Output is correct
37 Correct 125 ms 17580 KB Output is correct
38 Correct 118 ms 17580 KB Output is correct
39 Correct 134 ms 17580 KB Output is correct
40 Correct 108 ms 17580 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 412 KB Output is correct
4 Correct 3 ms 412 KB Output is correct
5 Correct 3 ms 412 KB Output is correct
6 Correct 3 ms 412 KB Output is correct
7 Correct 4 ms 412 KB Output is correct
8 Correct 3 ms 412 KB Output is correct
9 Correct 3 ms 628 KB Output is correct
10 Correct 3 ms 628 KB Output is correct
11 Correct 269 ms 4528 KB Output is correct
12 Correct 302 ms 4528 KB Output is correct
13 Correct 334 ms 4528 KB Output is correct
14 Correct 317 ms 4528 KB Output is correct
15 Correct 287 ms 4700 KB Output is correct
16 Correct 274 ms 4700 KB Output is correct
17 Correct 299 ms 4700 KB Output is correct
18 Correct 207 ms 5584 KB Output is correct
19 Correct 238 ms 5584 KB Output is correct
20 Correct 306 ms 5584 KB Output is correct
21 Correct 287 ms 5584 KB Output is correct
22 Correct 372 ms 5584 KB Output is correct
23 Correct 451 ms 5584 KB Output is correct
24 Correct 353 ms 5584 KB Output is correct
25 Correct 407 ms 5720 KB Output is correct
26 Correct 442 ms 5720 KB Output is correct
27 Correct 467 ms 5720 KB Output is correct
28 Correct 258 ms 6572 KB Output is correct
29 Correct 290 ms 6572 KB Output is correct
30 Correct 318 ms 6572 KB Output is correct
31 Correct 380 ms 6572 KB Output is correct
32 Correct 458 ms 6572 KB Output is correct
33 Correct 312 ms 6572 KB Output is correct
34 Correct 347 ms 6572 KB Output is correct
35 Correct 353 ms 6572 KB Output is correct
36 Correct 180 ms 6572 KB Output is correct
37 Correct 339 ms 6572 KB Output is correct
38 Correct 301 ms 6572 KB Output is correct
39 Correct 298 ms 6572 KB Output is correct
40 Correct 398 ms 6572 KB Output is correct
41 Correct 104 ms 17324 KB Output is correct
42 Correct 103 ms 17324 KB Output is correct
43 Correct 128 ms 17324 KB Output is correct
44 Correct 165 ms 17392 KB Output is correct
45 Correct 109 ms 17392 KB Output is correct
46 Correct 150 ms 17392 KB Output is correct
47 Correct 135 ms 17392 KB Output is correct
48 Correct 106 ms 17580 KB Output is correct
49 Correct 105 ms 17580 KB Output is correct
50 Correct 87 ms 17580 KB Output is correct
51 Correct 120 ms 17580 KB Output is correct
52 Correct 139 ms 17580 KB Output is correct
53 Correct 89 ms 17580 KB Output is correct
54 Correct 151 ms 17580 KB Output is correct
55 Correct 113 ms 17580 KB Output is correct
56 Correct 89 ms 17580 KB Output is correct
57 Correct 98 ms 17580 KB Output is correct
58 Correct 111 ms 17580 KB Output is correct
59 Correct 118 ms 17580 KB Output is correct
60 Correct 108 ms 17580 KB Output is correct
61 Correct 94 ms 17580 KB Output is correct
62 Correct 128 ms 17580 KB Output is correct
63 Correct 136 ms 17580 KB Output is correct
64 Correct 75 ms 17580 KB Output is correct
65 Correct 110 ms 17580 KB Output is correct
66 Correct 131 ms 17580 KB Output is correct
67 Correct 125 ms 17580 KB Output is correct
68 Correct 118 ms 17580 KB Output is correct
69 Correct 134 ms 17580 KB Output is correct
70 Correct 108 ms 17580 KB Output is correct
71 Correct 625 ms 22024 KB Output is correct
72 Correct 661 ms 22204 KB Output is correct
73 Correct 1057 ms 22204 KB Output is correct
74 Correct 1271 ms 22204 KB Output is correct
75 Correct 904 ms 23592 KB Output is correct
76 Correct 1485 ms 23592 KB Output is correct
77 Correct 1187 ms 23592 KB Output is correct
78 Correct 460 ms 25360 KB Output is correct
79 Correct 697 ms 41328 KB Output is correct
80 Correct 678 ms 44492 KB Output is correct
81 Runtime error 1112 ms 65816 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.
82 Halted 0 ms 0 KB -