oj.uz

답안 #896217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896217 2024-01-01T02:56:54 Z 12345678 Tree Rotations (POI11_rot) C++17
63 / 100
 138 ms 26404 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=4e5+5;
ll n, cnt, t, x, sz[nx], p[nx], c;
vector<ll> d[nx];

struct fenwick
{
    ll d[nx];
    void add(int i, int vl)
    {
        while (i<nx) d[i]+=vl, i+=(i&-i);
    }
    int query(int i)
    {
        int res=0;
        while (i>0) res+=d[i], i-=(i&-i);
        return res;
    }
} f;

void dfssz(int u)
{
    sz[u]=1;
    for (auto v:d[u]) dfssz(v), sz[u]+=sz[v];
}

pair<ll, ll> dfsvl(int u)
{
    if (u<=n) return make_pair(f.query(u-1), f.query(nx-1)-f.query(u));
    auto l=dfsvl(d[u][0]), r=dfsvl(d[u][1]);
    return make_pair(l.first+r.first, l.second+r.second);
}

void dfsrem(int u)
{
    if (u<=n) return f.add(u, -1), void();
    dfsrem(d[u][0]);
    dfsrem(d[u][1]);
}

void dfsadd(int u)
{
    if (u<=n) return f.add(u, 1), void();
    dfsadd(d[u][0]);
    dfsadd(d[u][1]);
}

int solve(int u, bool del)
{
    if (u<=n&&!del) f.add(u, 1);
    if (u<=n) return 0;
    if (sz[d[u][0]]<sz[d[u][1]]) swap(d[u][0], d[u][1]);
    ll res=solve(d[u][1], 1)+solve(d[u][0], 0);
    //if (u==8) cout<<f.query(0)<<' '<<f.query(1)<<' '<<f.query(5)<<'\n';
    auto tmp=dfsvl(d[u][1]);
    if (del) dfsrem(d[u][0]);
    else dfsadd(d[u][1]);
    //cout<<u<<' '<<del<<' '<<res<<' '<<tmp.first<<' '<<tmp.second<<' '<<min(tmp.first, tmp.second)<<'\n';
    return res+min(tmp.first, tmp.second);
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>x;
    t=c=n+1;
    while (cnt!=n)
    {
        cin>>x;
        if (!x) d[c].push_back(++t), p[t]=c, c=t;
        else 
        {
            d[c].push_back(x); cnt++;
            while (d[c].size()==2) c=p[c];
        }
    }
    dfssz(n+1);
    cout<<solve(n+1, 0);
}

/*
5
0
0
0
5
1
2
0
4
3
*/

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 17828 KB Output is correct
2 Correct 11 ms 17284 KB Output is correct
3 Correct 24 ms 18000 KB Output is correct
4 Correct 9 ms 17656 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 18656 KB Output is correct
2 Correct 25 ms 19292 KB Output is correct
3 Correct 28 ms 20060 KB Output is correct
4 Correct 27 ms 20060 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 25168 KB Output is correct
2 Correct 36 ms 23628 KB Output is correct
3 Correct 47 ms 22524 KB Output is correct
4 Correct 36 ms 22108 KB Output is correct

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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

Subtask #11
0 / 10.0

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