oj.uz

Submission #998834

# Submission time Handle Problem Language Result Execution time Memory
998834 2024-06-14T17:26:36 Z underwaterkillerwhale Swap (BOI16_swap) C++17
68 / 100
 422 ms 262144 KB 
#pragma GCC optimize("conserve-stack")

#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N  = 2e5 + 7;
const int Mod = 998244353;
const int szBL = 916;
const int INF = 1e9;
const int BASE = 137;

int n;
int a[N];
map<int, vector<int>> dp[N];

vector<int> Merge (int A, vector<int> &lc, vector<int> &rc) {
    int ptr1 = 0, ptr2 = 0;
    static vector<int> vec;
    vec = {A};
    rep (i, 0, 20) {
        if ((1 << i) > SZ(lc) - ptr1) break;
        rep (j, 1, (1 << i)) vec.push_back(lc[ptr1++]);
        rep (j, 1, (1 << i)) {
            if (ptr2 < SZ(rc)) vec.push_back(rc[ptr2++]);
        }
    }
    while (ptr1 < SZ(lc)) vec.push_back(lc[ptr1++]);
    return vec;
}

bool compare (vector<int> &v1, vector<int> &v2) {
    int pos = 0;
    assert (SZ(v1) == SZ(v2));
    while (v1[pos] == v2[pos]) ++pos;
    return v1[pos] < v2[pos];
}

void calc (int id, int val);
void Assign (int root, int valr) {
    int lc = root * 2, rc = root * 2 + 1;
    if (valr < a[lc] && valr < a[rc]) {
        calc (lc, a[lc]), calc (rc, a[rc]);
        dp[root][valr] = Merge (valr, dp[lc][a[lc]], dp[rc][a[rc]]);
    }
    else if (a[lc] < min (valr, a[rc])) {
        calc (lc, valr), calc (rc, a[rc]);
        dp[root][valr] = Merge (a[lc], dp[lc][valr], dp[rc][a[rc]]);
    }
    else {
        int B = min (valr, a[lc]);
        int C = max (valr, a[lc]);
        int A = a[rc];
        calc (lc, B);
        calc (rc, C);
        calc (lc, C);
        calc (rc, B);
        vector<int> t1 = Merge (A, dp[lc][B], dp[rc][C]), t2 = Merge (A, dp[lc][C], dp[rc][B]);
        if (compare (t1, t2)) dp[root][valr] = t1;
        else dp[root][valr] = t2;
    }
}

void calc (int id, int val) {
    if (id > n) {
        vector<int> (0);
        return;
    }
    if (id * 2 > n) {
        dp[id][val] = vector<int> (1, val);
        return;
    }
    if (id * 2 + 1 > n) {
        dp[id][val] = {min(val, a[id * 2]), max(val, a[id * 2])};
        return;
    }
    if (dp[id].find(val) != dp[id].end())
        return;
    Assign (id, val);
    return;
}

void solution () {
    cin >> n;
    rep (i, 1, n) cin >> a[i];
//    n = 1e5;
//    rep (i ,1, n) a[i] = i;
//    random_shuffle(a + 1, a + 1 + n);
    if (n <= 2) {
        sort (a + 1, a + 1 + n);
        cout << a[1] <<" "<<a[2];
        return;
    }
    vector<int> res;
    Assign (1, a[1]);
    iter (&id, dp[1][a[1]]) cout << id <<" ";
}

#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);
int main () {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//    file ("c");
    int num_Test = 1;
//    cin >> num_Test;
    while (num_Test--)
        solution();
}
/*
5 10
1 2
3 1
4 2
5 3
1 4
2 3
3 5
4 5
3 4
1 4

*/

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 4 ms 10072 KB Output is correct
7 Correct 2 ms 9820 KB Output is correct
8 Correct 2 ms 9820 KB Output is correct
9 Correct 3 ms 9884 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 4 ms 10072 KB Output is correct
7 Correct 2 ms 9820 KB Output is correct
8 Correct 2 ms 9820 KB Output is correct
9 Correct 3 ms 9884 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct
11 Correct 4 ms 10076 KB Output is correct
12 Correct 3 ms 10076 KB Output is correct
13 Correct 3 ms 10132 KB Output is correct
14 Correct 4 ms 10844 KB Output is correct
15 Correct 4 ms 10780 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 4 ms 10072 KB Output is correct
7 Correct 2 ms 9820 KB Output is correct
8 Correct 2 ms 9820 KB Output is correct
9 Correct 3 ms 9884 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct
11 Correct 4 ms 10076 KB Output is correct
12 Correct 3 ms 10076 KB Output is correct
13 Correct 3 ms 10132 KB Output is correct
14 Correct 4 ms 10844 KB Output is correct
15 Correct 4 ms 10780 KB Output is correct
16 Correct 43 ms 28252 KB Output is correct
17 Correct 41 ms 27732 KB Output is correct
18 Correct 43 ms 28240 KB Output is correct
19 Correct 301 ms 105784 KB Output is correct
20 Correct 298 ms 105052 KB Output is correct

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9820 KB Output is correct
2 Correct 2 ms 9820 KB Output is correct
3 Correct 2 ms 9820 KB Output is correct
4 Correct 2 ms 9820 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 4 ms 10072 KB Output is correct
7 Correct 2 ms 9820 KB Output is correct
8 Correct 2 ms 9820 KB Output is correct
9 Correct 3 ms 9884 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct
11 Correct 4 ms 10076 KB Output is correct
12 Correct 3 ms 10076 KB Output is correct
13 Correct 3 ms 10132 KB Output is correct
14 Correct 4 ms 10844 KB Output is correct
15 Correct 4 ms 10780 KB Output is correct
16 Correct 43 ms 28252 KB Output is correct
17 Correct 41 ms 27732 KB Output is correct
18 Correct 43 ms 28240 KB Output is correct
19 Correct 301 ms 105784 KB Output is correct
20 Correct 298 ms 105052 KB Output is correct
21 Correct 216 ms 87876 KB Output is correct
22 Correct 225 ms 87412 KB Output is correct
23 Correct 214 ms 88300 KB Output is correct
24 Runtime error 422 ms 262144 KB Execution killed with signal 9
25 Halted 0 ms 0 KB -