oj.uz

Submission #590276

# Submission time Handle Problem Language Result Execution time Memory
590276 2022-07-05T17:52:48 Z blue Snake Escaping (JOI18_snake_escaping) C++17
58 / 100
 2000 ms 19104 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

using vi = vector<int>;
#define sz(x) int(x.size())

int main()
{
	int L, Q;
	cin >> L >> Q;

	vi A((1<<L));
	for(int i = 0; i < (1<<L); i++)
	{
		char c;
		cin >> c;
		A[i] = c - '0';
	}

	vi lowersum = A;
	vi uppersum = A;

	for(int b = 0; b < L; b++)
	{
		for(int i = 0; i < (1<<L); i++)
		{
			if(i & (1<<b))
				lowersum[i] += lowersum[i ^ (1<<b)];
			else
				uppersum[i] += uppersum[i ^ (1<<b)];
		}
	}

	vi getbit((1<<L));
	for(int i = 0; i < L; i++)
		getbit[(1<<i)] = i;

	for(int j = 0; j < Q; j++)
	{
		vi p0, p1, pq;

		int onemask = 0;
		int qmask = 0;

		for(int b = L-1; b >= 0; b--)
		{
			char c;
			cin >> c;

			if(c == '0')
				p0.push_back(b);
			else if(c == '1')
			{
				p1.push_back(b);
				onemask += (1<<b);
			}
			else
			{
				pq.push_back(b);
				qmask += (1<<b);
			}
		}

		int res = 0;


		if(sz(p1) <= 10)
		{
			// cerr << "p1 size = " << sz(p1) << '\n';
			vi ssum((1 << sz(p1)), 0);
			vi sign((1 << sz(p1)), +1);

			if(sz(p1) % 2 == 0)
				sign[0] = +1;
			else
				sign[0] = -1;

			for(int m = 1; m < (1<<sz(p1)); m++)
			{
				ssum[m] = ssum[m - (m&-m)] + (1 << p1[getbit[m&-m]]);
				sign[m] = -1 * sign[m - (m&-m)];
			}

			for(int m = 0; m < (1<<sz(p1)); m++)
			{
				// cerr << "m = " << m << '\n';
				// cerr << "sign = " << sign[m] << '\n';
				res += lowersum[qmask | ssum[m]] * sign[m];
			}
		}
		else if(sz(pq) <= 10)
		{
			vi ssum((1 << sz(pq)), 0);
			for(int m = 1; m < (1<<sz(pq)); m++)
				ssum[m] = ssum[m - (m&-m)] + (1 << pq[getbit[m&-m]]);

			for(int m = 0; m < (1<<sz(pq)); m++)
				res += A[onemask | ssum[m]];
		}

		// cerr << test << ' ' << mask << '\n';

		cout << res << '\n';
	}
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 10.0

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

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 3 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 3 ms 212 KB Output is correct
7 Correct 4 ms 320 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 527 ms 17000 KB Output is correct
12 Correct 268 ms 16988 KB Output is correct
13 Correct 257 ms 18964 KB Output is correct
14 Correct 269 ms 18960 KB Output is correct
15 Correct 256 ms 19076 KB Output is correct
16 Correct 321 ms 18912 KB Output is correct
17 Correct 296 ms 18988 KB Output is correct
18 Correct 215 ms 19104 KB Output is correct
19 Correct 533 ms 18764 KB Output is correct
20 Correct 372 ms 18976 KB Output is correct
21 Correct 282 ms 18988 KB Output is correct
22 Correct 289 ms 18944 KB Output is correct
23 Correct 268 ms 18920 KB Output is correct
24 Correct 337 ms 18952 KB Output is correct
25 Correct 297 ms 18984 KB Output is correct
26 Correct 225 ms 18864 KB Output is correct
27 Correct 250 ms 18908 KB Output is correct
28 Correct 315 ms 18868 KB Output is correct
29 Correct 526 ms 19032 KB Output is correct
30 Correct 331 ms 18976 KB Output is correct
31 Correct 241 ms 18944 KB Output is correct
32 Correct 264 ms 18948 KB Output is correct
33 Correct 298 ms 18976 KB Output is correct
34 Correct 223 ms 18864 KB Output is correct
35 Correct 315 ms 18920 KB Output is correct
36 Correct 318 ms 18904 KB Output is correct
37 Correct 311 ms 19096 KB Output is correct
38 Correct 314 ms 18960 KB Output is correct
39 Correct 308 ms 19008 KB Output is correct
40 Correct 327 ms 18984 KB Output is correct

Subtask #5
0 / 25.0

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