oj.uz

답안 #871639

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871639 2023-11-11T08:19:30 Z sleepntsheep Tree Rotations (POI11_rot) C++17
0 / 100
 371 ms 45744 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;
}

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 += a[R[u]]->order_of_key(*a[R[u]]->lower_bound({x.first, 0})),
            r2l += sz[R[u]] - a[R[u]]->order_of_key(*a[R[u]]->lower_bound({x.first+1, 0}));
    }
    else
    {
        for (const pair<int, int> &x : *a[R[u]])
            l2r += sz[L[u]] - a[L[u]]->order_of_key(*a[L[u]]->lower_bound({x.first+1, 0})),
            r2l += a[L[u]]->order_of_key(*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
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 8540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 8540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 8536 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 9304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 13404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 106 ms 15524 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 88 ms 32012 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 166 ms 22888 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 371 ms 40708 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 264 ms 35840 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 327 ms 45744 KB Output isn't correct
2 Halted 0 ms 0 KB -