oj.uz

답안 #42152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
42152 2018-02-23T04:59:50 Z fest Snake Escaping (JOI18_snake_escaping) C++14
58 / 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 dp[2][2][1 << N], cost[2][1 << N], qs[21];

int n;

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)];
		}
	}
}

int calc(int ty, int cnt) {
	int ret = 0;
	for (int mask = 0; mask < (1 << cnt); mask++) {
		int now = 0;
		int j = 0;
		for (int i = 0; i < n; i++) {
			if (qs[i] == 0) continue;
			if (qs[i] == 2) now |= (1 << i);
			if (qs[i] == 1) {
				if (mask & (1 << j)) now |= (1 << i);
				j++;
			}
		}
		if (__builtin_popcount(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');
	} 
	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 (que < 8) {
			int ans = 0;
			for (int mask = 0; mask < (1 << que); mask++) {
				int ret = 0;
				int j = 0;
				for (int i = 0; i < n; i++) {
					if (qs[i] == 2) {
						if (mask & (1 << j)) ret |= (1 << i);
						j++;
					}
					if (qs[i] == 1) ret |= (1 << i);
				}
				ans += cost[0][ret];
			}
			printf("%d\n", ans);
			continue;
		}
		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 (one < 8) {
			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:101:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("\n");
              ^
snake_escaping.cpp:105: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

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

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 480 KB Output is correct
3 Correct 3 ms 564 KB Output is correct
4 Correct 3 ms 564 KB Output is correct
5 Correct 7 ms 564 KB Output is correct
6 Correct 3 ms 564 KB Output is correct
7 Correct 3 ms 576 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 7 ms 724 KB Output is correct
11 Execution timed out 2041 ms 11588 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 480 KB Output is correct
3 Correct 3 ms 564 KB Output is correct
4 Correct 3 ms 564 KB Output is correct
5 Correct 7 ms 564 KB Output is correct
6 Correct 3 ms 564 KB Output is correct
7 Correct 3 ms 576 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 7 ms 724 KB Output is correct
11 Execution timed out 2041 ms 11588 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 480 KB Output is correct
3 Correct 3 ms 564 KB Output is correct
4 Correct 3 ms 564 KB Output is correct
5 Correct 7 ms 564 KB Output is correct
6 Correct 3 ms 564 KB Output is correct
7 Correct 3 ms 576 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 7 ms 724 KB Output is correct
11 Correct 286 ms 33420 KB Output is correct
12 Correct 328 ms 35448 KB Output is correct
13 Correct 498 ms 37624 KB Output is correct
14 Correct 851 ms 39784 KB Output is correct
15 Correct 356 ms 41732 KB Output is correct
16 Correct 618 ms 43784 KB Output is correct
17 Correct 580 ms 45608 KB Output is correct
18 Correct 255 ms 48016 KB Output is correct
19 Correct 269 ms 49684 KB Output is correct
20 Correct 344 ms 52048 KB Output is correct
21 Correct 493 ms 53976 KB Output is correct
22 Correct 920 ms 56096 KB Output is correct
23 Correct 369 ms 58036 KB Output is correct
24 Correct 664 ms 60200 KB Output is correct
25 Correct 612 ms 62292 KB Output is correct
26 Correct 276 ms 64048 KB Output is correct
27 Correct 293 ms 65536 KB Output is correct
28 Correct 292 ms 65536 KB Output is correct
29 Correct 566 ms 65536 KB Output is correct
30 Correct 616 ms 65536 KB Output is correct
31 Correct 375 ms 65536 KB Output is correct
32 Correct 679 ms 65536 KB Output is correct
33 Correct 606 ms 65536 KB Output is correct
34 Correct 275 ms 65536 KB Output is correct
35 Correct 486 ms 65536 KB Output is correct
36 Correct 538 ms 65536 KB Output is correct
37 Correct 466 ms 65536 KB Output is correct
38 Correct 483 ms 65536 KB Output is correct
39 Correct 497 ms 65536 KB Output is correct
40 Correct 499 ms 65536 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 480 KB Output is correct
3 Correct 3 ms 564 KB Output is correct
4 Correct 3 ms 564 KB Output is correct
5 Correct 7 ms 564 KB Output is correct
6 Correct 3 ms 564 KB Output is correct
7 Correct 3 ms 576 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 7 ms 724 KB Output is correct
11 Execution timed out 2041 ms 11588 KB Time limit exceeded
12 Halted 0 ms 0 KB -