oj.uz

Submission #287837

# Submission time Handle Problem Language Result Execution time Memory
287837 2020-09-01T03:54:41 Z zecookiez Tree Rotations (POI11_rot) C++17
36 / 100
 1000 ms 13432 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class C>constexpr int len(const C&c){return int(c.size());}
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
 
const int MAXN = 200005;
int N; long long ans, bit[MAXN];
 
void update(int pos, int val){
    for(int i = pos; i <= N; i += i & -i) bit[i] += val;
}
long long query(int pos){
    long long tot = 0;
    for(int i = pos; i > 0; i -= i & -i) tot += bit[i];
    return tot;
}
vector<int> solve(){
    int A; cin >> A;
    if(A != 0){
        update(A, 1);
        return {A};
    }
    vector<int> left = solve(), right = solve();
    if(len(left) > len(right)) swap(left, right);
    memset(bit, 0, sizeof(bit));
    long long cur, case1 = 0, case2 = 0;
    for(auto i : right) update(i, 1);
    for(auto i : left){
        cur = query(i - 1);
        case1 += cur;
        case2 += len(right) - cur;
    }
    ans += min(case1, case2);
    for(auto i : left) update(i, 1), right.push_back(i);
    return right;
}
 
int main(){
    cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> N; vector<int> arr = solve();
    cout << ans << '\n';
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1920 KB Output is correct
2 Correct 8 ms 1920 KB Output is correct
3 Correct 9 ms 1920 KB Output is correct
4 Correct 9 ms 2048 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1920 KB Output is correct
2 Correct 54 ms 1972 KB Output is correct
3 Correct 54 ms 1920 KB Output is correct
4 Correct 53 ms 1920 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 311 ms 2296 KB Output is correct
2 Correct 254 ms 2040 KB Output is correct
3 Correct 346 ms 2424 KB Output is correct
4 Correct 370 ms 2500 KB Output is correct

Subtask #5
0 / 9.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1052 ms 13432 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 1092 ms 2572 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 1089 ms 2296 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 1036 ms 4224 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 1082 ms 3936 KB Time limit exceeded
2 Halted 0 ms 0 KB -