답안 #1085202

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1085202 2024-09-07T16:54:23 Z eysbutno Tree Rotations (POI11_rot) C++17
36 / 100
1000 ms 22980 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);
            }
            return {inv_l + inv_r + min(opt_1, opt_2), set_r};
        } else {
            Tree<int> res;
            res.insert(x);
            return {0, res};
        }
    };
    cout << dfs(dfs).first << "\n";
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 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 5 ms 604 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 1360 KB Output is correct
2 Correct 7 ms 856 KB Output is correct
3 Correct 111 ms 1348 KB Output is correct
4 Correct 149 ms 1452 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1059 ms 3292 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 118 ms 6416 KB Output is correct
2 Execution timed out 1048 ms 5712 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1061 ms 20052 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1020 ms 3664 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1067 ms 22980 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1032 ms 4688 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1014 ms 4176 KB Time limit exceeded
2 Halted 0 ms 0 KB -