oj.uz

답안 #245597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245597 2020-07-07T00:05:44 Z thecodingwizard Swap (BOI16_swap) C++11
0 / 100
 140 ms 262148 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 200000;

int n, A[maxn+10];
vector<int> memo[maxn+10][60];
int pa[maxn+10][60];

vector<int> merge(int root, vector<int> &L, vector<int> &R) {
    vector<int> res;
    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;
    }
    return res;
}

vector<int> &dp(int u, int par) {
    if (memo[u][par].size() > 0) return memo[u][par];
    int cur = pa[u][par];
    int l = u*2, r = u*2+1;
    if (l > n && r > n) {
        memo[u][par].push_back(cur);
        return memo[u][par];
    } else if (r > n) {
        if (A[l] < cur) {
            memo[u][par].push_back(A[l]);
            memo[u][par].push_back(cur);
        } else {
            memo[u][par].push_back(cur);
            memo[u][par].push_back(A[l]);
        }
        return memo[u][par];
    }

    int L = A[l], R = A[r];
    // no swap
    if (cur < L && cur < R) {
        return memo[u][par] = merge(cur, dp(l, 0), dp(r, 0));
    }

    // swap left
    if (cur > L && L < R) {
        return memo[u][par] = merge(L, dp(l, par+2), dp(r, 0));
    }

    // swap right
    // swap both
    if (R < cur && R < L) {
        vector<int> swapRight = merge(R, dp(l, 0), dp(r, par+2));
        vector<int> swapBoth = merge(R, dp(l, par+2), dp(r, 3));
        return memo[u][par] = min(swapRight, swapBoth);
    }
}

int main() {
    cin >> n; for (int i = 1; i <= n; i++) cin >> A[i];
    for (int i = 1; i <= n; i++) {
        int x = i;
        int ctr = 0;
        while (x) {
            pa[i][ctr*2] = A[x];
            if (x*2 <= n) pa[i][ctr*2+1] = A[x*2];
            x /= 2;
            ctr++;
        }
    }
    vector<int> ans = dp(1, 0);
    for (int v : ans) cout << v << " ";
    cout << endl;
    return 0;
}

Compilation message

swap.cpp: In function 'std::vector<int> merge(int, std::vector<int>&, std::vector<int>&)':
swap.cpp:16:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (lidx < L.size() || ridx < R.size()) {
            ~~~~~^~~~~~~~~~
swap.cpp:16:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (lidx < L.size() || ridx < R.size()) {
                               ~~~~~^~~~~~~~~~
swap.cpp:18:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (lidx < L.size()) res.push_back(L[lidx++]);
                 ~~~~~^~~~~~~~~~
swap.cpp:21:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (ridx < R.size()) res.push_back(R[ridx++]);
                 ~~~~~^~~~~~~~~~
swap.cpp: In function 'std::vector<int>& dp(int, int)':
swap.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 140 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 140 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 140 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 140 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 140 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -