oj.uz

Submission #871653

# Submission time Handle Problem Language Result Execution time Memory
871653 2023-11-11T08:35:35 Z sleepntsheep Tree Rotations (POI11_rot) C++17
90 / 100
 606 ms 65536 KB 
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 1000005

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using oset = tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>;

int root, n, A[N], L[N], R[N], alloc;
oset *a[N];
i64 t[N], sz[N];

int read()
{
    int u = ++alloc, p;
    cin >> p;
    if (p) return sz[u] = 1, (a[u] = new oset())->insert({A[u] = p, u}), u;
    L[u] = read(); R[u] = read();
    return sz[u] = sz[L[u]] + sz[R[u]], u;
}

static inline i64 qry(u64 p)
{
    u64 z{0};
    for (; p < N; p+=p&-p) z += t[p];
    return z;
}

static inline void upd(u64 p, i64 k)
{
    for (; p; p-=p&-p) t[p] += k;
}


u64 order(const oset &s, oset::iterator it)
{
    return it == s.end() ? s.size() : s.order_of_key(*it);
}

void dfs0(int u)
{
    if (!L[u]) return;

    dfs0(L[u]), dfs0(R[u]);

    u64 l2r = 0, r2l = 0;

    if (a[R[u]]->size() > a[L[u]]->size())
    {
        for (const pair<int, int> &x : *a[L[u]])
            l2r += order(*a[R[u]], a[R[u]]->lower_bound({x.first, 0})),
            r2l += sz[R[u]] - order(*a[R[u]], a[R[u]]->lower_bound({x.first+1, 0}));
    }
    else
    {
        for (const pair<int, int> &x : *a[R[u]])
            l2r += sz[L[u]] - order(*a[L[u]], a[L[u]]->lower_bound({x.first+1, 0})),
            r2l += order(*a[L[u]], a[L[u]]->lower_bound({x.first, 0}));
    }

    if (r2l < l2r) swap(L[u], R[u]);

    if (sz[R[u]] > sz[L[u]])
    {
        a[u] = a[R[u]];
        for (auto x : *a[L[u]]) a[u]->insert(x);
        delete a[L[u]];
    }
    else
    {
        a[u] = a[L[u]];
        for (auto x : *a[R[u]]) a[u]->insert(x);
        delete a[R[u]];
    }
}


vector<int> corona;

void dfs2(int u)
{
    if (!L[u]) corona.push_back(A[u]);
    else dfs2(L[u]), dfs2(R[u]);
}

int main()
{
    ShinLena;
    cin >> n;
    root = read();

    dfs0(root);
    dfs2(root);

    u64 z{0};

    for (auto x : corona) upd(x, 1), z += qry(x+1);

    cout << z;
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12124 KB Output is correct
2 Correct 23 ms 13152 KB Output is correct
3 Correct 71 ms 16212 KB Output is correct
4 Correct 16 ms 13916 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 20028 KB Output is correct
2 Correct 62 ms 21584 KB Output is correct
3 Correct 87 ms 23892 KB Output is correct
4 Correct 72 ms 24404 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 36544 KB Output is correct
2 Correct 104 ms 33104 KB Output is correct
3 Correct 144 ms 30544 KB Output is correct
4 Correct 104 ms 29268 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 35668 KB Output is correct
2 Correct 176 ms 37064 KB Output is correct
3 Correct 147 ms 41296 KB Output is correct
4 Correct 162 ms 41448 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 408 ms 53348 KB Output is correct
2 Correct 238 ms 52168 KB Output is correct
3 Correct 305 ms 52696 KB Output is correct
4 Correct 306 ms 51540 KB Output is correct
5 Correct 514 ms 48516 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 354 ms 54368 KB Output is correct
2 Correct 310 ms 63812 KB Output is correct
3 Correct 351 ms 59444 KB Output is correct
4 Correct 273 ms 63860 KB Output is correct
5 Correct 606 ms 56780 KB Output is correct

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 413 ms 59032 KB Output is correct
2 Correct 336 ms 62800 KB Output is correct
3 Correct 476 ms 58096 KB Output is correct
4 Correct 415 ms 59068 KB Output is correct
5 Runtime error 65 ms 65536 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -