oj.uz

Submission #1108258

# Submission time Handle Problem Language Result Execution time Memory
1108258 2024-11-03T14:14:00 Z lighton Swap (BOI16_swap) C++17
100 / 100
 496 ms 233304 KB 
#include <bits/stdc++.h>
using namespace std;

int a[200002];
bool needed[200002][18][2];
vector<int> dp[200002][18][2], tmp1, tmp2;

void merge(vector<int> &ret, vector<int> &l, vector<int> &r) {
	for (int i = 0, j = 1; i < l.size(); i += j, j <<= 1) {
		for (int k = i; k < i + j && k < l.size(); k++) ret.push_back(l[k]);
		for (int k = i; k < i + j && k < r.size(); k++) ret.push_back(r[k]);
	}
}

int main() {
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", a + i);

	needed[1][0][1] = 1;
	for (int node = 1; node <= n / 2; node++) {
		for (int i = 0; node >> i; i++)
			for (int j : {0, 1}) {
				if (!needed[node][i][j]) continue;

				int mn =
				    min({a[((node >> i + 1) << 1) + j], a[2 * node], a[2 * node + 1]});
				if (mn == a[((node >> i + 1) << 1) + j]) {
					needed[2 * node][0][0] = needed[2 * node + 1][0][1] = 1;
				} else if (mn == a[2 * node]) {
					needed[2 * node][i + 1][j] = needed[2 * node + 1][0][1] = 1;
				} else {
					needed[2 * node][0][0] = needed[2 * node][i + 1][j] = 1;
					needed[2 * node + 1][0][0] = needed[2 * node + 1][i + 1][j] = 1;
				}
			}
	}

	for (int node = n; node; node--) {
		for (int i = 0; node >> i; i++)
			for (int j : {0, 1}) {
				if (!needed[node][i][j]) continue;

				int p = ((node >> i + 1) << 1) + j;
				if (2 * node > n) dp[node][i][j] = {a[p]};
				else if (2 * node == n) {
					dp[node][i][j] = {min(a[p], a[2 * node]), max(a[p], a[2 * node])};
				} else {
					if (a[2 * node + 1] < min(a[p], a[2 * node])) {
						tmp1 = tmp2 = {a[2 * node + 1]};
						merge(tmp1, dp[2 * node][0][0], dp[2 * node + 1][i + 1][j]);
						merge(tmp2, dp[2 * node][i + 1][j], dp[2 * node + 1][0][0]);
						dp[node][i][j] = min(tmp1, tmp2);
					} else {
						dp[node][i][j] = {min(a[p], a[2 * node])};
						if (a[p] < a[2 * node]) {
							merge(dp[node][i][j], dp[2 * node][0][0],
							      dp[2 * node + 1][0][1]);
						} else {
							merge(dp[node][i][j], dp[2 * node][i + 1][j],
							      dp[2 * node + 1][0][1]);
						}
					}
				}
			}
		if (2 * node < n) {
			for (int i = 0; 2 * node >> i; i++)
				for (int j : {0, 1}) {
					vector<int>().swap(dp[2 * node][i][j]);
					vector<int>().swap(dp[2 * node + 1][i][j]);
				}
		}
	}

	for (int i : dp[1][0][1]) printf("%d ", i);
	return 0;
}

Compilation message

swap.cpp: In function 'void merge(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
swap.cpp:9:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for (int i = 0, j = 1; i < l.size(); i += j, j <<= 1) {
      |                         ~~^~~~~~~~~~
swap.cpp:10:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |   for (int k = i; k < i + j && k < l.size(); k++) ret.push_back(l[k]);
      |                                ~~^~~~~~~~~~
swap.cpp:11:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |   for (int k = i; k < i + j && k < r.size(); k++) ret.push_back(r[k]);
      |                                ~~^~~~~~~~~~
swap.cpp: In function 'int main()':
swap.cpp:27:28: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |         min({a[((node >> i + 1) << 1) + j], a[2 * node], a[2 * node + 1]});
      |                          ~~^~~
swap.cpp:28:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   28 |     if (mn == a[((node >> i + 1) << 1) + j]) {
      |                           ~~^~~
swap.cpp:44:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |     int p = ((node >> i + 1) << 1) + j;
      |                       ~~^~~
swap.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
swap.cpp:18:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |  for (int i = 1; i <= n; i++) scanf("%d", a + i);
      |                               ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 172880 KB Output is correct
2 Correct 29 ms 172836 KB Output is correct
3 Correct 30 ms 172872 KB Output is correct
4 Correct 35 ms 172872 KB Output is correct
5 Correct 29 ms 170832 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 172880 KB Output is correct
2 Correct 29 ms 172836 KB Output is correct
3 Correct 30 ms 172872 KB Output is correct
4 Correct 35 ms 172872 KB Output is correct
5 Correct 29 ms 170832 KB Output is correct
6 Correct 30 ms 169296 KB Output is correct
7 Correct 31 ms 169432 KB Output is correct
8 Correct 33 ms 169560 KB Output is correct
9 Correct 33 ms 169296 KB Output is correct
10 Correct 32 ms 169296 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 172880 KB Output is correct
2 Correct 29 ms 172836 KB Output is correct
3 Correct 30 ms 172872 KB Output is correct
4 Correct 35 ms 172872 KB Output is correct
5 Correct 29 ms 170832 KB Output is correct
6 Correct 30 ms 169296 KB Output is correct
7 Correct 31 ms 169432 KB Output is correct
8 Correct 33 ms 169560 KB Output is correct
9 Correct 33 ms 169296 KB Output is correct
10 Correct 32 ms 169296 KB Output is correct
11 Correct 32 ms 169552 KB Output is correct
12 Correct 41 ms 169544 KB Output is correct
13 Correct 40 ms 169552 KB Output is correct
14 Correct 50 ms 169544 KB Output is correct
15 Correct 48 ms 169556 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 172880 KB Output is correct
2 Correct 29 ms 172836 KB Output is correct
3 Correct 30 ms 172872 KB Output is correct
4 Correct 35 ms 172872 KB Output is correct
5 Correct 29 ms 170832 KB Output is correct
6 Correct 30 ms 169296 KB Output is correct
7 Correct 31 ms 169432 KB Output is correct
8 Correct 33 ms 169560 KB Output is correct
9 Correct 33 ms 169296 KB Output is correct
10 Correct 32 ms 169296 KB Output is correct
11 Correct 32 ms 169552 KB Output is correct
12 Correct 41 ms 169544 KB Output is correct
13 Correct 40 ms 169552 KB Output is correct
14 Correct 50 ms 169544 KB Output is correct
15 Correct 48 ms 169556 KB Output is correct
16 Correct 92 ms 175688 KB Output is correct
17 Correct 95 ms 173760 KB Output is correct
18 Correct 86 ms 174228 KB Output is correct
19 Correct 127 ms 183624 KB Output is correct
20 Correct 131 ms 183368 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 172880 KB Output is correct
2 Correct 29 ms 172836 KB Output is correct
3 Correct 30 ms 172872 KB Output is correct
4 Correct 35 ms 172872 KB Output is correct
5 Correct 29 ms 170832 KB Output is correct
6 Correct 30 ms 169296 KB Output is correct
7 Correct 31 ms 169432 KB Output is correct
8 Correct 33 ms 169560 KB Output is correct
9 Correct 33 ms 169296 KB Output is correct
10 Correct 32 ms 169296 KB Output is correct
11 Correct 32 ms 169552 KB Output is correct
12 Correct 41 ms 169544 KB Output is correct
13 Correct 40 ms 169552 KB Output is correct
14 Correct 50 ms 169544 KB Output is correct
15 Correct 48 ms 169556 KB Output is correct
16 Correct 92 ms 175688 KB Output is correct
17 Correct 95 ms 173760 KB Output is correct
18 Correct 86 ms 174228 KB Output is correct
19 Correct 127 ms 183624 KB Output is correct
20 Correct 131 ms 183368 KB Output is correct
21 Correct 219 ms 187700 KB Output is correct
22 Correct 208 ms 186948 KB Output is correct
23 Correct 268 ms 186984 KB Output is correct
24 Correct 496 ms 232520 KB Output is correct
25 Correct 495 ms 233304 KB Output is correct