oj.uz

Submission #245602

# Submission time Handle Problem Language Result Execution time Memory
245602 2020-07-07T00:32:16 Z thecodingwizard Swap (BOI16_swap) C++11
48 / 100
 506 ms 262148 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 200000;

int n, A[maxn+10];
vector<int> dp[maxn+10][36];

void merge(vector<int> &res, int root, vector<int> &L, vector<int> &R) {
    res.push_back(root);
    int lidx = 0, ridx = 0;
    int cur = 1;
    while (lidx < L.size() || ridx < R.size()) {
        for (int i = 0; i < cur; i++) {
            if (lidx < L.size()) res.push_back(L[lidx++]);
        }
        for (int i = 0; i < cur; i++) {
            if (ridx < R.size()) res.push_back(R[ridx++]);
        }
        cur *= 2;
    }
}

int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n; for (int i = 1; i <= n; i++) cin >> A[i];
    for (int i = n; i; i--) {
        for (int j = 0; j < 36; j++) {
            int idx = i, p = j;
            while (p >= 2) {
                p -= 2;
                idx /= 2;
            }
            if (p == 1) idx *= 2;
            int cur = A[idx];

            int l = i*2, r = i*2+1;
            if (l > n && r > n) {
                dp[i][j].push_back(cur);
                continue;
            } else if (r > n) {
                if (A[l] < cur) {
                    dp[i][j].push_back(A[l]);
                    dp[i][j].push_back(cur);
                } else {
                    dp[i][j].push_back(cur);
                    dp[i][j].push_back(A[l]);
                }
                continue;
            }

            int L = A[l], R = A[r];
            // no swap
            if (cur < L && cur < R) {
                merge(dp[i][j], cur, dp[l][0], dp[r][0]);
                continue;
            }

            // swap left
            if (cur > L && L < R) {
                merge(dp[i][j], L, dp[l][j+2], dp[r][0]);
                continue;
            }

            if (R < cur && R < L) {
                // swap right
                merge(dp[i][j], R, dp[l][0], dp[r][j+2]);
                vector<int> tmp;
                // swap both
                merge(tmp, R, dp[l][j+2], dp[r][3]);
                if (tmp < dp[i][j]) {
                    dp[i][j] = tmp;
                }
            }
        }
    }
    for (int v : dp[1][0]) cout << v << " ";
    cout << "\n";
    return 0;
}

Compilation message

swap.cpp: In function 'void merge(std::vector<int>&, int, std::vector<int>&, std::vector<int>&)':
swap.cpp:14:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (lidx < L.size() || ridx < R.size()) {
            ~~~~~^~~~~~~~~~
swap.cpp:14:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (lidx < L.size() || ridx < R.size()) {
                               ~~~~~^~~~~~~~~~
swap.cpp:16:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (lidx < L.size()) res.push_back(L[lidx++]);
                 ~~~~~^~~~~~~~~~
swap.cpp:19:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (ridx < R.size()) res.push_back(R[ridx++]);
                 ~~~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 169448 KB Output is correct
2 Correct 101 ms 169464 KB Output is correct
3 Correct 103 ms 169464 KB Output is correct
4 Correct 100 ms 169380 KB Output is correct
5 Correct 108 ms 169592 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 169448 KB Output is correct
2 Correct 101 ms 169464 KB Output is correct
3 Correct 103 ms 169464 KB Output is correct
4 Correct 100 ms 169380 KB Output is correct
5 Correct 108 ms 169592 KB Output is correct
6 Correct 115 ms 169464 KB Output is correct
7 Correct 116 ms 169472 KB Output is correct
8 Correct 116 ms 169464 KB Output is correct
9 Correct 118 ms 169464 KB Output is correct
10 Correct 107 ms 169592 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 169448 KB Output is correct
2 Correct 101 ms 169464 KB Output is correct
3 Correct 103 ms 169464 KB Output is correct
4 Correct 100 ms 169380 KB Output is correct
5 Correct 108 ms 169592 KB Output is correct
6 Correct 115 ms 169464 KB Output is correct
7 Correct 116 ms 169472 KB Output is correct
8 Correct 116 ms 169464 KB Output is correct
9 Correct 118 ms 169464 KB Output is correct
10 Correct 107 ms 169592 KB Output is correct
11 Correct 135 ms 171548 KB Output is correct
12 Correct 110 ms 171512 KB Output is correct
13 Correct 111 ms 171648 KB Output is correct
14 Correct 108 ms 171616 KB Output is correct
15 Correct 122 ms 171640 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 169448 KB Output is correct
2 Correct 101 ms 169464 KB Output is correct
3 Correct 103 ms 169464 KB Output is correct
4 Correct 100 ms 169380 KB Output is correct
5 Correct 108 ms 169592 KB Output is correct
6 Correct 115 ms 169464 KB Output is correct
7 Correct 116 ms 169472 KB Output is correct
8 Correct 116 ms 169464 KB Output is correct
9 Correct 118 ms 169464 KB Output is correct
10 Correct 107 ms 169592 KB Output is correct
11 Correct 135 ms 171548 KB Output is correct
12 Correct 110 ms 171512 KB Output is correct
13 Correct 111 ms 171648 KB Output is correct
14 Correct 108 ms 171616 KB Output is correct
15 Correct 122 ms 171640 KB Output is correct
16 Runtime error 506 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
17 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 169448 KB Output is correct
2 Correct 101 ms 169464 KB Output is correct
3 Correct 103 ms 169464 KB Output is correct
4 Correct 100 ms 169380 KB Output is correct
5 Correct 108 ms 169592 KB Output is correct
6 Correct 115 ms 169464 KB Output is correct
7 Correct 116 ms 169472 KB Output is correct
8 Correct 116 ms 169464 KB Output is correct
9 Correct 118 ms 169464 KB Output is correct
10 Correct 107 ms 169592 KB Output is correct
11 Correct 135 ms 171548 KB Output is correct
12 Correct 110 ms 171512 KB Output is correct
13 Correct 111 ms 171648 KB Output is correct
14 Correct 108 ms 171616 KB Output is correct
15 Correct 122 ms 171640 KB Output is correct
16 Runtime error 506 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
17 Halted 0 ms 0 KB -