oj.uz

Submission #943781

# Submission time Handle Problem Language Result Execution time Memory
943781 2024-03-11T21:56:51 Z guechotjrhh Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 25964 KB 
#include<iostream>
#include<string>
using namespace std;

#include<map>
#include<string>
#include<algorithm>
#include<vector>
#define maxp 1048580
using namespace std;
#define all(x) x.begin(),x.end()
string str;
int n,p;
int zer[maxp], on[maxp];
//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)];
		}
	}
}
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()) {
		res += x*zer[c];
		return;
	}

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

	rec0(z, i + 1, c, x);
	rec0(z, i + 1, c + z[i], -x);
}
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, 1);
		/*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, 1);
		/*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:40:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  if (i == z.size()) {
      |      ~~^~~~~~~~~~~
snake_escaping.cpp: In function 'void recq(std::vector<int>&, int, int)':
snake_escaping.cpp:49:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |  if (i == q.size()) { res += str[c] - '0'; return; }
      |      ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 3 ms 2392 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 3 ms 2396 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 3 ms 2392 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 3 ms 2396 KB Output is correct
11 Correct 1460 ms 11936 KB Output is correct
12 Correct 1474 ms 11996 KB Output is correct
13 Correct 1507 ms 10912 KB Output is correct
14 Correct 1527 ms 11124 KB Output is correct
15 Correct 1467 ms 12052 KB Output is correct
16 Correct 1518 ms 11296 KB Output is correct
17 Correct 1546 ms 11504 KB Output is correct
18 Correct 1384 ms 12972 KB Output is correct
19 Correct 1472 ms 9952 KB Output is correct
20 Correct 1455 ms 11748 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 3 ms 2392 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 3 ms 2396 KB Output is correct
11 Correct 1460 ms 11936 KB Output is correct
12 Correct 1474 ms 11996 KB Output is correct
13 Correct 1507 ms 10912 KB Output is correct
14 Correct 1527 ms 11124 KB Output is correct
15 Correct 1467 ms 12052 KB Output is correct
16 Correct 1518 ms 11296 KB Output is correct
17 Correct 1546 ms 11504 KB Output is correct
18 Correct 1384 ms 12972 KB Output is correct
19 Correct 1472 ms 9952 KB Output is correct
20 Correct 1455 ms 11748 KB Output is correct
21 Correct 1521 ms 13892 KB Output is correct
22 Correct 1484 ms 13884 KB Output is correct
23 Correct 1601 ms 13196 KB Output is correct
24 Correct 1650 ms 12700 KB Output is correct
25 Correct 1548 ms 14536 KB Output is correct
26 Correct 1631 ms 13652 KB Output is correct
27 Correct 1660 ms 13080 KB Output is correct
28 Correct 1464 ms 15848 KB Output is correct
29 Correct 1482 ms 11700 KB Output is correct
30 Correct 1505 ms 13688 KB Output is correct
31 Correct 1596 ms 13488 KB Output is correct
32 Correct 1728 ms 13692 KB Output is correct
33 Correct 1506 ms 12540 KB Output is correct
34 Correct 1614 ms 12696 KB Output is correct
35 Correct 1607 ms 13024 KB Output is correct
36 Correct 1369 ms 11900 KB Output is correct
37 Correct 1476 ms 13716 KB Output is correct
38 Correct 1516 ms 11684 KB Output is correct
39 Correct 1583 ms 12844 KB Output is correct
40 Correct 1623 ms 12856 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 3 ms 2392 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 3 ms 2396 KB Output is correct
11 Correct 104 ms 11888 KB Output is correct
12 Correct 101 ms 12032 KB Output is correct
13 Correct 121 ms 12032 KB Output is correct
14 Correct 128 ms 12032 KB Output is correct
15 Correct 104 ms 12028 KB Output is correct
16 Correct 126 ms 12028 KB Output is correct
17 Correct 138 ms 12224 KB Output is correct
18 Correct 91 ms 12032 KB Output is correct
19 Correct 101 ms 12028 KB Output is correct
20 Correct 105 ms 12028 KB Output is correct
21 Correct 111 ms 12032 KB Output is correct
22 Correct 120 ms 12032 KB Output is correct
23 Correct 105 ms 12028 KB Output is correct
24 Correct 146 ms 12100 KB Output is correct
25 Correct 119 ms 12028 KB Output is correct
26 Correct 91 ms 12032 KB Output is correct
27 Correct 101 ms 12032 KB Output is correct
28 Correct 104 ms 12028 KB Output is correct
29 Correct 109 ms 12032 KB Output is correct
30 Correct 118 ms 12100 KB Output is correct
31 Correct 122 ms 12028 KB Output is correct
32 Correct 120 ms 12028 KB Output is correct
33 Correct 119 ms 12028 KB Output is correct
34 Correct 90 ms 12092 KB Output is correct
35 Correct 113 ms 12028 KB Output is correct
36 Correct 113 ms 12032 KB Output is correct
37 Correct 116 ms 12096 KB Output is correct
38 Correct 139 ms 12116 KB Output is correct
39 Correct 111 ms 12032 KB Output is correct
40 Correct 111 ms 12028 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 3 ms 2392 KB Output is correct
7 Correct 2 ms 2648 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 3 ms 2396 KB Output is correct
11 Correct 1460 ms 11936 KB Output is correct
12 Correct 1474 ms 11996 KB Output is correct
13 Correct 1507 ms 10912 KB Output is correct
14 Correct 1527 ms 11124 KB Output is correct
15 Correct 1467 ms 12052 KB Output is correct
16 Correct 1518 ms 11296 KB Output is correct
17 Correct 1546 ms 11504 KB Output is correct
18 Correct 1384 ms 12972 KB Output is correct
19 Correct 1472 ms 9952 KB Output is correct
20 Correct 1455 ms 11748 KB Output is correct
21 Correct 1521 ms 13892 KB Output is correct
22 Correct 1484 ms 13884 KB Output is correct
23 Correct 1601 ms 13196 KB Output is correct
24 Correct 1650 ms 12700 KB Output is correct
25 Correct 1548 ms 14536 KB Output is correct
26 Correct 1631 ms 13652 KB Output is correct
27 Correct 1660 ms 13080 KB Output is correct
28 Correct 1464 ms 15848 KB Output is correct
29 Correct 1482 ms 11700 KB Output is correct
30 Correct 1505 ms 13688 KB Output is correct
31 Correct 1596 ms 13488 KB Output is correct
32 Correct 1728 ms 13692 KB Output is correct
33 Correct 1506 ms 12540 KB Output is correct
34 Correct 1614 ms 12696 KB Output is correct
35 Correct 1607 ms 13024 KB Output is correct
36 Correct 1369 ms 11900 KB Output is correct
37 Correct 1476 ms 13716 KB Output is correct
38 Correct 1516 ms 11684 KB Output is correct
39 Correct 1583 ms 12844 KB Output is correct
40 Correct 1623 ms 12856 KB Output is correct
41 Correct 104 ms 11888 KB Output is correct
42 Correct 101 ms 12032 KB Output is correct
43 Correct 121 ms 12032 KB Output is correct
44 Correct 128 ms 12032 KB Output is correct
45 Correct 104 ms 12028 KB Output is correct
46 Correct 126 ms 12028 KB Output is correct
47 Correct 138 ms 12224 KB Output is correct
48 Correct 91 ms 12032 KB Output is correct
49 Correct 101 ms 12028 KB Output is correct
50 Correct 105 ms 12028 KB Output is correct
51 Correct 111 ms 12032 KB Output is correct
52 Correct 120 ms 12032 KB Output is correct
53 Correct 105 ms 12028 KB Output is correct
54 Correct 146 ms 12100 KB Output is correct
55 Correct 119 ms 12028 KB Output is correct
56 Correct 91 ms 12032 KB Output is correct
57 Correct 101 ms 12032 KB Output is correct
58 Correct 104 ms 12028 KB Output is correct
59 Correct 109 ms 12032 KB Output is correct
60 Correct 118 ms 12100 KB Output is correct
61 Correct 122 ms 12028 KB Output is correct
62 Correct 120 ms 12028 KB Output is correct
63 Correct 119 ms 12028 KB Output is correct
64 Correct 90 ms 12092 KB Output is correct
65 Correct 113 ms 12028 KB Output is correct
66 Correct 113 ms 12032 KB Output is correct
67 Correct 116 ms 12096 KB Output is correct
68 Correct 139 ms 12116 KB Output is correct
69 Correct 111 ms 12032 KB Output is correct
70 Correct 111 ms 12028 KB Output is correct
71 Correct 1673 ms 25864 KB Output is correct
72 Correct 1753 ms 25964 KB Output is correct
73 Correct 1924 ms 24664 KB Output is correct
74 Execution timed out 2044 ms 24912 KB Time limit exceeded
75 Halted 0 ms 0 KB -