oj.uz

Submission #766369

# Submission time Handle Problem Language Result Execution time Memory
766369 2023-06-25T15:04:07 Z Chal1shkan Tree Rotations (POI11_rot) C++14
63 / 100
 752 ms 6852 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 = 2e5 + 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;
 
int n, nv;
int L[maxn * 2];
int R[maxn * 2];
int sz[maxn];
int cnt[maxn];
int t[maxn];
ll dp[maxn];
 
void upd (int id, int x)
{
    for (; id <= n; id += (id & (-id)))
    {
        t[id] += x;
    }
}
 
int get (int id)
{
    int res = 0;
    for (; id >= 1; id -= (id & (-id)))
    {
        res += t[id];
    }
    return res;
}
 
void calc (int 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 (int v, int x)
{
    if (v <= n)
    {
        upd(v, x);
        return;
    }
    updv(L[v], x);
    updv(R[v], x);
}
 
ll count (int v)
{
    if (v <= n) return get(v);
    return count(L[v]) + count(R[v]);
}
 
void dfs (int 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]] * 1LL * cnt[R[v]] - inv);
    if (keep)
    {
        updv(R[v], 1);
    }
    else
    {
        updv(L[v], -1);
    }
}
 
int rec ()
{
    int x; cin >> x;
    if (!x)
    {
        int 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);
    int 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

# Verdict Execution time Memory Grader output
1 Correct 0 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 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory 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 340 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct
2 Correct 5 ms 724 KB Output is correct
3 Correct 13 ms 1420 KB Output is correct
4 Correct 4 ms 1108 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2056 KB Output is correct
2 Correct 14 ms 2872 KB Output is correct
3 Correct 16 ms 3796 KB Output is correct
4 Correct 17 ms 3808 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 6852 KB Output is correct
2 Correct 21 ms 5356 KB Output is correct
3 Correct 26 ms 4236 KB Output is correct
4 Correct 23 ms 3684 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 109 ms 4232 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 81 ms 6664 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 752 ms 5792 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 543 ms 5596 KB Output isn't correct
2 Halted 0 ms 0 KB -