oj.uz

답안 #287868

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
287868 2020-09-01T05:30:41 Z zecookiez Tree Rotations (POI11_rot) C++14
72 / 100
 120 ms 15996 KB 
#include <bits/stdc++.h>
using namespace std;
template<class C>constexpr int len(const C&c){return int(c.size());}

const int MAXN = 200005;
int N, id, cur, arr[MAXN], L[2*MAXN], R[2*MAXN], LL[2*MAXN], RR[2*MAXN], bit[MAXN];
long long ans;

void update(int pos, int val){
    for(int i = pos; i <= N; i += i & -i) bit[i] += val;
}
int query(int pos){
    int tot = 0; for(int i = pos; i > 0; i &= i - 1) tot += bit[i];
    return tot;
}

void read_tree(int node){
    int A; cin >> A;
    L[node] = cur;
    if(A != 0){
        arr[cur++] = A; R[node] = cur; return;
    }
    LL[node] = ++id; read_tree(id);
    RR[node] = ++id; read_tree(id);
    R[node] = cur;
}

void solve(int id){
    if(R[id] - L[id] == 1){
        update(arr[L[id]], 1); return;
    }
    int SZ, left = LL[id], right = RR[id], cur, case1 = 0, case2 = 0;
    int A = L[left], B = R[left], C = L[right], D = R[right];
    if(B - A <= D - C){
        solve(left); for(int i = A; i < B; ++i) update(arr[i], -1);
        solve(right); SZ = D - C;
        for(int i = A; i < B; ++i){
            cur = query(arr[i] - 1);
            case1 += cur; case2 += SZ - cur;
        }
        for(int i = A; i < B; ++i) update(arr[i], 1);
    } else {
        solve(right); for(int i = C; i < D; ++i) update(arr[i], -1);
        solve(left); SZ = B - A;
        for(int i = C; i < D; ++i){
            cur = query(arr[i] - 1);
            case1 += cur; case2 += SZ - cur;
        }
        for(int i = C; i < D; ++i) update(arr[i], 1);
    }
    ans += min(case1, case2);
}

int main(){
    cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> N; read_tree(0); solve(0); cout << ans << '\n';
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 416 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 896 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1664 KB Output is correct
2 Correct 7 ms 896 KB Output is correct
3 Correct 21 ms 1792 KB Output is correct
4 Correct 6 ms 1536 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 2304 KB Output is correct
2 Correct 21 ms 3968 KB Output is correct
3 Correct 23 ms 5368 KB Output is correct
4 Correct 24 ms 5496 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 9472 KB Output is correct
2 Correct 33 ms 7552 KB Output is correct
3 Correct 39 ms 5880 KB Output is correct
4 Correct 32 ms 4864 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 5248 KB Output is correct
2 Correct 46 ms 7544 KB Output is correct
3 Correct 45 ms 10360 KB Output is correct
4 Correct 45 ms 10240 KB Output is correct

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 8696 KB Output is correct
2 Incorrect 85 ms 15996 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

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