oj.uz

Submission #998805

# Submission time Handle Problem Language Result Execution time Memory
998805 2024-06-14T17:06:10 Z underwaterkillerwhale Swap (BOI16_swap) C++17
68 / 100
 747 ms 262144 KB 
#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 ll INF = 1e17;
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;
    vector<int> 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];
}

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

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

void solution () {
    cin >> n;
    rep (i, 1, n) cin >> a[i];
    vector<int> res;
//    iter(&id, Merge (1, {2, 4, 5, 8, 9, 10, 11}, {3, 6, 7, 12, 13})) cout << id <<" ";
    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 9860 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 9860 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 3 ms 9816 KB Output is correct
9 Correct 2 ms 9820 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 9860 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 3 ms 9816 KB Output is correct
9 Correct 2 ms 9820 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct
11 Correct 2 ms 9816 KB Output is correct
12 Correct 2 ms 10076 KB Output is correct
13 Correct 2 ms 9820 KB Output is correct
14 Correct 5 ms 10268 KB Output is correct
15 Correct 4 ms 10332 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 9860 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 3 ms 9816 KB Output is correct
9 Correct 2 ms 9820 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct
11 Correct 2 ms 9816 KB Output is correct
12 Correct 2 ms 10076 KB Output is correct
13 Correct 2 ms 9820 KB Output is correct
14 Correct 5 ms 10268 KB Output is correct
15 Correct 4 ms 10332 KB Output is correct
16 Correct 34 ms 21780 KB Output is correct
17 Correct 33 ms 21792 KB Output is correct
18 Correct 32 ms 22156 KB Output is correct
19 Correct 193 ms 64952 KB Output is correct
20 Correct 187 ms 64444 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 9860 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 3 ms 9820 KB Output is correct
7 Correct 4 ms 9820 KB Output is correct
8 Correct 3 ms 9816 KB Output is correct
9 Correct 2 ms 9820 KB Output is correct
10 Correct 3 ms 9820 KB Output is correct
11 Correct 2 ms 9816 KB Output is correct
12 Correct 2 ms 10076 KB Output is correct
13 Correct 2 ms 9820 KB Output is correct
14 Correct 5 ms 10268 KB Output is correct
15 Correct 4 ms 10332 KB Output is correct
16 Correct 34 ms 21780 KB Output is correct
17 Correct 33 ms 21792 KB Output is correct
18 Correct 32 ms 22156 KB Output is correct
19 Correct 193 ms 64952 KB Output is correct
20 Correct 187 ms 64444 KB Output is correct
21 Correct 157 ms 62192 KB Output is correct
22 Correct 147 ms 62860 KB Output is correct
23 Correct 144 ms 63384 KB Output is correct
24 Runtime error 747 ms 262144 KB Execution killed with signal 9
25 Halted 0 ms 0 KB -