oj.uz

답안 #766366

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
766366 2023-06-25T15:01:31 Z Chal1shkan Tree Rotations (POI11_rot) C++14
100 / 100
 132 ms 19168 KB 
//Bismillahir-Rahmanir-Rahim
 
# include <bits/stdc++.h>
 
# define pb push_back
# define ff first
# define ss second
# define nl "\n"
# define sz(x) ((int)(x).size())
# define all(x) (x).begin(), (x).end()
# define deb(x) cerr << #x  << " = " << x << endl; 
# define pll pair <ll, ll>
# define pii pair <int, int>
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
const ll maxn = 1e6 + 2;
const ll inf = 2e18 + 0;
const ll mod = 1e9 + 7;
const ll dx[] = {-1, 1, 0, 0};
const ll dy[] = {0, 0, -1, 1};
 
using namespace std;
 
ll n, nv;
ll L[maxn];
ll R[maxn];
ll sz[maxn];
ll cnt[maxn];
ll t[maxn];
ll dp[maxn];
 
void upd (ll id, ll x)
{
    for (; id < maxn; id |= (id + 1))
    {
        t[id] += x;
    }
}
 
ll get (ll id)
{
    ll res = 0;
    for (; id >= 1; id = (id & (id + 1)) - 1)
    {
        res += t[id];
    }
    return res;
}
 
void calc (ll v = n + 1)
{
    if (v <= n)
    {
        sz[v] = 1, cnt[v] = 1;
        return;
    }
    calc(L[v]); calc(R[v]);
    sz[v] = sz[L[v]] + sz[R[v]] + 1;
    cnt[v] = cnt[L[v]] + cnt[R[v]];
}
 
void updv (ll v, ll x)
{
    if (v <= n)
    {
        upd(v, x);
        return;
    }
    updv(L[v], x);
    updv(R[v], x);
}
 
ll count (ll v)
{
    if (v <= n) return get(v);
    return count(L[v]) + count(R[v]);
}
 
void dfs (ll v = n + 1, bool keep = 1)
{
    if (v <= n)
    {
        if (keep)
        {
            updv(v, 1);
        }
        return;
    }
    if (sz[L[v]] < sz[R[v]])
    {
        swap(L[v], R[v]);
    }
    dfs(R[v], 0); dfs(L[v], 1); 
    ll inv = count(R[v]);
    dp[v] = dp[L[v]] + dp[R[v]] + min(inv, cnt[L[v]] * cnt[R[v]] - inv);
    if (keep)
    {
        updv(R[v], 1);
    }
    else
    {
        updv(L[v], -1);
    }
}
 
ll rec ()
{
    ll x; cin >> x;
    if (!x)
    {
        ll v = ++nv;
        L[v] = rec ();
        R[v] = rec ();
        return v;
    }
    return x;
}
 
void ma1n (/* SABR */)
{
    cin >> n;
    nv = n;
    rec ();
    calc ();
    dfs ();
    cout << dp[n + 1];
}
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//  freopen("file.in", "r", stdin);
//  freopen("file.out", "w", stdout);
    ll ttt = 1;
//  cin >> ttt;
    for (int test = 1; test <= ttt; ++test)
    {
//      cout << "Case " << test << ":" << '\n';
        ma1n();
    }
    return 0;
}
 
// 998batrr | BbIWEJI 3A TObOU!!!
// tourist  | BbIWEJI 3A TObOU!!!

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1596 KB Output is correct
2 Correct 7 ms 1220 KB Output is correct
3 Correct 16 ms 2464 KB Output is correct
4 Correct 5 ms 1620 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 3916 KB Output is correct
2 Correct 16 ms 4692 KB Output is correct
3 Correct 20 ms 5584 KB Output is correct
4 Correct 24 ms 5816 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 9796 KB Output is correct
2 Correct 26 ms 8336 KB Output is correct
3 Correct 31 ms 7200 KB Output is correct
4 Correct 26 ms 6820 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 9040 KB Output is correct
2 Correct 35 ms 9588 KB Output is correct
3 Correct 34 ms 11592 KB Output is correct
4 Correct 32 ms 11464 KB Output is correct

Subtask #9
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 14608 KB Output is correct
2 Correct 63 ms 13700 KB Output is correct
3 Correct 62 ms 13672 KB Output is correct
4 Correct 69 ms 13388 KB Output is correct
5 Correct 108 ms 12412 KB Output is correct

Subtask #10
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 14464 KB Output is correct
2 Correct 69 ms 18088 KB Output is correct
3 Correct 80 ms 16720 KB Output is correct
4 Correct 60 ms 18672 KB Output is correct
5 Correct 121 ms 14088 KB Output is correct

Subtask #11
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 14796 KB Output is correct
2 Correct 70 ms 15692 KB Output is correct
3 Correct 111 ms 14604 KB Output is correct
4 Correct 79 ms 15120 KB Output is correct
5 Correct 55 ms 19168 KB Output is correct
6 Correct 132 ms 14460 KB Output is correct