답안 #64580 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
64580	2018-08-05T00:13:12 Z	keko37	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	867 ms	66304 KB

snake_escaping

#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);
    inline void writeInt (int nn)
    {
        N = nn, rev, count = 0;
        rev = N;
        if (N == 0) { pcc('0'); 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 (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 {
				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

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	500 KB	Output is correct
3	Correct	4 ms	500 KB	Output is correct
4	Correct	2 ms	500 KB	Output is correct
5	Correct	3 ms	536 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	4 ms	684 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	2 ms	684 KB	Output is correct
10	Correct	2 ms	684 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	500 KB	Output is correct
3	Correct	4 ms	500 KB	Output is correct
4	Correct	2 ms	500 KB	Output is correct
5	Correct	3 ms	536 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	4 ms	684 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	2 ms	684 KB	Output is correct
10	Correct	2 ms	684 KB	Output is correct
11	Correct	254 ms	6488 KB	Output is correct
12	Correct	351 ms	7884 KB	Output is correct
13	Correct	303 ms	7884 KB	Output is correct
14	Correct	238 ms	7884 KB	Output is correct
15	Correct	302 ms	8732 KB	Output is correct
16	Correct	303 ms	8732 KB	Output is correct
17	Correct	305 ms	8732 KB	Output is correct
18	Correct	211 ms	11284 KB	Output is correct
19	Correct	201 ms	11284 KB	Output is correct
20	Correct	266 ms	11284 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	500 KB	Output is correct
3	Correct	4 ms	500 KB	Output is correct
4	Correct	2 ms	500 KB	Output is correct
5	Correct	3 ms	536 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	4 ms	684 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	2 ms	684 KB	Output is correct
10	Correct	2 ms	684 KB	Output is correct
11	Correct	254 ms	6488 KB	Output is correct
12	Correct	351 ms	7884 KB	Output is correct
13	Correct	303 ms	7884 KB	Output is correct
14	Correct	238 ms	7884 KB	Output is correct
15	Correct	302 ms	8732 KB	Output is correct
16	Correct	303 ms	8732 KB	Output is correct
17	Correct	305 ms	8732 KB	Output is correct
18	Correct	211 ms	11284 KB	Output is correct
19	Correct	201 ms	11284 KB	Output is correct
20	Correct	266 ms	11284 KB	Output is correct
21	Correct	275 ms	11284 KB	Output is correct
22	Correct	336 ms	11284 KB	Output is correct
23	Correct	338 ms	11284 KB	Output is correct
24	Correct	373 ms	11284 KB	Output is correct
25	Correct	477 ms	12836 KB	Output is correct
26	Correct	378 ms	12836 KB	Output is correct
27	Correct	471 ms	12836 KB	Output is correct
28	Correct	268 ms	13720 KB	Output is correct
29	Correct	316 ms	13720 KB	Output is correct
30	Correct	344 ms	13724 KB	Output is correct
31	Correct	398 ms	13724 KB	Output is correct
32	Correct	508 ms	13724 KB	Output is correct
33	Correct	376 ms	13724 KB	Output is correct
34	Correct	331 ms	13724 KB	Output is correct
35	Correct	400 ms	13724 KB	Output is correct
36	Correct	197 ms	13724 KB	Output is correct
37	Correct	350 ms	13724 KB	Output is correct
38	Correct	306 ms	13724 KB	Output is correct
39	Correct	361 ms	13724 KB	Output is correct
40	Correct	362 ms	26356 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	500 KB	Output is correct
3	Correct	4 ms	500 KB	Output is correct
4	Correct	2 ms	500 KB	Output is correct
5	Correct	3 ms	536 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	4 ms	684 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	2 ms	684 KB	Output is correct
10	Correct	2 ms	684 KB	Output is correct
11	Correct	107 ms	39896 KB	Output is correct
12	Correct	131 ms	39896 KB	Output is correct
13	Correct	129 ms	39896 KB	Output is correct
14	Correct	197 ms	39920 KB	Output is correct
15	Correct	115 ms	39920 KB	Output is correct
16	Correct	154 ms	39920 KB	Output is correct
17	Correct	137 ms	39920 KB	Output is correct
18	Correct	78 ms	40024 KB	Output is correct
19	Correct	102 ms	40024 KB	Output is correct
20	Correct	105 ms	40024 KB	Output is correct
21	Correct	138 ms	40024 KB	Output is correct
22	Correct	150 ms	40024 KB	Output is correct
23	Correct	100 ms	40024 KB	Output is correct
24	Correct	113 ms	40024 KB	Output is correct
25	Correct	142 ms	40024 KB	Output is correct
26	Correct	109 ms	40024 KB	Output is correct
27	Correct	85 ms	40024 KB	Output is correct
28	Correct	79 ms	40024 KB	Output is correct
29	Correct	87 ms	40024 KB	Output is correct
30	Correct	144 ms	40024 KB	Output is correct
31	Correct	81 ms	40024 KB	Output is correct
32	Correct	173 ms	40024 KB	Output is correct
33	Correct	145 ms	40024 KB	Output is correct
34	Correct	70 ms	40024 KB	Output is correct
35	Correct	102 ms	40024 KB	Output is correct
36	Correct	124 ms	40024 KB	Output is correct
37	Correct	101 ms	40024 KB	Output is correct
38	Correct	123 ms	40024 KB	Output is correct
39	Correct	120 ms	40024 KB	Output is correct
40	Correct	132 ms	40024 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	500 KB	Output is correct
3	Correct	4 ms	500 KB	Output is correct
4	Correct	2 ms	500 KB	Output is correct
5	Correct	3 ms	536 KB	Output is correct
6	Correct	3 ms	548 KB	Output is correct
7	Correct	4 ms	684 KB	Output is correct
8	Correct	3 ms	684 KB	Output is correct
9	Correct	2 ms	684 KB	Output is correct
10	Correct	2 ms	684 KB	Output is correct
11	Correct	254 ms	6488 KB	Output is correct
12	Correct	351 ms	7884 KB	Output is correct
13	Correct	303 ms	7884 KB	Output is correct
14	Correct	238 ms	7884 KB	Output is correct
15	Correct	302 ms	8732 KB	Output is correct
16	Correct	303 ms	8732 KB	Output is correct
17	Correct	305 ms	8732 KB	Output is correct
18	Correct	211 ms	11284 KB	Output is correct
19	Correct	201 ms	11284 KB	Output is correct
20	Correct	266 ms	11284 KB	Output is correct
21	Correct	275 ms	11284 KB	Output is correct
22	Correct	336 ms	11284 KB	Output is correct
23	Correct	338 ms	11284 KB	Output is correct
24	Correct	373 ms	11284 KB	Output is correct
25	Correct	477 ms	12836 KB	Output is correct
26	Correct	378 ms	12836 KB	Output is correct
27	Correct	471 ms	12836 KB	Output is correct
28	Correct	268 ms	13720 KB	Output is correct
29	Correct	316 ms	13720 KB	Output is correct
30	Correct	344 ms	13724 KB	Output is correct
31	Correct	398 ms	13724 KB	Output is correct
32	Correct	508 ms	13724 KB	Output is correct
33	Correct	376 ms	13724 KB	Output is correct
34	Correct	331 ms	13724 KB	Output is correct
35	Correct	400 ms	13724 KB	Output is correct
36	Correct	197 ms	13724 KB	Output is correct
37	Correct	350 ms	13724 KB	Output is correct
38	Correct	306 ms	13724 KB	Output is correct
39	Correct	361 ms	13724 KB	Output is correct
40	Correct	362 ms	26356 KB	Output is correct
41	Correct	107 ms	39896 KB	Output is correct
42	Correct	131 ms	39896 KB	Output is correct
43	Correct	129 ms	39896 KB	Output is correct
44	Correct	197 ms	39920 KB	Output is correct
45	Correct	115 ms	39920 KB	Output is correct
46	Correct	154 ms	39920 KB	Output is correct
47	Correct	137 ms	39920 KB	Output is correct
48	Correct	78 ms	40024 KB	Output is correct
49	Correct	102 ms	40024 KB	Output is correct
50	Correct	105 ms	40024 KB	Output is correct
51	Correct	138 ms	40024 KB	Output is correct
52	Correct	150 ms	40024 KB	Output is correct
53	Correct	100 ms	40024 KB	Output is correct
54	Correct	113 ms	40024 KB	Output is correct
55	Correct	142 ms	40024 KB	Output is correct
56	Correct	109 ms	40024 KB	Output is correct
57	Correct	85 ms	40024 KB	Output is correct
58	Correct	79 ms	40024 KB	Output is correct
59	Correct	87 ms	40024 KB	Output is correct
60	Correct	144 ms	40024 KB	Output is correct
61	Correct	81 ms	40024 KB	Output is correct
62	Correct	173 ms	40024 KB	Output is correct
63	Correct	145 ms	40024 KB	Output is correct
64	Correct	70 ms	40024 KB	Output is correct
65	Correct	102 ms	40024 KB	Output is correct
66	Correct	124 ms	40024 KB	Output is correct
67	Correct	101 ms	40024 KB	Output is correct
68	Correct	123 ms	40024 KB	Output is correct
69	Correct	120 ms	40024 KB	Output is correct
70	Correct	132 ms	40024 KB	Output is correct
71	Correct	706 ms	44784 KB	Output is correct
72	Correct	815 ms	46000 KB	Output is correct
73	Runtime error	867 ms	66304 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.
74	Halted	0 ms	0 KB	-

답안 #64580

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 53.0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
53.0 / 53.0

Subtask #5
0 / 25.0