Submission #943284

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
943284	2024-03-11T10:02:10 Z	guechotjrhh	Snake Escaping (JOI18_snake_escaping)	C++14	5 / 100	2000 ms	14980 KB

snake_escaping

#include<iostream>
#include<string>
using namespace std;


string str;
int n;
void init(int N, int Q, string S) {
	n = N;
	str = S;
}
int query(string A) {
	int ones = 0, zeros = 0;
	for (int i = 0; i < n; i++) {
		if (A[n-1-i] == '1') {
			ones += (1 << i);
		}
		if (A[n-1-i] == '0') {
			zeros += (1 << i);
		}
	}
	int res = 0;
	for (int i = 0; i < (1 << n); i++) {
		if (i & zeros) continue;
		if ((~i) & ones) continue;
		res += str[i] - '0';
	}
	return res;
}

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

Subtask #1

5.0 / 5.0

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

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	3 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Execution timed out	2012 ms	14980 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #3

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	3 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Execution timed out	2012 ms	14980 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	3 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Execution timed out	2031 ms	3776 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	3 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Execution timed out	2012 ms	14980 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-