oj.uz

Submission #874217

# Submission time Handle Problem Language Result Execution time Memory
874217 2023-11-16T12:57:35 Z sleepntsheep Tree Rotations (POI11_rot) C++17
100 / 100
 155 ms 23380 KB 
#include <assert.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>

#define N 1000000
#define M (20*N)
#define INLINE inline __attribute__((always_inline))

unsigned seed = 0x86868686;

INLINE unsigned rand_(void)
{
    return (seed << 3) ^ 0x3119475;
}

int n, id, a[N+1], b[N+1], c[N+1];

int A[M], B[M], L[M], R[M], S[M], alloc;

int read(void)
{
    int v = ++id;
    scanf("%d", a+v);
    if (!a[v]) b[v] = read(), c[v] = read();
    return v;
}

INLINE int treap0(int k)
{
    A[++alloc] = k; B[alloc] = rand_(); S[alloc] = 1;
    return alloc;
}

INLINE void pull(int v)
{
    S[v] = 1 + S[L[v]] + S[R[v]];
}

void split(int v, int *l, int *r, int val)
{
    if (!v) { *l=*r=0; return; }

    if (A[v] <= val)
    {
        split(R[v], &R[v], r, val);
        *l = v;
    }
    else
    {
        split(L[v], l, &L[v], val);
        *r = v;
    }
    pull(v);
}

long long inv, ans;

void merge(int *v, int l, int r)
{
    if (!l || !r) { *v = l^r; return; }
    int y1, y2;
    if (B[l] < B[r])
    {
        split(l, &y1, &y2, A[r]);
        inv += 1ll * S[y2] * (1+S[L[r]]);
        merge(R+r, R[r], y2);
        merge(L+r, L[r], y1);
        *v = r;
    }
    else
    {
        split(r, &y1, &y2, A[l]);
        inv += 1ll * S[y1] * (1+S[R[l]]);
        merge(R+l, R[l], y2);
        merge(L+l, L[l], y1);
        *v = l;
    }
    pull(*v);
}

int dfs(int u)
{
    if (a[u]) return treap0(a[u]);
    int lt = dfs(b[u]);
    int rt = dfs(c[u]);
    int v; long long c2 = 1ll*S[lt]*S[rt];
    inv = 0;
    merge(&v, lt, rt);
    ans += (inv > c2 - inv) ? c2 - inv : inv;
    return v;
}


int main()
{
    scanf("%d", &n);
    int root = read();
    dfs(root);
    printf("%lld", ans);

    return 0;
}

Compilation message

rot.cpp: In function 'int read()':
rot.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |     scanf("%d", a+v);
      |     ~~~~~^~~~~~~~~~~
rot.cpp: In function 'int main()':
rot.cpp:98:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 13148 KB Output is correct
2 Correct 7 ms 12888 KB Output is correct
3 Correct 14 ms 12892 KB Output is correct
4 Correct 5 ms 13148 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 13236 KB Output is correct
2 Correct 15 ms 14172 KB Output is correct
3 Correct 26 ms 14792 KB Output is correct
4 Correct 20 ms 14772 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 19328 KB Output is correct
2 Correct 37 ms 17756 KB Output is correct
3 Correct 43 ms 16716 KB Output is correct
4 Correct 155 ms 15976 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 16184 KB Output is correct
2 Correct 63 ms 17016 KB Output is correct
3 Correct 54 ms 19024 KB Output is correct
4 Correct 46 ms 18884 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 18724 KB Output is correct
2 Correct 53 ms 19028 KB Output is correct
3 Correct 105 ms 19348 KB Output is correct
4 Correct 144 ms 19024 KB Output is correct
5 Correct 96 ms 18004 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 17832 KB Output is correct
2 Correct 79 ms 22612 KB Output is correct
3 Correct 116 ms 21444 KB Output is correct
4 Correct 74 ms 23380 KB Output is correct
5 Correct 104 ms 18516 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 17520 KB Output is correct
2 Correct 132 ms 19908 KB Output is correct
3 Correct 110 ms 18612 KB Output is correct
4 Correct 112 ms 19284 KB Output is correct
5 Correct 119 ms 23244 KB Output is correct
6 Correct 80 ms 18812 KB Output is correct