Submission #871650

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
871650	2023-11-11T08:33:25 Z	sleepntsheep	Tree Rotations (POI11_rot)	C++17	100 / 100	548 ms	52304 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, L[N], R[N], A[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] = p, 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 void((a[u] = new oset())->insert({A[u], u}));

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


    i64 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	8540 KB	Output is correct
2	Correct	1 ms	8540 KB	Output is correct
3	Correct	1 ms	8540 KB	Output is correct
4	Correct	1 ms	8540 KB	Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	9304 KB	Output is correct
2	Correct	7 ms	9052 KB	Output is correct
3	Correct	4 ms	9308 KB	Output is correct
4	Correct	3 ms	9564 KB	Output is correct

Subtask #5
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	11096 KB	Output is correct
2	Correct	21 ms	12068 KB	Output is correct
3	Correct	69 ms	13960 KB	Output is correct
4	Correct	15 ms	13148 KB	Output is correct

Subtask #6
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	104 ms	15700 KB	Output is correct
2	Correct	62 ms	18096 KB	Output is correct
3	Correct	73 ms	20564 KB	Output is correct
4	Correct	66 ms	20812 KB	Output is correct

Subtask #7
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	84 ms	29644 KB	Output is correct
2	Correct	94 ms	27792 KB	Output is correct
3	Correct	124 ms	22628 KB	Output is correct
4	Correct	88 ms	21404 KB	Output is correct

Subtask #8
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	155 ms	22868 KB	Output is correct
2	Correct	144 ms	25676 KB	Output is correct
3	Correct	127 ms	33876 KB	Output is correct
4	Correct	129 ms	33880 KB	Output is correct

Subtask #9
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	362 ms	39508 KB	Output is correct
2	Correct	207 ms	35152 KB	Output is correct
3	Correct	244 ms	38668 KB	Output is correct
4	Correct	253 ms	36272 KB	Output is correct
5	Correct	454 ms	35708 KB	Output is correct

Subtask #10
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	264 ms	35284 KB	Output is correct
2	Correct	270 ms	52304 KB	Output is correct
3	Correct	301 ms	41348 KB	Output is correct
4	Correct	215 ms	51584 KB	Output is correct
5	Correct	548 ms	43056 KB	Output is correct

Subtask #11
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	323 ms	44024 KB	Output is correct
2	Correct	281 ms	42948 KB	Output is correct
3	Correct	413 ms	39880 KB	Output is correct
4	Correct	340 ms	45396 KB	Output is correct
5	Correct	229 ms	51912 KB	Output is correct
6	Correct	509 ms	43856 KB	Output is correct

Submission #871650

Compilation message