oj.uz

Submission #1085239

# Submission time Handle Problem Language Result Execution time Memory
1085239 2024-09-07T17:52:52 Z eysbutno Tree Rotations (POI11_rot) C++17
36 / 100
 1000 ms 24916 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = array<int, 2>;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int n; cin >> n;
    const auto dfs = [&](auto &&self) -> pair<ll, Tree<int>> {
        int x; cin >> x;
        if (x == 0) {
            auto [inv_l, set_l] = self(self);
            auto [inv_r, set_r] = self(self);
            if (sz(set_l) > sz(set_r)) {
                set_l.swap(set_r);
            }
            ll opt_1 = 0, opt_2 = 0;
            for (int v : set_l) {
                int idx = set_r.order_of_key(v);
                opt_1 += idx;
                opt_2 += sz(set_r) - idx;
            }
            for (int v : set_l) {
                set_r.insert(v);
            }
			pair<ll, Tree<int>> res;
			res.first = inv_l + inv_r + min(opt_1, opt_2);
			res.second.swap(set_r);
            return res;
        } else {
            Tree<int> res;
            res.insert(x);
            return {0, res};
        }
    };
    cout << dfs(dfs).first << "\n";
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 452 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 1436 KB Output is correct
2 Correct 7 ms 860 KB Output is correct
3 Correct 113 ms 1612 KB Output is correct
4 Correct 145 ms 1616 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1047 ms 3924 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 6428 KB Output is correct
2 Execution timed out 1004 ms 6736 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1040 ms 23636 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1061 ms 3712 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1047 ms 24916 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1046 ms 5504 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1044 ms 4484 KB Time limit exceeded
2 Halted 0 ms 0 KB -