oj.uz

Submission #42165

# Submission time Handle Problem Language Result Execution time Memory
42165 2018-02-23T05:39:28 Z fest Snake Escaping (JOI18_snake_escaping) C++14
100 / 100
 1362 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 ones[N], dp[2][2][1 << N], cost[2][1 << N], qs[N];

bool built[1 << 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 ret = 0;
	int alw = 0;
	int mask = 0;
	for (int i = 0; i < n; i++) {
		if (qs[i] == 2) alw |= (1 << i);
		if (qs[i] == 1) mask |= (1 << i);
	}
	for (int pod = mask; ; pod = (pod - 1) & mask) {
		if (built[pod]) ret -= dp[ty][(n - 1) & 1][alw | pod];
		else ret += dp[ty][(n - 1) & 1][alw | pod];
		if (!pod) break;
	}	
	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) & 1);
	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 mask = 0;
			int alw = 0;
			for (int i = 0; i < n; i++) {
				if (qs[i] == 2) mask |= (1 << i); 
				if (qs[i] == 1) alw |= (1 << i);
			}
			for (int pod = mask; ; pod = (pod - 1) & mask) {
				ans += cost[0][alw | pod];
				if (!pod) break;
			}
			printf("%d\n", ans);
			continue;
		}
		if (one < 7) {
			printf("%d\n", calc(0));
			continue;
		}
		for (int i = 0; i < n; i++) if (qs[i] < 2) qs[i] ^= 1;
		printf("%d\n", calc(1));
	}
	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:90: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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 660 KB Output is correct
10 Correct 2 ms 660 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 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 660 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 309 ms 7468 KB Output is correct
12 Correct 331 ms 17960 KB Output is correct
13 Correct 358 ms 28060 KB Output is correct
14 Correct 364 ms 37324 KB Output is correct
15 Correct 444 ms 38332 KB Output is correct
16 Correct 415 ms 38332 KB Output is correct
17 Correct 391 ms 38332 KB Output is correct
18 Correct 239 ms 39272 KB Output is correct
19 Correct 290 ms 39272 KB Output is correct
20 Correct 321 ms 39272 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 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 660 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 309 ms 7468 KB Output is correct
12 Correct 331 ms 17960 KB Output is correct
13 Correct 358 ms 28060 KB Output is correct
14 Correct 364 ms 37324 KB Output is correct
15 Correct 444 ms 38332 KB Output is correct
16 Correct 415 ms 38332 KB Output is correct
17 Correct 391 ms 38332 KB Output is correct
18 Correct 239 ms 39272 KB Output is correct
19 Correct 290 ms 39272 KB Output is correct
20 Correct 321 ms 39272 KB Output is correct
21 Correct 374 ms 39272 KB Output is correct
22 Correct 422 ms 53216 KB Output is correct
23 Correct 473 ms 65536 KB Output is correct
24 Correct 463 ms 65536 KB Output is correct
25 Correct 511 ms 65536 KB Output is correct
26 Correct 507 ms 65536 KB Output is correct
27 Correct 528 ms 65536 KB Output is correct
28 Correct 315 ms 65536 KB Output is correct
29 Correct 383 ms 65536 KB Output is correct
30 Correct 405 ms 65536 KB Output is correct
31 Correct 521 ms 65536 KB Output is correct
32 Correct 480 ms 65536 KB Output is correct
33 Correct 391 ms 65536 KB Output is correct
34 Correct 454 ms 65536 KB Output is correct
35 Correct 489 ms 65536 KB Output is correct
36 Correct 282 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 461 ms 65536 KB Output is correct
40 Correct 449 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 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 660 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 201 ms 65536 KB Output is correct
12 Correct 197 ms 65536 KB Output is correct
13 Correct 213 ms 65536 KB Output is correct
14 Correct 207 ms 65536 KB Output is correct
15 Correct 204 ms 65536 KB Output is correct
16 Correct 227 ms 65536 KB Output is correct
17 Correct 223 ms 65536 KB Output is correct
18 Correct 192 ms 65536 KB Output is correct
19 Correct 199 ms 65536 KB Output is correct
20 Correct 200 ms 65536 KB Output is correct
21 Correct 235 ms 65536 KB Output is correct
22 Correct 218 ms 65536 KB Output is correct
23 Correct 197 ms 65536 KB Output is correct
24 Correct 207 ms 65536 KB Output is correct
25 Correct 216 ms 65536 KB Output is correct
26 Correct 182 ms 65536 KB Output is correct
27 Correct 201 ms 65536 KB Output is correct
28 Correct 202 ms 65536 KB Output is correct
29 Correct 211 ms 65536 KB Output is correct
30 Correct 224 ms 65536 KB Output is correct
31 Correct 197 ms 65536 KB Output is correct
32 Correct 245 ms 65536 KB Output is correct
33 Correct 224 ms 65536 KB Output is correct
34 Correct 202 ms 65536 KB Output is correct
35 Correct 216 ms 65536 KB Output is correct
36 Correct 211 ms 65536 KB Output is correct
37 Correct 216 ms 65536 KB Output is correct
38 Correct 213 ms 65536 KB Output is correct
39 Correct 213 ms 65536 KB Output is correct
40 Correct 219 ms 65536 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 2 ms 660 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 309 ms 7468 KB Output is correct
12 Correct 331 ms 17960 KB Output is correct
13 Correct 358 ms 28060 KB Output is correct
14 Correct 364 ms 37324 KB Output is correct
15 Correct 444 ms 38332 KB Output is correct
16 Correct 415 ms 38332 KB Output is correct
17 Correct 391 ms 38332 KB Output is correct
18 Correct 239 ms 39272 KB Output is correct
19 Correct 290 ms 39272 KB Output is correct
20 Correct 321 ms 39272 KB Output is correct
21 Correct 374 ms 39272 KB Output is correct
22 Correct 422 ms 53216 KB Output is correct
23 Correct 473 ms 65536 KB Output is correct
24 Correct 463 ms 65536 KB Output is correct
25 Correct 511 ms 65536 KB Output is correct
26 Correct 507 ms 65536 KB Output is correct
27 Correct 528 ms 65536 KB Output is correct
28 Correct 315 ms 65536 KB Output is correct
29 Correct 383 ms 65536 KB Output is correct
30 Correct 405 ms 65536 KB Output is correct
31 Correct 521 ms 65536 KB Output is correct
32 Correct 480 ms 65536 KB Output is correct
33 Correct 391 ms 65536 KB Output is correct
34 Correct 454 ms 65536 KB Output is correct
35 Correct 489 ms 65536 KB Output is correct
36 Correct 282 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 461 ms 65536 KB Output is correct
40 Correct 449 ms 65536 KB Output is correct
41 Correct 201 ms 65536 KB Output is correct
42 Correct 197 ms 65536 KB Output is correct
43 Correct 213 ms 65536 KB Output is correct
44 Correct 207 ms 65536 KB Output is correct
45 Correct 204 ms 65536 KB Output is correct
46 Correct 227 ms 65536 KB Output is correct
47 Correct 223 ms 65536 KB Output is correct
48 Correct 192 ms 65536 KB Output is correct
49 Correct 199 ms 65536 KB Output is correct
50 Correct 200 ms 65536 KB Output is correct
51 Correct 235 ms 65536 KB Output is correct
52 Correct 218 ms 65536 KB Output is correct
53 Correct 197 ms 65536 KB Output is correct
54 Correct 207 ms 65536 KB Output is correct
55 Correct 216 ms 65536 KB Output is correct
56 Correct 182 ms 65536 KB Output is correct
57 Correct 201 ms 65536 KB Output is correct
58 Correct 202 ms 65536 KB Output is correct
59 Correct 211 ms 65536 KB Output is correct
60 Correct 224 ms 65536 KB Output is correct
61 Correct 197 ms 65536 KB Output is correct
62 Correct 245 ms 65536 KB Output is correct
63 Correct 224 ms 65536 KB Output is correct
64 Correct 202 ms 65536 KB Output is correct
65 Correct 216 ms 65536 KB Output is correct
66 Correct 211 ms 65536 KB Output is correct
67 Correct 216 ms 65536 KB Output is correct
68 Correct 213 ms 65536 KB Output is correct
69 Correct 213 ms 65536 KB Output is correct
70 Correct 219 ms 65536 KB Output is correct
71 Correct 837 ms 65536 KB Output is correct
72 Correct 832 ms 65536 KB Output is correct
73 Correct 1043 ms 65536 KB Output is correct
74 Correct 1140 ms 65536 KB Output is correct
75 Correct 848 ms 65536 KB Output is correct
76 Correct 1362 ms 65536 KB Output is correct
77 Correct 1183 ms 65536 KB Output is correct
78 Correct 544 ms 65536 KB Output is correct
79 Correct 785 ms 65536 KB Output is correct
80 Correct 828 ms 65536 KB Output is correct
81 Correct 1034 ms 65536 KB Output is correct
82 Correct 1170 ms 65536 KB Output is correct
83 Correct 718 ms 65536 KB Output is correct
84 Correct 956 ms 65536 KB Output is correct
85 Correct 1244 ms 65536 KB Output is correct
86 Correct 528 ms 65536 KB Output is correct
87 Correct 852 ms 65536 KB Output is correct
88 Correct 837 ms 65536 KB Output is correct
89 Correct 966 ms 65536 KB Output is correct
90 Correct 1022 ms 65536 KB Output is correct
91 Correct 772 ms 65536 KB Output is correct
92 Correct 1213 ms 65536 KB Output is correct
93 Correct 1291 ms 65536 KB Output is correct
94 Correct 522 ms 65536 KB Output is correct
95 Correct 1093 ms 65536 KB Output is correct
96 Correct 1162 ms 65536 KB Output is correct
97 Correct 1118 ms 65536 KB Output is correct
98 Correct 1085 ms 65536 KB Output is correct
99 Correct 1109 ms 65536 KB Output is correct
100 Correct 1078 ms 65536 KB Output is correct