oj.uz

답안 #943785

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

#include<map>
#include<string>
#include<vector>
#define maxp 1048580
using namespace std;
string str;
int st[maxp],n,p,res,zer[maxp], on[maxp];
int ab(int x) { return x > 0 ? x : -x; }
void init(int N, int Q, string S) {
	n = N; p = 1 << n; str = S;
	for (int i = 0; i < p; i++) zer[i] = on[i] = st[i] = str[i] - '0';
	for (int i = 1; i < p; i<<=1) {
		for (int j = 0; j < p; j++) {
			if (j & i) zer[j] += zer[j ^ i];
			else on[j] += on[j ^ i];
		}
	}
}
void rec1(vector<int>& o, int i, int c, int a, int b) {
	if (i == o.size()) {res += (a^zer[c]) + b;return;}
	rec1(o, i + 1, c, a, b);
	rec1(o, i + 1, c ^ o[i], ~a, 1-b);
}
void rec0(vector<int>& z, int i, int c, int a, int b) {
	if (i == z.size()) {res += (a^on[c]) + b;return;}
	rec0(z, i + 1, c, a, b);
	rec0(z, i + 1, c ^ z[i], ~a, 1-b);
}
void recq(vector<int>& q, int i, int c) {
	if (i == q.size()) { res += st[c]; 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));
	}
	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, 0);
		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, 0);
		return ab(res);
	}
	else {
		res = 0;
		int c = 0;
		for (int i : o) c += i;
		recq(q, 0, c);
		return res;
	}
	return 0;
}
/*
4 8
3141592653589793
0101
?01?
??1?
?0??
1?00
01?1
??10
????

3 5
12345678
000
0??
1?0
?11
???
*/
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, int)':
snake_escaping.cpp:24:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |  if (i == o.size()) {res += (a^zer[c]) + b;return;}
      |      ~~^~~~~~~~~~~
snake_escaping.cpp: In function 'void rec0(std::vector<int>&, int, int, int, int)':
snake_escaping.cpp:29:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  if (i == z.size()) {res += (a^on[c]) + b;return;}
      |      ~~^~~~~~~~~~~
snake_escaping.cpp: In function 'void recq(std::vector<int>&, int, int)':
snake_escaping.cpp:34:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |  if (i == q.size()) { res += st[c]; return; }
      |      ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4440 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 2 ms 4696 KB Output is correct
11 Correct 1452 ms 8576 KB Output is correct
12 Correct 1452 ms 8316 KB Output is correct
13 Correct 1507 ms 7516 KB Output is correct
14 Correct 1518 ms 7764 KB Output is correct
15 Correct 1472 ms 8728 KB Output is correct
16 Correct 1578 ms 7968 KB Output is correct
17 Correct 1519 ms 7660 KB Output is correct
18 Correct 1414 ms 9548 KB Output is correct
19 Correct 1496 ms 6480 KB Output is correct
20 Correct 1432 ms 8256 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4440 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 2 ms 4696 KB Output is correct
11 Correct 1452 ms 8576 KB Output is correct
12 Correct 1452 ms 8316 KB Output is correct
13 Correct 1507 ms 7516 KB Output is correct
14 Correct 1518 ms 7764 KB Output is correct
15 Correct 1472 ms 8728 KB Output is correct
16 Correct 1578 ms 7968 KB Output is correct
17 Correct 1519 ms 7660 KB Output is correct
18 Correct 1414 ms 9548 KB Output is correct
19 Correct 1496 ms 6480 KB Output is correct
20 Correct 1432 ms 8256 KB Output is correct
21 Correct 1481 ms 8712 KB Output is correct
22 Correct 1510 ms 8820 KB Output is correct
23 Correct 1574 ms 7768 KB Output is correct
24 Correct 1601 ms 7596 KB Output is correct
25 Correct 1504 ms 9424 KB Output is correct
26 Correct 1622 ms 7956 KB Output is correct
27 Correct 1600 ms 7892 KB Output is correct
28 Correct 1350 ms 10528 KB Output is correct
29 Correct 1464 ms 6656 KB Output is correct
30 Correct 1523 ms 8788 KB Output is correct
31 Correct 1574 ms 8432 KB Output is correct
32 Correct 1619 ms 8680 KB Output is correct
33 Correct 1516 ms 7732 KB Output is correct
34 Correct 1598 ms 7600 KB Output is correct
35 Correct 1603 ms 7956 KB Output is correct
36 Correct 1371 ms 6812 KB Output is correct
37 Correct 1511 ms 8580 KB Output is correct
38 Correct 1495 ms 6640 KB Output is correct
39 Correct 1587 ms 7760 KB Output is correct
40 Correct 1591 ms 7448 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4440 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 2 ms 4696 KB Output is correct
11 Correct 104 ms 14844 KB Output is correct
12 Correct 102 ms 14844 KB Output is correct
13 Correct 119 ms 14752 KB Output is correct
14 Correct 128 ms 14844 KB Output is correct
15 Correct 105 ms 14848 KB Output is correct
16 Correct 131 ms 14848 KB Output is correct
17 Correct 129 ms 14844 KB Output is correct
18 Correct 99 ms 14848 KB Output is correct
19 Correct 102 ms 14848 KB Output is correct
20 Correct 107 ms 14844 KB Output is correct
21 Correct 119 ms 14848 KB Output is correct
22 Correct 131 ms 14848 KB Output is correct
23 Correct 111 ms 14844 KB Output is correct
24 Correct 139 ms 14844 KB Output is correct
25 Correct 120 ms 15100 KB Output is correct
26 Correct 95 ms 14848 KB Output is correct
27 Correct 101 ms 14844 KB Output is correct
28 Correct 103 ms 14844 KB Output is correct
29 Correct 114 ms 14848 KB Output is correct
30 Correct 133 ms 14848 KB Output is correct
31 Correct 106 ms 14844 KB Output is correct
32 Correct 127 ms 14848 KB Output is correct
33 Correct 119 ms 14844 KB Output is correct
34 Correct 98 ms 14848 KB Output is correct
35 Correct 114 ms 14848 KB Output is correct
36 Correct 114 ms 14848 KB Output is correct
37 Correct 119 ms 15100 KB Output is correct
38 Correct 120 ms 14852 KB Output is correct
39 Correct 116 ms 14848 KB Output is correct
40 Correct 113 ms 14844 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4440 KB Output is correct
3 Correct 3 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 3 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 2 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 2 ms 4696 KB Output is correct
11 Correct 1452 ms 8576 KB Output is correct
12 Correct 1452 ms 8316 KB Output is correct
13 Correct 1507 ms 7516 KB Output is correct
14 Correct 1518 ms 7764 KB Output is correct
15 Correct 1472 ms 8728 KB Output is correct
16 Correct 1578 ms 7968 KB Output is correct
17 Correct 1519 ms 7660 KB Output is correct
18 Correct 1414 ms 9548 KB Output is correct
19 Correct 1496 ms 6480 KB Output is correct
20 Correct 1432 ms 8256 KB Output is correct
21 Correct 1481 ms 8712 KB Output is correct
22 Correct 1510 ms 8820 KB Output is correct
23 Correct 1574 ms 7768 KB Output is correct
24 Correct 1601 ms 7596 KB Output is correct
25 Correct 1504 ms 9424 KB Output is correct
26 Correct 1622 ms 7956 KB Output is correct
27 Correct 1600 ms 7892 KB Output is correct
28 Correct 1350 ms 10528 KB Output is correct
29 Correct 1464 ms 6656 KB Output is correct
30 Correct 1523 ms 8788 KB Output is correct
31 Correct 1574 ms 8432 KB Output is correct
32 Correct 1619 ms 8680 KB Output is correct
33 Correct 1516 ms 7732 KB Output is correct
34 Correct 1598 ms 7600 KB Output is correct
35 Correct 1603 ms 7956 KB Output is correct
36 Correct 1371 ms 6812 KB Output is correct
37 Correct 1511 ms 8580 KB Output is correct
38 Correct 1495 ms 6640 KB Output is correct
39 Correct 1587 ms 7760 KB Output is correct
40 Correct 1591 ms 7448 KB Output is correct
41 Correct 104 ms 14844 KB Output is correct
42 Correct 102 ms 14844 KB Output is correct
43 Correct 119 ms 14752 KB Output is correct
44 Correct 128 ms 14844 KB Output is correct
45 Correct 105 ms 14848 KB Output is correct
46 Correct 131 ms 14848 KB Output is correct
47 Correct 129 ms 14844 KB Output is correct
48 Correct 99 ms 14848 KB Output is correct
49 Correct 102 ms 14848 KB Output is correct
50 Correct 107 ms 14844 KB Output is correct
51 Correct 119 ms 14848 KB Output is correct
52 Correct 131 ms 14848 KB Output is correct
53 Correct 111 ms 14844 KB Output is correct
54 Correct 139 ms 14844 KB Output is correct
55 Correct 120 ms 15100 KB Output is correct
56 Correct 95 ms 14848 KB Output is correct
57 Correct 101 ms 14844 KB Output is correct
58 Correct 103 ms 14844 KB Output is correct
59 Correct 114 ms 14848 KB Output is correct
60 Correct 133 ms 14848 KB Output is correct
61 Correct 106 ms 14844 KB Output is correct
62 Correct 127 ms 14848 KB Output is correct
63 Correct 119 ms 14844 KB Output is correct
64 Correct 98 ms 14848 KB Output is correct
65 Correct 114 ms 14848 KB Output is correct
66 Correct 114 ms 14848 KB Output is correct
67 Correct 119 ms 15100 KB Output is correct
68 Correct 120 ms 14852 KB Output is correct
69 Correct 116 ms 14848 KB Output is correct
70 Correct 113 ms 14844 KB Output is correct
71 Correct 1660 ms 19012 KB Output is correct
72 Correct 1659 ms 19300 KB Output is correct
73 Correct 1863 ms 17696 KB Output is correct
74 Execution timed out 2025 ms 17728 KB Time limit exceeded
75 Halted 0 ms 0 KB -