oj.uz

답안 #322263

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
322263 2020-11-14T10:52:56 Z dolphingarlic Swap (BOI16_swap) C++14
68 / 100
 868 ms 262148 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 = n / 2; node; node--) {
        for (int i = 0; node >> i; i++) for (int j : {0, 1}) {
            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) {
                if (a[p] < a[2 * node]) dp[node][i][j] = {a[p], a[2 * node]};
                else dp[node][i][j] = {a[2 * node], a[p]};
            } 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:30: 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: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 < l.size(); k++) ret.push_back(l[k]);
      |                                      ~~^~~~~~~~~~
swap.cpp:11:40: 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:23:41: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   23 |             int mn = min({a[((node >> i + 1) << 1) + j], a[2 * node], a[2 * node + 1]});
      |                                       ~~^~~
swap.cpp:24:37: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |             if (mn == a[((node >> i + 1) << 1) + j]) {
      |                                   ~~^~~
swap.cpp:39:33: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   39 |             int p = ((node >> i + 1) << 1) + j;
      |                               ~~^~~
swap.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   17 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
swap.cpp:18:39: 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

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 169452 KB Output is correct
2 Correct 97 ms 169452 KB Output is correct
3 Correct 99 ms 169452 KB Output is correct
4 Correct 98 ms 169452 KB Output is correct
5 Correct 97 ms 169452 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 169452 KB Output is correct
2 Correct 97 ms 169452 KB Output is correct
3 Correct 99 ms 169452 KB Output is correct
4 Correct 98 ms 169452 KB Output is correct
5 Correct 97 ms 169452 KB Output is correct
6 Correct 96 ms 169452 KB Output is correct
7 Correct 98 ms 169452 KB Output is correct
8 Correct 97 ms 169452 KB Output is correct
9 Correct 97 ms 169452 KB Output is correct
10 Correct 118 ms 169452 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 169452 KB Output is correct
2 Correct 97 ms 169452 KB Output is correct
3 Correct 99 ms 169452 KB Output is correct
4 Correct 98 ms 169452 KB Output is correct
5 Correct 97 ms 169452 KB Output is correct
6 Correct 96 ms 169452 KB Output is correct
7 Correct 98 ms 169452 KB Output is correct
8 Correct 97 ms 169452 KB Output is correct
9 Correct 97 ms 169452 KB Output is correct
10 Correct 118 ms 169452 KB Output is correct
11 Correct 100 ms 169580 KB Output is correct
12 Correct 100 ms 169580 KB Output is correct
13 Correct 100 ms 169600 KB Output is correct
14 Correct 101 ms 169836 KB Output is correct
15 Correct 99 ms 169708 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 169452 KB Output is correct
2 Correct 97 ms 169452 KB Output is correct
3 Correct 99 ms 169452 KB Output is correct
4 Correct 98 ms 169452 KB Output is correct
5 Correct 97 ms 169452 KB Output is correct
6 Correct 96 ms 169452 KB Output is correct
7 Correct 98 ms 169452 KB Output is correct
8 Correct 97 ms 169452 KB Output is correct
9 Correct 97 ms 169452 KB Output is correct
10 Correct 118 ms 169452 KB Output is correct
11 Correct 100 ms 169580 KB Output is correct
12 Correct 100 ms 169580 KB Output is correct
13 Correct 100 ms 169600 KB Output is correct
14 Correct 101 ms 169836 KB Output is correct
15 Correct 99 ms 169708 KB Output is correct
16 Correct 250 ms 183532 KB Output is correct
17 Correct 243 ms 182892 KB Output is correct
18 Correct 260 ms 184300 KB Output is correct
19 Correct 361 ms 195052 KB Output is correct
20 Correct 358 ms 195180 KB Output is correct

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 169452 KB Output is correct
2 Correct 97 ms 169452 KB Output is correct
3 Correct 99 ms 169452 KB Output is correct
4 Correct 98 ms 169452 KB Output is correct
5 Correct 97 ms 169452 KB Output is correct
6 Correct 96 ms 169452 KB Output is correct
7 Correct 98 ms 169452 KB Output is correct
8 Correct 97 ms 169452 KB Output is correct
9 Correct 97 ms 169452 KB Output is correct
10 Correct 118 ms 169452 KB Output is correct
11 Correct 100 ms 169580 KB Output is correct
12 Correct 100 ms 169580 KB Output is correct
13 Correct 100 ms 169600 KB Output is correct
14 Correct 101 ms 169836 KB Output is correct
15 Correct 99 ms 169708 KB Output is correct
16 Correct 250 ms 183532 KB Output is correct
17 Correct 243 ms 182892 KB Output is correct
18 Correct 260 ms 184300 KB Output is correct
19 Correct 361 ms 195052 KB Output is correct
20 Correct 358 ms 195180 KB Output is correct
21 Correct 838 ms 233452 KB Output is correct
22 Correct 868 ms 235220 KB Output is correct
23 Correct 836 ms 233068 KB Output is correct
24 Runtime error 291 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
25 Halted 0 ms 0 KB -