제출 #322181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
322181		dolphingarlic	Swap (BOI16_swap)	C++14	48 / 100	235 ms	262144 KiB

swap

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int n, a[1 << 18];
vector<int> dp[1 << 18][18][2];

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

void dfs(int node = 1, int level = 1) {
    if (node * 2 > n) {
        for (int i = 0; i < level; i++) for (int j : {0, 1}) {
            if (!(((node >> i + 1) << 1) + j)) continue;
            dp[node][i][j] = {a[((node >> i + 1) << 1) + j]};
        }
    } else {
        dfs(node * 2, level + 1), dfs(node * 2 + 1, level + 1);
        for (int i = 0; i < level; i++) for (int j : {0, 1}) {
            if (!(((node >> i + 1) << 1) + j)) continue;
            int val = a[((node >> i + 1) << 1) + j];

            int mn = min({val, a[2 * node], a[2 * node + 1]});
            if (mn == val) {
                dp[node][i][j] = merge(val, dp[2 * node][0][0], dp[2 * node + 1][0][1]);
            } else if (mn == a[2 * node]) {
                dp[node][i][j] = merge(a[2 * node], dp[2 * node][i + 1][j], dp[2 * node + 1][0][1]);
            } else {
                dp[node][i][j] = min(
                    merge(a[2 * node + 1], dp[2 * node][0][0], dp[2 * node + 1][i + 1][j]),
                    merge(a[2 * node + 1], dp[2 * node][i + 1][j], dp[2 * node + 1][0][0])
                );
            }
        }
    }
}

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", a + i);
    int orig = n;
    while (__builtin_popcount(n + 1) != 1) a[++n] = n;
    dfs();
    for (int i = 0; i < orig; i++) printf("%d ", dp[1][0][1][i]);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

swap.cpp: In function 'std::vector<int> merge(int, std::vector<int>&, std::vector<int>&)':
swap.cpp:10:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (int i = 0, j = 1; i < l.size(); i += j, j <<= 1) {
      |                            ~~^~~~~~~~~~
swap.cpp: In function 'void dfs(int, int)':
swap.cpp:20:31: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   20 |             if (!(((node >> i + 1) << 1) + j)) continue;
      |                             ~~^~~
swap.cpp:21:45: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |             dp[node][i][j] = {a[((node >> i + 1) << 1) + j]};
      |                                           ~~^~~
swap.cpp:26:31: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |             if (!(((node >> i + 1) << 1) + j)) continue;
      |                             ~~^~~
swap.cpp:27:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |             int val = a[((node >> i + 1) << 1) + j];
      |                                   ~~^~~
swap.cpp: In function 'int main()':
swap.cpp:48:46: warning: operation on 'n' may be undefined [-Wsequence-point]
   48 |     while (__builtin_popcount(n + 1) != 1) a[++n] = n;
      |                                              ^~~
swap.cpp:48:46: warning: operation on 'n' may be undefined [-Wsequence-point]
swap.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   45 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
swap.cpp:46:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |     for (int i = 1; i <= n; i++) scanf("%d", a + i);
      |                                  ~~~~~^~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 27 / 27
• Subtask 4: 0 / 20
• Subtask 5: 0 / 32