oj.uz

답안 #322232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
322232 2020-11-14T10:06:03 Z dolphingarlic Swap (BOI16_swap) C++14
68 / 100
 426 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;

int a[200002];
vector<int> dp[200002][18][2], tmp;

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);

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

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

        if (node * 2 <= n) {
            for (int i = 0; node * 2 >> i; i++) for (int j : {0, 1}) {
                vector<int>().swap(dp[node * 2][i][j]);
                vector<int>().swap(dp[node * 2 + 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:8:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for (int i = 0, j = 1; i < l.size(); i += j, j <<= 1) {
      |                            ~~^~~~~~~~~~
swap.cpp:9:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |         for (int k = i; k < i + j && k < l.size(); k++) ret.push_back(l[k]);
      |                                      ~~^~~~~~~~~~
swap.cpp:10:40: 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 < r.size(); k++) ret.push_back(r[k]);
      |                                      ~~^~~~~~~~~~
swap.cpp: In function 'int main()':
swap.cpp:21:31: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   21 |             if (!(((node >> i + 1) << 1) + j)) continue;
      |                             ~~^~~
swap.cpp:22:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   22 |             int val = a[((node >> i + 1) << 1) + j];
      |                                   ~~^~~
swap.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
swap.cpp:17:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   17 |     for (int i = 1; i <= n; i++) scanf("%d", a + i);
      |                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 169580 KB Output is correct
2 Correct 103 ms 169452 KB Output is correct
3 Correct 102 ms 169452 KB Output is correct
4 Correct 101 ms 169452 KB Output is correct
5 Correct 103 ms 169472 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 169580 KB Output is correct
2 Correct 103 ms 169452 KB Output is correct
3 Correct 102 ms 169452 KB Output is correct
4 Correct 101 ms 169452 KB Output is correct
5 Correct 103 ms 169472 KB Output is correct
6 Correct 101 ms 169452 KB Output is correct
7 Correct 100 ms 169404 KB Output is correct
8 Correct 102 ms 169452 KB Output is correct
9 Correct 101 ms 169452 KB Output is correct
10 Correct 101 ms 169452 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 169580 KB Output is correct
2 Correct 103 ms 169452 KB Output is correct
3 Correct 102 ms 169452 KB Output is correct
4 Correct 101 ms 169452 KB Output is correct
5 Correct 103 ms 169472 KB Output is correct
6 Correct 101 ms 169452 KB Output is correct
7 Correct 100 ms 169404 KB Output is correct
8 Correct 102 ms 169452 KB Output is correct
9 Correct 101 ms 169452 KB Output is correct
10 Correct 101 ms 169452 KB Output is correct
11 Correct 102 ms 169708 KB Output is correct
12 Correct 109 ms 169744 KB Output is correct
13 Correct 103 ms 169728 KB Output is correct
14 Correct 105 ms 169848 KB Output is correct
15 Correct 106 ms 169708 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 169580 KB Output is correct
2 Correct 103 ms 169452 KB Output is correct
3 Correct 102 ms 169452 KB Output is correct
4 Correct 101 ms 169452 KB Output is correct
5 Correct 103 ms 169472 KB Output is correct
6 Correct 101 ms 169452 KB Output is correct
7 Correct 100 ms 169404 KB Output is correct
8 Correct 102 ms 169452 KB Output is correct
9 Correct 101 ms 169452 KB Output is correct
10 Correct 101 ms 169452 KB Output is correct
11 Correct 102 ms 169708 KB Output is correct
12 Correct 109 ms 169744 KB Output is correct
13 Correct 103 ms 169728 KB Output is correct
14 Correct 105 ms 169848 KB Output is correct
15 Correct 106 ms 169708 KB Output is correct
16 Correct 391 ms 193772 KB Output is correct
17 Correct 389 ms 193828 KB Output is correct
18 Correct 392 ms 193772 KB Output is correct
19 Correct 426 ms 193772 KB Output is correct
20 Correct 420 ms 194012 KB Output is correct

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 169580 KB Output is correct
2 Correct 103 ms 169452 KB Output is correct
3 Correct 102 ms 169452 KB Output is correct
4 Correct 101 ms 169452 KB Output is correct
5 Correct 103 ms 169472 KB Output is correct
6 Correct 101 ms 169452 KB Output is correct
7 Correct 100 ms 169404 KB Output is correct
8 Correct 102 ms 169452 KB Output is correct
9 Correct 101 ms 169452 KB Output is correct
10 Correct 101 ms 169452 KB Output is correct
11 Correct 102 ms 169708 KB Output is correct
12 Correct 109 ms 169744 KB Output is correct
13 Correct 103 ms 169728 KB Output is correct
14 Correct 105 ms 169848 KB Output is correct
15 Correct 106 ms 169708 KB Output is correct
16 Correct 391 ms 193772 KB Output is correct
17 Correct 389 ms 193828 KB Output is correct
18 Correct 392 ms 193772 KB Output is correct
19 Correct 426 ms 193772 KB Output is correct
20 Correct 420 ms 194012 KB Output is correct
21 Runtime error 309 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -