oj.uz

답안 #943778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943778 2024-03-11T21:43:49 Z guechotjrhh Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 36304 KB 
#include<iostream>
#include<string>
using namespace std;

#include<map>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
#define all(x) x.begin(),x.end()
string str;
int n,p;
vector<int> zer, on;//sum of those i contains, sum of those contains me i
void init(int N, int Q, string S) {
	n = N; p = 1 << n;
	str = S;
	zer.resize(p); on.resize(p);
	for (int i = 0; i < p; i++) zer[i] = on[i] = S[i] - '0';
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < p; j++) {
			if (j & (1 << i)) zer[j] += zer[j - (1 << i)];
			else on[j] += on[j + (1 << i)];
		}
	}
	//for (int i = 0; i < p; i++) cout << i << ' ' << zer[i] << endl;
	//for (int i = 0; i < p; i++) cout << i << ' ' << on[i] << endl;
}
int ab(int x) { return x > 0 ? x : -x; }
int res;
void rec1(vector<int>& o, int i, int c, int x) {
	if (i == o.size()) {
		if (x & 1) res += zer[c];
		else res -= zer[c];
		return;
	}

	rec1(o, i + 1, c, x);
	rec1(o, i + 1, c + o[i], x+1);
}
void rec0(vector<int>& z, int i, int c, int x) {
	if (i == z.size()) {
		if (x & 1) res += on[c];
		else res -= on[c];
		return;
	}

	rec0(z, i + 1, c, x);
	rec0(z, i + 1, c + z[i], x + 1);
}
void recq(vector<int>& q, int i, int c) {
	if (i == q.size()) { res += str[c] - '0'; return; }
	recq(q, i + 1, c);
	recq(q, i + 1, c + q[i]);
}
int query(string A) {
	vector<int> ze, o, q;
	for (int i = 0; i < n; i++) {
		if (A[i] == '0') ze.push_back(1 << (n-1-i));
		else if (A[i] == '1') o.push_back(1 << (n-1-i));
		else q.push_back(1 << (n-1-i));
	}
/*
3 5
12345678
000
0??
1?0
?11
???
*/
	if (ze.size() > o.size() && q.size() > o.size()) {
		int c = 0;
		for (int i : q) c += i;
		res = 0;
		rec1(o, 0, c, 0);
		/*for (int i = 0; i < (1 << o.size()); i++) {
			int w = c, x=0;
			for (int j = 0; j < o.size(); j++) {
				if (i & (1 << j)) {
					w += o[j];
					x++;
				}
			}
			if (x & 1) res += zer[w];
			else res -= zer[w];
		}*/
		return ab(res);
	}
	else if(q.size() > ze.size()) {
		int c = 0;
		for (int i : o) c += i;
		res = 0;
		rec0(ze, 0, c, 0);
		/*for (int i = 0; i < (1 << ze.size()); i++) {
			int w = c, x = 0;
			for (int j = 0; j < ze.size(); j++) {
				if (i & (1 << j)) {
					w += ze[j];
					x++;
				}
			}
			if (x & 1) res += on[w];
			else res -= on[w];
		}*/
		return ab(res);
	}
	else {
		res = 0;
		int c = 0;
		for (int i : o) c += i;
		recq(q, 0, c);
		return res;
	}
	return 0;
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int N, Q; cin >> N >> Q;
	string S; cin >> S;
	init(N, Q, move(S));
	
	for (int i = 0; i < Q; i++) {
		string A;
		cin >> A;
		cout << query(move(A)) << endl;
	}
}

Compilation message

snake_escaping.cpp: In function 'void rec1(std::vector<int>&, int, int, int)':
snake_escaping.cpp:31:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  if (i == o.size()) {
      |      ~~^~~~~~~~~~~
snake_escaping.cpp: In function 'void rec0(std::vector<int>&, int, int, int)':
snake_escaping.cpp:41:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  if (i == z.size()) {
      |      ~~^~~~~~~~~~~
snake_escaping.cpp: In function 'void recq(std::vector<int>&, int, int)':
snake_escaping.cpp:51:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |  if (i == q.size()) { res += str[c] - '0'; return; }
      |      ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1444 ms 15124 KB Output is correct
12 Correct 1476 ms 14824 KB Output is correct
13 Correct 1497 ms 14108 KB Output is correct
14 Correct 1506 ms 14092 KB Output is correct
15 Correct 1474 ms 15160 KB Output is correct
16 Correct 1563 ms 14420 KB Output is correct
17 Correct 1557 ms 14168 KB Output is correct
18 Correct 1353 ms 16340 KB Output is correct
19 Correct 1472 ms 13136 KB Output is correct
20 Correct 1451 ms 15096 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1444 ms 15124 KB Output is correct
12 Correct 1476 ms 14824 KB Output is correct
13 Correct 1497 ms 14108 KB Output is correct
14 Correct 1506 ms 14092 KB Output is correct
15 Correct 1474 ms 15160 KB Output is correct
16 Correct 1563 ms 14420 KB Output is correct
17 Correct 1557 ms 14168 KB Output is correct
18 Correct 1353 ms 16340 KB Output is correct
19 Correct 1472 ms 13136 KB Output is correct
20 Correct 1451 ms 15096 KB Output is correct
21 Correct 1517 ms 18108 KB Output is correct
22 Correct 1496 ms 18232 KB Output is correct
23 Correct 1571 ms 17216 KB Output is correct
24 Correct 1594 ms 17160 KB Output is correct
25 Correct 1535 ms 19028 KB Output is correct
26 Correct 1658 ms 17600 KB Output is correct
27 Correct 1598 ms 17468 KB Output is correct
28 Correct 1353 ms 20060 KB Output is correct
29 Correct 1529 ms 16032 KB Output is correct
30 Correct 1505 ms 18360 KB Output is correct
31 Correct 1623 ms 18272 KB Output is correct
32 Correct 1657 ms 18000 KB Output is correct
33 Correct 1521 ms 16876 KB Output is correct
34 Correct 1611 ms 17048 KB Output is correct
35 Correct 1621 ms 17544 KB Output is correct
36 Correct 1380 ms 16376 KB Output is correct
37 Correct 1496 ms 18196 KB Output is correct
38 Correct 1484 ms 16360 KB Output is correct
39 Correct 1579 ms 17296 KB Output is correct
40 Correct 1604 ms 17036 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 106 ms 12028 KB Output is correct
12 Correct 104 ms 12120 KB Output is correct
13 Correct 120 ms 11880 KB Output is correct
14 Correct 128 ms 12028 KB Output is correct
15 Correct 111 ms 12108 KB Output is correct
16 Correct 161 ms 12032 KB Output is correct
17 Correct 119 ms 12028 KB Output is correct
18 Correct 93 ms 12032 KB Output is correct
19 Correct 109 ms 12328 KB Output is correct
20 Correct 103 ms 12032 KB Output is correct
21 Correct 113 ms 12032 KB Output is correct
22 Correct 124 ms 12104 KB Output is correct
23 Correct 108 ms 12280 KB Output is correct
24 Correct 122 ms 12028 KB Output is correct
25 Correct 119 ms 12032 KB Output is correct
26 Correct 93 ms 12032 KB Output is correct
27 Correct 114 ms 12276 KB Output is correct
28 Correct 103 ms 12032 KB Output is correct
29 Correct 111 ms 12028 KB Output is correct
30 Correct 121 ms 12028 KB Output is correct
31 Correct 106 ms 12100 KB Output is correct
32 Correct 124 ms 12032 KB Output is correct
33 Correct 122 ms 12108 KB Output is correct
34 Correct 107 ms 12032 KB Output is correct
35 Correct 116 ms 12032 KB Output is correct
36 Correct 120 ms 12140 KB Output is correct
37 Correct 113 ms 12028 KB Output is correct
38 Correct 122 ms 12076 KB Output is correct
39 Correct 121 ms 12032 KB Output is correct
40 Correct 116 ms 12032 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 344 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1444 ms 15124 KB Output is correct
12 Correct 1476 ms 14824 KB Output is correct
13 Correct 1497 ms 14108 KB Output is correct
14 Correct 1506 ms 14092 KB Output is correct
15 Correct 1474 ms 15160 KB Output is correct
16 Correct 1563 ms 14420 KB Output is correct
17 Correct 1557 ms 14168 KB Output is correct
18 Correct 1353 ms 16340 KB Output is correct
19 Correct 1472 ms 13136 KB Output is correct
20 Correct 1451 ms 15096 KB Output is correct
21 Correct 1517 ms 18108 KB Output is correct
22 Correct 1496 ms 18232 KB Output is correct
23 Correct 1571 ms 17216 KB Output is correct
24 Correct 1594 ms 17160 KB Output is correct
25 Correct 1535 ms 19028 KB Output is correct
26 Correct 1658 ms 17600 KB Output is correct
27 Correct 1598 ms 17468 KB Output is correct
28 Correct 1353 ms 20060 KB Output is correct
29 Correct 1529 ms 16032 KB Output is correct
30 Correct 1505 ms 18360 KB Output is correct
31 Correct 1623 ms 18272 KB Output is correct
32 Correct 1657 ms 18000 KB Output is correct
33 Correct 1521 ms 16876 KB Output is correct
34 Correct 1611 ms 17048 KB Output is correct
35 Correct 1621 ms 17544 KB Output is correct
36 Correct 1380 ms 16376 KB Output is correct
37 Correct 1496 ms 18196 KB Output is correct
38 Correct 1484 ms 16360 KB Output is correct
39 Correct 1579 ms 17296 KB Output is correct
40 Correct 1604 ms 17036 KB Output is correct
41 Correct 106 ms 12028 KB Output is correct
42 Correct 104 ms 12120 KB Output is correct
43 Correct 120 ms 11880 KB Output is correct
44 Correct 128 ms 12028 KB Output is correct
45 Correct 111 ms 12108 KB Output is correct
46 Correct 161 ms 12032 KB Output is correct
47 Correct 119 ms 12028 KB Output is correct
48 Correct 93 ms 12032 KB Output is correct
49 Correct 109 ms 12328 KB Output is correct
50 Correct 103 ms 12032 KB Output is correct
51 Correct 113 ms 12032 KB Output is correct
52 Correct 124 ms 12104 KB Output is correct
53 Correct 108 ms 12280 KB Output is correct
54 Correct 122 ms 12028 KB Output is correct
55 Correct 119 ms 12032 KB Output is correct
56 Correct 93 ms 12032 KB Output is correct
57 Correct 114 ms 12276 KB Output is correct
58 Correct 103 ms 12032 KB Output is correct
59 Correct 111 ms 12028 KB Output is correct
60 Correct 121 ms 12028 KB Output is correct
61 Correct 106 ms 12100 KB Output is correct
62 Correct 124 ms 12032 KB Output is correct
63 Correct 122 ms 12108 KB Output is correct
64 Correct 107 ms 12032 KB Output is correct
65 Correct 116 ms 12032 KB Output is correct
66 Correct 120 ms 12140 KB Output is correct
67 Correct 113 ms 12028 KB Output is correct
68 Correct 122 ms 12076 KB Output is correct
69 Correct 121 ms 12032 KB Output is correct
70 Correct 116 ms 12032 KB Output is correct
71 Correct 1663 ms 36280 KB Output is correct
72 Correct 1701 ms 36304 KB Output is correct
73 Correct 1929 ms 34940 KB Output is correct
74 Execution timed out 2027 ms 34728 KB Time limit exceeded
75 Halted 0 ms 0 KB -