oj.uz

Submission #706457

# Submission time Handle Problem Language Result Execution time Memory
706457 2023-03-06T15:25:16 Z ParsaS Swap (BOI16_swap) C++17
0 / 100
 14 ms 19096 KB 
// In the name of God
//        : )
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
const int N = 4e5 + 5, MOD = 1e9 + 7, inf = 1e9 + 10;
int n, a[N], par[N];
set<int> st[N];

void ins(int v, int x) {
    st[v].insert(x);
}
void ers(int v, int x) {
    st[v].erase(st[v].find(x));
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        par[i] = i / 2;
        st[i].insert(a[i]);
        st[i].insert(inf);
    }
    for (int i = n + 1; i <= 2 * n + 1; i++) {
        st[i].insert(inf);
        st[i].insert(inf - 1);
        a[i] = inf - 1;
    }
    if (0&&n <= 3) {
        sort(a, a + n + 1);
        for (int i = 1; i <= n; i++)
            cout << a[i] << ' ';
        return;
    }
    if (a[1] < min(a[2], a[3])) {
        par[2] = par[3] = 0;
    }
    else if (a[2] < min(a[1], a[3])) {
        ers(2, a[2]), ins(2, a[1]);
        a[1] = a[2];
        par[2] = par[3] = 0;
    }
    else {
        ins(1, a[2]);
        ers(2, a[2]);
        ers(3, a[3]);
        a[1] = a[3];
    }
    for (int i = 2; i <= n; i++) {
        int lc = a[2 * i], rc = a[2 * i + 1];
        int ul = 2 * i, ur = 2 * i + 1;
        int v = i, mn = inf;
        while (v) {
            mn = min(mn, *st[v].begin());
            v = par[v];
        }
        if (mn < min(lc, rc)) {
            v = i;
            while (!st[v].count(mn))
                v = par[v];
            ers(v, mn);
            a[i] = mn;
            par[ul] = par[ur] = 0;
        }
        else if (lc < min(mn, rc)) {
            ers(ul, lc);
            a[i] = lc;
            par[ur] = 0;
        }
        else {
            ers(ul, lc);
            ers(ur, rc);
            ins(i, lc);
            a[i] = rc;
        }
    }
    for (int i = 1; i <= n; i++)
        cout << a[i] << ' ';
}

int32_t main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int tc = 1; //cin >> tc;
    while (tc--) {
        solve();
    }
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 10 ms 19012 KB Output is correct
3 Incorrect 14 ms 19096 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 10 ms 19012 KB Output is correct
3 Incorrect 14 ms 19096 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 10 ms 19012 KB Output is correct
3 Incorrect 14 ms 19096 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 10 ms 19012 KB Output is correct
3 Incorrect 14 ms 19096 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 10 ms 19012 KB Output is correct
3 Incorrect 14 ms 19096 KB Output isn't correct
4 Halted 0 ms 0 KB -