oj.uz

Submission #42158

# Submission time Handle Problem Language Result Execution time Memory
42158 2018-02-23T05:16:38 Z fest Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 65536 KB 
// 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[21], dp[2][2][1 << N], cost[2][1 << N], qs[21];

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 % 2;
		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) % 2][now];
		else ret += dp[ty][(n - 1) % 2][now];
	}	
	return abs(ret);
} 

int main() {
  
	int q;
	cin >> n >> q;
	scanf("\n");
	for (int i = 0; i < (1 << n); i++) {
		char x;
		scanf("%c", &x);
		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--) {
		scanf("\n");
		int zer = 0, one = 0, que = 0;
		for (int i = n - 1; i >= 0; i--) {
			char x;
			scanf("%c", &x);
			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) % 2][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) % 2][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");
             ^
snake_escaping.cpp:94:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%c", &x);
                  ^
snake_escaping.cpp:102:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("\n");
              ^
snake_escaping.cpp:106:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%c", &x);
                   ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 532 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 612 KB Output is correct
8 Correct 2 ms 612 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 532 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 612 KB Output is correct
8 Correct 2 ms 612 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 737 ms 7636 KB Output is correct
12 Correct 736 ms 18100 KB Output is correct
13 Correct 880 ms 28136 KB Output is correct
14 Correct 824 ms 37412 KB Output is correct
15 Correct 1246 ms 38472 KB Output is correct
16 Correct 903 ms 38472 KB Output is correct
17 Correct 920 ms 38472 KB Output is correct
18 Correct 640 ms 39288 KB Output is correct
19 Correct 739 ms 39288 KB Output is correct
20 Correct 740 ms 39288 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 532 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 612 KB Output is correct
8 Correct 2 ms 612 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 737 ms 7636 KB Output is correct
12 Correct 736 ms 18100 KB Output is correct
13 Correct 880 ms 28136 KB Output is correct
14 Correct 824 ms 37412 KB Output is correct
15 Correct 1246 ms 38472 KB Output is correct
16 Correct 903 ms 38472 KB Output is correct
17 Correct 920 ms 38472 KB Output is correct
18 Correct 640 ms 39288 KB Output is correct
19 Correct 739 ms 39288 KB Output is correct
20 Correct 740 ms 39288 KB Output is correct
21 Correct 923 ms 39416 KB Output is correct
22 Correct 895 ms 52972 KB Output is correct
23 Correct 1081 ms 65536 KB Output is correct
24 Correct 1086 ms 65536 KB Output is correct
25 Correct 1063 ms 65536 KB Output is correct
26 Correct 1194 ms 65536 KB Output is correct
27 Correct 1241 ms 65536 KB Output is correct
28 Correct 824 ms 65536 KB Output is correct
29 Correct 908 ms 65536 KB Output is correct
30 Correct 981 ms 65536 KB Output is correct
31 Correct 1515 ms 65536 KB Output is correct
32 Correct 1138 ms 65536 KB Output is correct
33 Correct 942 ms 65536 KB Output is correct
34 Correct 1010 ms 65536 KB Output is correct
35 Correct 1114 ms 65536 KB Output is correct
36 Correct 746 ms 65536 KB Output is correct
37 Correct 888 ms 65536 KB Output is correct
38 Correct 914 ms 65536 KB Output is correct
39 Correct 1073 ms 65536 KB Output is correct
40 Correct 1032 ms 65536 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 532 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 612 KB Output is correct
8 Correct 2 ms 612 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 278 ms 65536 KB Output is correct
12 Correct 277 ms 65536 KB Output is correct
13 Correct 302 ms 65536 KB Output is correct
14 Correct 362 ms 65536 KB Output is correct
15 Correct 283 ms 65536 KB Output is correct
16 Correct 352 ms 65536 KB Output is correct
17 Correct 347 ms 65536 KB Output is correct
18 Correct 261 ms 65536 KB Output is correct
19 Correct 304 ms 65536 KB Output is correct
20 Correct 270 ms 65536 KB Output is correct
21 Correct 307 ms 65536 KB Output is correct
22 Correct 343 ms 65536 KB Output is correct
23 Correct 282 ms 65536 KB Output is correct
24 Correct 355 ms 65536 KB Output is correct
25 Correct 344 ms 65536 KB Output is correct
26 Correct 278 ms 65536 KB Output is correct
27 Correct 284 ms 65536 KB Output is correct
28 Correct 286 ms 65536 KB Output is correct
29 Correct 309 ms 65536 KB Output is correct
30 Correct 344 ms 65536 KB Output is correct
31 Correct 285 ms 65536 KB Output is correct
32 Correct 387 ms 65536 KB Output is correct
33 Correct 378 ms 65536 KB Output is correct
34 Correct 291 ms 65536 KB Output is correct
35 Correct 337 ms 65536 KB Output is correct
36 Correct 325 ms 65536 KB Output is correct
37 Correct 324 ms 65536 KB Output is correct
38 Correct 340 ms 65536 KB Output is correct
39 Correct 352 ms 65536 KB Output is correct
40 Correct 325 ms 65536 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 532 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 3 ms 612 KB Output is correct
7 Correct 3 ms 612 KB Output is correct
8 Correct 2 ms 612 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 737 ms 7636 KB Output is correct
12 Correct 736 ms 18100 KB Output is correct
13 Correct 880 ms 28136 KB Output is correct
14 Correct 824 ms 37412 KB Output is correct
15 Correct 1246 ms 38472 KB Output is correct
16 Correct 903 ms 38472 KB Output is correct
17 Correct 920 ms 38472 KB Output is correct
18 Correct 640 ms 39288 KB Output is correct
19 Correct 739 ms 39288 KB Output is correct
20 Correct 740 ms 39288 KB Output is correct
21 Correct 923 ms 39416 KB Output is correct
22 Correct 895 ms 52972 KB Output is correct
23 Correct 1081 ms 65536 KB Output is correct
24 Correct 1086 ms 65536 KB Output is correct
25 Correct 1063 ms 65536 KB Output is correct
26 Correct 1194 ms 65536 KB Output is correct
27 Correct 1241 ms 65536 KB Output is correct
28 Correct 824 ms 65536 KB Output is correct
29 Correct 908 ms 65536 KB Output is correct
30 Correct 981 ms 65536 KB Output is correct
31 Correct 1515 ms 65536 KB Output is correct
32 Correct 1138 ms 65536 KB Output is correct
33 Correct 942 ms 65536 KB Output is correct
34 Correct 1010 ms 65536 KB Output is correct
35 Correct 1114 ms 65536 KB Output is correct
36 Correct 746 ms 65536 KB Output is correct
37 Correct 888 ms 65536 KB Output is correct
38 Correct 914 ms 65536 KB Output is correct
39 Correct 1073 ms 65536 KB Output is correct
40 Correct 1032 ms 65536 KB Output is correct
41 Correct 278 ms 65536 KB Output is correct
42 Correct 277 ms 65536 KB Output is correct
43 Correct 302 ms 65536 KB Output is correct
44 Correct 362 ms 65536 KB Output is correct
45 Correct 283 ms 65536 KB Output is correct
46 Correct 352 ms 65536 KB Output is correct
47 Correct 347 ms 65536 KB Output is correct
48 Correct 261 ms 65536 KB Output is correct
49 Correct 304 ms 65536 KB Output is correct
50 Correct 270 ms 65536 KB Output is correct
51 Correct 307 ms 65536 KB Output is correct
52 Correct 343 ms 65536 KB Output is correct
53 Correct 282 ms 65536 KB Output is correct
54 Correct 355 ms 65536 KB Output is correct
55 Correct 344 ms 65536 KB Output is correct
56 Correct 278 ms 65536 KB Output is correct
57 Correct 284 ms 65536 KB Output is correct
58 Correct 286 ms 65536 KB Output is correct
59 Correct 309 ms 65536 KB Output is correct
60 Correct 344 ms 65536 KB Output is correct
61 Correct 285 ms 65536 KB Output is correct
62 Correct 387 ms 65536 KB Output is correct
63 Correct 378 ms 65536 KB Output is correct
64 Correct 291 ms 65536 KB Output is correct
65 Correct 337 ms 65536 KB Output is correct
66 Correct 325 ms 65536 KB Output is correct
67 Correct 324 ms 65536 KB Output is correct
68 Correct 340 ms 65536 KB Output is correct
69 Correct 352 ms 65536 KB Output is correct
70 Correct 325 ms 65536 KB Output is correct
71 Correct 1659 ms 65536 KB Output is correct
72 Correct 1627 ms 65536 KB Output is correct
73 Execution timed out 2036 ms 65536 KB Time limit exceeded
74 Halted 0 ms 0 KB -