oj.uz

Submission #766437

# Submission time Handle Problem Language Result Execution time Memory
766437 2023-06-25T16:12:41 Z Chal1shkan Tree Rotations (POI11_rot) C++14
63 / 100
 1000 ms 10580 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;
 
ll n, nv, ans;
ll L[maxn * 4];
ll R[maxn * 4];
ll sz[maxn];
ll cnt[maxn];
ll t[maxn];
 
void upd (ll id, ll x)
{
    for (; id < maxn; id += (id & (-id)))
    {
        t[id] += x;
    }
}
 
ll get (ll id)
{
    ll res = 0;
    for (; id >= 1; id -= (id & (-id)))
    {
        res += t[id];
    }
    return res;
}
 
ll rec ()
{
    ll x; cin >> x;
    if (!x)
    {
        ll v = ++nv;
        L[v] = rec ();
        R[v] = rec ();
        sz[v] = sz[L[v]] + sz[R[v]] + 1;
        cnt[v] = cnt[L[v]] + cnt[R[v]];
        return v;
    }
    sz[x] = 1, cnt[x] = 1;
    return x;
}

void add (ll v)
{
    if (v <= n) upd(v, 1);
    else add(L[v]), add(R[v]);
}

void clr (ll v)
{
    if (v <= n) upd(v, -1);
    else clr(L[v]), clr(R[v]);
}

ll calc (ll v)
{
    if (v <= n) return get(v);
    return calc(L[v]) + calc(R[v]);
}

void dfs (ll v = n + 1, bool keep = 1)
{
    if (v <= n)
    {
        add(v);
    }
    else
    {
        if (sz[L[v]] < sz[R[v]])
        {
            swap(L[v], R[v]);
        }
        dfs(R[v], 0);
        dfs(L[v], 1);
        ll inv = calc(R[v]);
      //  cout << v << ' ' << inv << ' ' << cnt[L[v]] << ' ' << cnt[R[v]] << nl;
        ans += min(1LL * inv, cnt[L[v]] * 1LL * cnt[R[v]] - inv);
        add(R[v]);
    }
    if (!keep)
    {
        clr(v);
    }
}

void ma1n (/* SABR */)
{
    cin >> n;
    nv = n;
    rec ();
    dfs ();
    cout << ans;
}
 
signed 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 0 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 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 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 724 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1492 KB Output is correct
2 Correct 6 ms 1072 KB Output is correct
3 Correct 19 ms 2020 KB Output is correct
4 Correct 5 ms 1364 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3160 KB Output is correct
2 Correct 17 ms 3844 KB Output is correct
3 Correct 18 ms 4820 KB Output is correct
4 Correct 18 ms 4820 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 8464 KB Output is correct
2 Correct 28 ms 6996 KB Output is correct
3 Correct 41 ms 5848 KB Output is correct
4 Correct 31 ms 5460 KB Output is correct

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 10164 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 1076 ms 10184 KB Time limit exceeded
2 Halted 0 ms 0 KB -