답안 #42161 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
42161	2018-02-23T05:24:58 Z	fest	Snake Escaping (JOI18_snake_escaping)	C++11	75 / 100	2000 ms	65536 KB

snake_escaping

// fest
#include <bits/stdc++.h>	

#define pb push_back
#define F first
#define S second
#define y1 dasdasfasfas
#define x1 wqdadfasfasfas
#define All(c) c.begin(), c.end()
#define SZ(A) (int((A).size()))
#define umap unordered_map
#define FILENAME ""
#define __ fflush(stdout)

typedef long long ll;
typedef long double ld;    

using namespace std;

void FREOPEN() {
	#ifdef COMP
		freopen(".in", "r", stdin);
		freopen("1.out", "w", stdout);
	#else
		freopen(FILENAME".in", "r", stdin);
		freopen(FILENAME".out", "w", stdout);
	#endif
}                           

inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; }             

const int N = 20, inf = 1e9 * 2, MOD = (int)1e9 + 7;

char CH[N];

const ll INF = 1e18;

const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1};
const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1};

int built[1 << N], ones[N], dp[2][2][1 << N], cost[2][1 << N], qs[N];

int n;

inline int rev(int x) {
	int ret = 0;
	for (int i = 0; i < n; i++) {
		if (x & (1 << i)) continue;
		ret |= (1 << i);
	} 
	return ret;
}

void build(int ty) {
	for (int mask = 0; mask < (1 << n); mask++) {
		dp[ty][0][mask] += cost[ty][mask];
		if (mask & 1) dp[ty][0][mask] += cost[ty][mask ^ 1];
	}		
	for (int bit = 1; bit < n; bit++) {
		int j = (bit & 1);
		for (int mask = 0; mask < (1 << n); mask++) {
			dp[ty][j][mask] = dp[ty][j ^ 1][mask];
			if (mask & (1 << bit)) dp[ty][j][mask] += dp[ty][j ^ 1][mask ^ (1 << bit)];
		}
	}
}

inline int calc(int ty, int cnt) {
	int ret = 0;
	int alw = 0;
	int r = 0;
	for (int i = 0; i < n; i++) {
		if (qs[i] == 2) alw |= (1 << i);
		if (qs[i] == 1) ones[r++] = i;
	}
	for (int mask = 0; mask < (1 << cnt); mask++) {
		int now = alw;
		for (int i = 0; i < r; i++) {
			if (mask & (1 << i)) now |= (1 << ones[i]);
		}
		if (built[mask] % 2) ret -= dp[ty][(n - 1) & 1][now];
		else ret += dp[ty][(n - 1) & 1][now];
	}	
	return abs(ret);
} 

int main() {
  
	int q;
	cin >> n >> q;
	scanf("\n");
	for (int i = 0; i < (1 << n); i++) {
		char x = getchar();
		cost[0][i] = (int)(x - '0');
		cost[1][rev(i)] = (int)(x - '0');
	} 
	for (int mask = 0; mask < (1 << n); mask++) built[mask] = __builtin_popcount(mask);
	build(0);
	build(1);
	while (q--) {
		getchar();
		int zer = 0, one = 0, que = 0;
		for (int i = n - 1; i >= 0; i--) {
			char x = getchar();
			if (x == '?') qs[i] = 2, que++;
			if (x == '1') qs[i] = 1, one++;
			if (x == '0') qs[i] = 0, zer++;
		}
		if (!one) {
			int ret = 0;
			for (int i = 0; i < n; i++) {
				if (qs[i] == 2) ret |= (1 << i);
			}
			printf("%d\n", dp[0][(n - 1) & 1][ret]);
			continue;
		}
		if (!zer) {
			int ret = 0;
			for (int i = 0; i < n; i++) {
				if (qs[i] == 2) ret |= (1 << i);
			}
			printf("%d\n", dp[1][(n - 1) & 1][ret]);
			continue;
		}
		if (que < 7) {
			int ans = 0;
			int r = 0;
			int alw = 0;
			for (int i = 0; i < n; i++) {
				if (qs[i] == 2) ones[r++] = i; 
				if (qs[i] == 1) alw |= (1 << i);
			}
			for (int mask = 0; mask < (1 << que); mask++) {
				int ret = alw;
				for (int i = 0; i < r; i++) {
					if (mask & (1 << i)) ret |= (1 << ones[i]);
				}
				ans += cost[0][ret];
			}
			printf("%d\n", ans);
			continue;
		}
		if (one < 7) {
			printf("%d\n", calc(0, one));
			continue;
		}
		for (int i = 0; i < n; i++) if (qs[i] < 2) qs[i] ^= 1;
		printf("%d\n", calc(1, zer));
	}
	return 0;	
}

Compilation message

snake_escaping.cpp: In function 'void FREOPEN()':
snake_escaping.cpp:25:37: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(FILENAME".in", "r", stdin);
                                     ^
snake_escaping.cpp:26:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(FILENAME".out", "w", stdout);
                                       ^
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:91:13: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("\n");
             ^

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	560 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	2 ms	560 KB	Output is correct
5	Correct	3 ms	560 KB	Output is correct
6	Correct	3 ms	560 KB	Output is correct
7	Correct	3 ms	664 KB	Output is correct
8	Correct	3 ms	664 KB	Output is correct
9	Correct	3 ms	664 KB	Output is correct
10	Correct	3 ms	664 KB	Output is correct
11	Correct	357 ms	7576 KB	Output is correct
12	Correct	383 ms	18164 KB	Output is correct
13	Correct	391 ms	27912 KB	Output is correct
14	Correct	395 ms	37416 KB	Output is correct
15	Correct	876 ms	38268 KB	Output is correct
16	Correct	505 ms	38268 KB	Output is correct
17	Correct	482 ms	38268 KB	Output is correct
18	Correct	219 ms	39144 KB	Output is correct
19	Correct	296 ms	39144 KB	Output is correct
20	Correct	319 ms	39144 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	560 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	2 ms	560 KB	Output is correct
5	Correct	3 ms	560 KB	Output is correct
6	Correct	3 ms	560 KB	Output is correct
7	Correct	3 ms	664 KB	Output is correct
8	Correct	3 ms	664 KB	Output is correct
9	Correct	3 ms	664 KB	Output is correct
10	Correct	3 ms	664 KB	Output is correct
11	Correct	357 ms	7576 KB	Output is correct
12	Correct	383 ms	18164 KB	Output is correct
13	Correct	391 ms	27912 KB	Output is correct
14	Correct	395 ms	37416 KB	Output is correct
15	Correct	876 ms	38268 KB	Output is correct
16	Correct	505 ms	38268 KB	Output is correct
17	Correct	482 ms	38268 KB	Output is correct
18	Correct	219 ms	39144 KB	Output is correct
19	Correct	296 ms	39144 KB	Output is correct
20	Correct	319 ms	39144 KB	Output is correct
21	Correct	386 ms	39348 KB	Output is correct
22	Correct	403 ms	52996 KB	Output is correct
23	Correct	580 ms	65536 KB	Output is correct
24	Correct	545 ms	65536 KB	Output is correct
25	Correct	474 ms	65536 KB	Output is correct
26	Correct	679 ms	65536 KB	Output is correct
27	Correct	662 ms	65536 KB	Output is correct
28	Correct	297 ms	65536 KB	Output is correct
29	Correct	396 ms	65536 KB	Output is correct
30	Correct	414 ms	65536 KB	Output is correct
31	Correct	1078 ms	65536 KB	Output is correct
32	Correct	694 ms	65536 KB	Output is correct
33	Correct	425 ms	65536 KB	Output is correct
34	Correct	548 ms	65536 KB	Output is correct
35	Correct	647 ms	65536 KB	Output is correct
36	Correct	271 ms	65536 KB	Output is correct
37	Correct	384 ms	65536 KB	Output is correct
38	Correct	397 ms	65536 KB	Output is correct
39	Correct	548 ms	65536 KB	Output is correct
40	Correct	521 ms	65536 KB	Output is correct

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	560 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	2 ms	560 KB	Output is correct
5	Correct	3 ms	560 KB	Output is correct
6	Correct	3 ms	560 KB	Output is correct
7	Correct	3 ms	664 KB	Output is correct
8	Correct	3 ms	664 KB	Output is correct
9	Correct	3 ms	664 KB	Output is correct
10	Correct	3 ms	664 KB	Output is correct
11	Correct	218 ms	65536 KB	Output is correct
12	Correct	210 ms	65536 KB	Output is correct
13	Correct	239 ms	65536 KB	Output is correct
14	Correct	260 ms	65536 KB	Output is correct
15	Correct	220 ms	65536 KB	Output is correct
16	Correct	277 ms	65536 KB	Output is correct
17	Correct	266 ms	65536 KB	Output is correct
18	Correct	194 ms	65536 KB	Output is correct
19	Correct	216 ms	65536 KB	Output is correct
20	Correct	235 ms	65536 KB	Output is correct
21	Correct	229 ms	65536 KB	Output is correct
22	Correct	296 ms	65536 KB	Output is correct
23	Correct	218 ms	65536 KB	Output is correct
24	Correct	263 ms	65536 KB	Output is correct
25	Correct	274 ms	65536 KB	Output is correct
26	Correct	201 ms	65536 KB	Output is correct
27	Correct	212 ms	65536 KB	Output is correct
28	Correct	236 ms	65536 KB	Output is correct
29	Correct	233 ms	65536 KB	Output is correct
30	Correct	264 ms	65536 KB	Output is correct
31	Correct	218 ms	65536 KB	Output is correct
32	Correct	270 ms	65536 KB	Output is correct
33	Correct	276 ms	65536 KB	Output is correct
34	Correct	195 ms	65536 KB	Output is correct
35	Correct	252 ms	65536 KB	Output is correct
36	Correct	249 ms	65536 KB	Output is correct
37	Correct	268 ms	65536 KB	Output is correct
38	Correct	251 ms	65536 KB	Output is correct
39	Correct	252 ms	65536 KB	Output is correct
40	Correct	251 ms	65536 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	560 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	2 ms	560 KB	Output is correct
5	Correct	3 ms	560 KB	Output is correct
6	Correct	3 ms	560 KB	Output is correct
7	Correct	3 ms	664 KB	Output is correct
8	Correct	3 ms	664 KB	Output is correct
9	Correct	3 ms	664 KB	Output is correct
10	Correct	3 ms	664 KB	Output is correct
11	Correct	357 ms	7576 KB	Output is correct
12	Correct	383 ms	18164 KB	Output is correct
13	Correct	391 ms	27912 KB	Output is correct
14	Correct	395 ms	37416 KB	Output is correct
15	Correct	876 ms	38268 KB	Output is correct
16	Correct	505 ms	38268 KB	Output is correct
17	Correct	482 ms	38268 KB	Output is correct
18	Correct	219 ms	39144 KB	Output is correct
19	Correct	296 ms	39144 KB	Output is correct
20	Correct	319 ms	39144 KB	Output is correct
21	Correct	386 ms	39348 KB	Output is correct
22	Correct	403 ms	52996 KB	Output is correct
23	Correct	580 ms	65536 KB	Output is correct
24	Correct	545 ms	65536 KB	Output is correct
25	Correct	474 ms	65536 KB	Output is correct
26	Correct	679 ms	65536 KB	Output is correct
27	Correct	662 ms	65536 KB	Output is correct
28	Correct	297 ms	65536 KB	Output is correct
29	Correct	396 ms	65536 KB	Output is correct
30	Correct	414 ms	65536 KB	Output is correct
31	Correct	1078 ms	65536 KB	Output is correct
32	Correct	694 ms	65536 KB	Output is correct
33	Correct	425 ms	65536 KB	Output is correct
34	Correct	548 ms	65536 KB	Output is correct
35	Correct	647 ms	65536 KB	Output is correct
36	Correct	271 ms	65536 KB	Output is correct
37	Correct	384 ms	65536 KB	Output is correct
38	Correct	397 ms	65536 KB	Output is correct
39	Correct	548 ms	65536 KB	Output is correct
40	Correct	521 ms	65536 KB	Output is correct
41	Correct	218 ms	65536 KB	Output is correct
42	Correct	210 ms	65536 KB	Output is correct
43	Correct	239 ms	65536 KB	Output is correct
44	Correct	260 ms	65536 KB	Output is correct
45	Correct	220 ms	65536 KB	Output is correct
46	Correct	277 ms	65536 KB	Output is correct
47	Correct	266 ms	65536 KB	Output is correct
48	Correct	194 ms	65536 KB	Output is correct
49	Correct	216 ms	65536 KB	Output is correct
50	Correct	235 ms	65536 KB	Output is correct
51	Correct	229 ms	65536 KB	Output is correct
52	Correct	296 ms	65536 KB	Output is correct
53	Correct	218 ms	65536 KB	Output is correct
54	Correct	263 ms	65536 KB	Output is correct
55	Correct	274 ms	65536 KB	Output is correct
56	Correct	201 ms	65536 KB	Output is correct
57	Correct	212 ms	65536 KB	Output is correct
58	Correct	236 ms	65536 KB	Output is correct
59	Correct	233 ms	65536 KB	Output is correct
60	Correct	264 ms	65536 KB	Output is correct
61	Correct	218 ms	65536 KB	Output is correct
62	Correct	270 ms	65536 KB	Output is correct
63	Correct	276 ms	65536 KB	Output is correct
64	Correct	195 ms	65536 KB	Output is correct
65	Correct	252 ms	65536 KB	Output is correct
66	Correct	249 ms	65536 KB	Output is correct
67	Correct	268 ms	65536 KB	Output is correct
68	Correct	251 ms	65536 KB	Output is correct
69	Correct	252 ms	65536 KB	Output is correct
70	Correct	251 ms	65536 KB	Output is correct
71	Correct	816 ms	65536 KB	Output is correct
72	Correct	820 ms	65536 KB	Output is correct
73	Correct	1214 ms	65536 KB	Output is correct
74	Correct	1664 ms	65536 KB	Output is correct
75	Correct	964 ms	65536 KB	Output is correct
76	Execution timed out	2053 ms	65536 KB	Time limit exceeded
77	Halted	0 ms	0 KB	-

답안 #42161

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