oj.uz

답안 #886844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
886844 2023-12-13T03:53:24 Z socho Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 800 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double D;
typedef vector<int> VI;
typedef set<int> SI;
typedef map<int, int> MII;
typedef pair<int, int> PII;

#define A first
#define B second
#define SZ(x) int(x.size())
#define PB push_back
#define FR(i, a, b) for (int i = (a); i < (b); i++)
#define FOR(i, n) FR(i, 0, n)
#define RF(i, a, b) for (int i = (a); i >= (b); i--)
#define FRA(a, x) for (auto a: (x))

template <typename T> inline void set_min(T &a, T b) {if(b < a) a = b;}
template <typename T> inline void set_max(T &a, T b) {if(b > a) a = b;}

int n, q;
string s;
const int MXN = 20;
int dp[MXN][1<<MXN];
int dp2[MXN][1<<MXN];
int val[1<<MXN];

VI ms;

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	
	cin >> n >> q;
	cin >> s;
	
	FOR(i, 1<<n) {
		val[i] = (s[i] - '0');
	}
	
	FOR(b, n) {
		FOR(i, 1<<n) {
			if (b == 0) {
				dp[b][i] = ((i & (1 << b)) > 0 ? val[i] + val[i ^ (1<<b)] : val[i]);
				dp2[b][i] = ((i & (1 << b)) == 0 ? val[i] + val[i ^ (1<<b)] : val[i]);
			}
			else {
				dp[b][i] = ((i & (1 << b)) > 0 ? dp[b-1][i] + dp[b-1][i ^ (1<<b)] : dp[b-1][i]);
				dp2[b][i] = ((i & (1 << b)) == 0 ? dp2[b-1][i] + dp2[b-1][i ^ (1<<b)] : dp2[b-1][i]);
			}
		}
	}
	
	FOR(_, q) {
		string s;
		cin >> s;
		reverse(s.begin(), s.end());
		
		int n0 = 0, n1 = 0, nq = 0;
		FRA(x, s) {
			if (x == '?') nq++;
			else if (x == '0') n0++;
			else n1++;
		}
		
		int ans = 0;
		if (nq <= 6) {
			// just add over the bitmasks
			int main = 0;
			FOR(i, n) {
				if (s[i] == '?') ms.PB(i);
				else if (s[i] == '1') main += (1 << i);
			}
			FOR(i, 1<<nq) {
				int p = main;
				FOR(j, nq) {
					if (i & (1 << j)) p += (1 << ms[j]);
				}
				ans += val[p];
			}
		}
		else if (n0 <= 6) {
			// 0011??
			// super(001100)
			// -super(011100)
			// -super(101100)
			// +super(111100)
			int main = 0;
			FOR(i, n) {
				if (s[i] == '0') ms.PB(i);
				else if (s[i] == '1') main += (1 << i);
			}
			FOR(i, 1<<n0) {
				int p = main;
				FOR(j, n0) {
					if (i & (1 << j)) {
						p += (1 << ms[j]);
					}
				}
				if (__builtin_popcount(i) % 2 == 0) ans += dp2[n-1][p];
				else ans -= dp2[n-1][p];
			}
		}
		else { // n1 <= 6
			// 0011??
			// sub(001111)
			// -sub(001011)
			// -sub(000111)
			// +sub(000011)
			int main = 0;
			FOR(i, n) {
				if (s[i] == '1') ms.PB(i);
				else if (s[i] == '?') main += (1 << i);
			}
			FOR(i, 1<<n1) {
				int p = main;
				FOR(j, n1) {
					if (i & (1 << j)) p += (1 << ms[j]);
				}
				if ((n1 - __builtin_popcount(i)) % 2 == 0) ans += dp[n-1][p];
				else ans -= dp[n-1][p];
			}
		}
		cout << ans << '\n';
		ms.clear();
		
	}
	
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 41308 KB Output is correct
2 Correct 5 ms 41308 KB Output is correct
3 Correct 5 ms 41308 KB Output is correct
4 Correct 4 ms 41504 KB Output is correct
5 Correct 6 ms 41308 KB Output is correct
6 Correct 5 ms 41308 KB Output is correct
7 Correct 4 ms 41308 KB Output is correct
8 Correct 4 ms 41308 KB Output is correct
9 Correct 4 ms 41308 KB Output is correct
10 Correct 5 ms 41308 KB Output is correct
11 Correct 366 ms 45392 KB Output is correct
12 Correct 438 ms 45364 KB Output is correct
13 Correct 274 ms 44224 KB Output is correct
14 Correct 271 ms 44564 KB Output is correct
15 Correct 726 ms 45652 KB Output is correct
16 Correct 360 ms 44628 KB Output is correct
17 Correct 359 ms 44600 KB Output is correct
18 Correct 152 ms 46276 KB Output is correct
19 Correct 178 ms 43360 KB Output is correct
20 Correct 413 ms 45140 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 41308 KB Output is correct
2 Correct 5 ms 41308 KB Output is correct
3 Correct 5 ms 41308 KB Output is correct
4 Correct 4 ms 41504 KB Output is correct
5 Correct 6 ms 41308 KB Output is correct
6 Correct 5 ms 41308 KB Output is correct
7 Correct 4 ms 41308 KB Output is correct
8 Correct 4 ms 41308 KB Output is correct
9 Correct 4 ms 41308 KB Output is correct
10 Correct 5 ms 41308 KB Output is correct
11 Correct 366 ms 45392 KB Output is correct
12 Correct 438 ms 45364 KB Output is correct
13 Correct 274 ms 44224 KB Output is correct
14 Correct 271 ms 44564 KB Output is correct
15 Correct 726 ms 45652 KB Output is correct
16 Correct 360 ms 44628 KB Output is correct
17 Correct 359 ms 44600 KB Output is correct
18 Correct 152 ms 46276 KB Output is correct
19 Correct 178 ms 43360 KB Output is correct
20 Correct 413 ms 45140 KB Output is correct
21 Correct 216 ms 59988 KB Output is correct
22 Correct 695 ms 60448 KB Output is correct
23 Correct 398 ms 57936 KB Output is correct
24 Correct 353 ms 57428 KB Output is correct
25 Correct 336 ms 62292 KB Output is correct
26 Correct 488 ms 58704 KB Output is correct
27 Correct 465 ms 58576 KB Output is correct
28 Correct 180 ms 64852 KB Output is correct
29 Correct 206 ms 55816 KB Output is correct
30 Correct 415 ms 60516 KB Output is correct
31 Correct 800 ms 57836 KB Output is correct
32 Correct 476 ms 57676 KB Output is correct
33 Correct 293 ms 56588 KB Output is correct
34 Correct 359 ms 56692 KB Output is correct
35 Correct 466 ms 57568 KB Output is correct
36 Correct 161 ms 55832 KB Output is correct
37 Correct 769 ms 57880 KB Output is correct
38 Correct 216 ms 55832 KB Output is correct
39 Correct 394 ms 56916 KB Output is correct
40 Correct 356 ms 56836 KB Output is correct

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 41308 KB Output is correct
2 Correct 5 ms 41308 KB Output is correct
3 Correct 5 ms 41308 KB Output is correct
4 Correct 4 ms 41504 KB Output is correct
5 Correct 6 ms 41308 KB Output is correct
6 Correct 5 ms 41308 KB Output is correct
7 Correct 4 ms 41308 KB Output is correct
8 Correct 4 ms 41308 KB Output is correct
9 Correct 4 ms 41308 KB Output is correct
10 Correct 5 ms 41308 KB Output is correct
11 Runtime error 23 ms 65536 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 41308 KB Output is correct
2 Correct 5 ms 41308 KB Output is correct
3 Correct 5 ms 41308 KB Output is correct
4 Correct 4 ms 41504 KB Output is correct
5 Correct 6 ms 41308 KB Output is correct
6 Correct 5 ms 41308 KB Output is correct
7 Correct 4 ms 41308 KB Output is correct
8 Correct 4 ms 41308 KB Output is correct
9 Correct 4 ms 41308 KB Output is correct
10 Correct 5 ms 41308 KB Output is correct
11 Correct 366 ms 45392 KB Output is correct
12 Correct 438 ms 45364 KB Output is correct
13 Correct 274 ms 44224 KB Output is correct
14 Correct 271 ms 44564 KB Output is correct
15 Correct 726 ms 45652 KB Output is correct
16 Correct 360 ms 44628 KB Output is correct
17 Correct 359 ms 44600 KB Output is correct
18 Correct 152 ms 46276 KB Output is correct
19 Correct 178 ms 43360 KB Output is correct
20 Correct 413 ms 45140 KB Output is correct
21 Correct 216 ms 59988 KB Output is correct
22 Correct 695 ms 60448 KB Output is correct
23 Correct 398 ms 57936 KB Output is correct
24 Correct 353 ms 57428 KB Output is correct
25 Correct 336 ms 62292 KB Output is correct
26 Correct 488 ms 58704 KB Output is correct
27 Correct 465 ms 58576 KB Output is correct
28 Correct 180 ms 64852 KB Output is correct
29 Correct 206 ms 55816 KB Output is correct
30 Correct 415 ms 60516 KB Output is correct
31 Correct 800 ms 57836 KB Output is correct
32 Correct 476 ms 57676 KB Output is correct
33 Correct 293 ms 56588 KB Output is correct
34 Correct 359 ms 56692 KB Output is correct
35 Correct 466 ms 57568 KB Output is correct
36 Correct 161 ms 55832 KB Output is correct
37 Correct 769 ms 57880 KB Output is correct
38 Correct 216 ms 55832 KB Output is correct
39 Correct 394 ms 56916 KB Output is correct
40 Correct 356 ms 56836 KB Output is correct
41 Runtime error 23 ms 65536 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -