oj.uz

Submission #873396

# Submission time Handle Problem Language Result Execution time Memory
873396 2023-11-15T02:28:55 Z anha3k25cvp Swap (BOI16_swap) C++14
68 / 100
 494 ms 262144 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>

using namespace std;

const int N = 5 + 1e5;
const int inf = 7 + 1e9;

vector <vector <vector <int>>> g;

void Merge(vector <int> &a, vector <int> &b, vector <int> &c) {
    for (int i = 0, j = 0, l = 1; i < b.size() || j < c.size(); i += l, j += l, l *= 2) {
        for (int pos = 0; pos < l && i + pos < b.size(); pos ++)
            a.push_back(b[i + pos]);
        for (int pos = 0; pos < l && j + pos < c.size(); pos ++)
            a.push_back(c[j + pos]);
    }
}

int main() {
#define TASKNAME ""
    ios_base :: sync_with_stdio (0);
    cin.tie (0);
    if ( fopen( TASKNAME".inp", "r" ) ) {
        freopen (TASKNAME".inp", "r", stdin);
        freopen (TASKNAME".out", "w", stdout);
    }
    int n;
    cin >> n;
    vector <int> a(n + 1, 0);
    for (int i = 1; i <= n; i ++)
        cin >> a[i];
    int logn;
    for (logn = 1; (1 << logn) <= n; logn ++);
    logn *= 2;
    vector <vector <bool>> f(logn, vector <bool> (n + 1, 0));
    f[0][1] = 1;
    for (int i = 1; i * 2 + 1 <= n; i ++)
        for (int j = 0; j < logn; j ++)
            if (f[j][i]) {
                int pos = i >> j / 2 ^ j & 1;
                if (a[2 * i + 1] < a[pos] && a[2 * i + 1] < a[2 * i])
                    f[j + 2][2 * i] = f[0][2 * i] = f[j + 2][2 * i + 1] = f[1][2 * i + 1] = 1;
                else if (a[2 * i] < a[pos])
                    f[j + 2][2 * i] = f[0][2 * i + 1] = 1;
                else
                    f[0][2 * i] = f[0][2 * i + 1] = 1;
            }
    g.assign(logn, vector <vector <int>> (n + 1));
    for (int i = n; i > 0; i --) {
        for (int j = 0; j < logn; j ++)
            if (f[j][i]) {
                int pos = i >> j / 2 ^ j & 1;
                if (2 * i + 1 <= n) {
                    if (a[2 * i + 1] < a[pos] && a[2 * i + 1] < a[2 * i]) {
                        vector <int> v1(1, a[2 * i + 1]), v2(1, a[2 * i + 1]);
                        Merge(v1, g[j + 2][2 * i], g[1][2 * i + 1]);
                        Merge(v2, g[0][2 * i], g[j + 2][2 * i + 1]);
                        g[j][i] = min(v1, v2);
                    }
                    else if (a[2 * i] < a[pos]) {
                        g[j][i].push_back(a[2 * i]);
                        Merge(g[j][i], g[j + 2][2 * i], g[0][2 * i + 1]);
                    }
                    else {
                        g[j][i].push_back(a[pos]);
                        Merge(g[j][i], g[0][2 * i], g[0][2 * i + 1]);
                    }
                }
                else if (i * 2 <= n)
                    g[j][i] = {min(a[pos], a[2 * i]), max(a[pos], a[2 * i])};
                else
                    g[j][i] = {a[pos]};
            }
        if (2 * i + 1 <= n)
            for (int val = 0; val < 2; val ++)
                for (int j = 0; j < logn; j ++)
                    if (f[j][2 * i + val])
                        g[j][2 * i + val].clear();
    }
    for (int u : g[0][1])
        cout << u << ' ';
    return 0;
}

Compilation message

swap.cpp: In function 'void Merge(std::vector<int>&, std::vector<int>&, std::vector<int>&)':
swap.cpp:17:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for (int i = 0, j = 0, l = 1; i < b.size() || j < c.size(); i += l, j += l, l *= 2) {
      |                                   ~~^~~~~~~~~~
swap.cpp:17:53: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for (int i = 0, j = 0, l = 1; i < b.size() || j < c.size(); i += l, j += l, l *= 2) {
      |                                                   ~~^~~~~~~~~~
swap.cpp:18:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         for (int pos = 0; pos < l && i + pos < b.size(); pos ++)
      |                                      ~~~~~~~~^~~~~~~~~~
swap.cpp:20:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |         for (int pos = 0; pos < l && j + pos < c.size(); pos ++)
      |                                      ~~~~~~~~^~~~~~~~~~
swap.cpp: In function 'int main()':
swap.cpp:46:42: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   46 |                 int pos = i >> j / 2 ^ j & 1;
      |                                        ~~^~~
swap.cpp:58:42: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   58 |                 int pos = i >> j / 2 ^ j & 1;
      |                                        ~~^~~
swap.cpp:30:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         freopen (TASKNAME".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
swap.cpp:31:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |         freopen (TASKNAME".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 5 ms 968 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 5 ms 968 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 65 ms 47044 KB Output is correct
17 Correct 57 ms 46680 KB Output is correct
18 Correct 59 ms 47248 KB Output is correct
19 Correct 194 ms 78532 KB Output is correct
20 Correct 207 ms 78012 KB Output is correct

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 5 ms 968 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 65 ms 47044 KB Output is correct
17 Correct 57 ms 46680 KB Output is correct
18 Correct 59 ms 47248 KB Output is correct
19 Correct 194 ms 78532 KB Output is correct
20 Correct 207 ms 78012 KB Output is correct
21 Correct 255 ms 210432 KB Output is correct
22 Correct 273 ms 210304 KB Output is correct
23 Correct 244 ms 211108 KB Output is correct
24 Runtime error 494 ms 262144 KB Execution killed with signal 9
25 Halted 0 ms 0 KB -