oj.uz

Submission #874209

# Submission time Handle Problem Language Result Execution time Memory
874209 2023-11-16T12:52:49 Z sleepntsheep Tree Rotations (POI11_rot) C++17
63 / 100
 162 ms 14916 KB 
#include <assert.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>

#define N 200000
#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]) return 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; }
    if (B[l] < B[r])
    {
        int y1, y2;
        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
    {
        int y1, y2;
        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]);
    }
    else
    {
        int lt = dfs(b[u]);
        int rt = dfs(c[u]);
        int v; long long c2 = 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:107:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7260 KB Output is correct
2 Correct 6 ms 6748 KB Output is correct
3 Correct 14 ms 9592 KB Output is correct
4 Correct 5 ms 7260 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 10152 KB Output is correct
2 Correct 15 ms 11100 KB Output is correct
3 Correct 26 ms 11860 KB Output is correct
4 Correct 20 ms 11868 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 14916 KB Output is correct
2 Correct 34 ms 13404 KB Output is correct
3 Correct 43 ms 12368 KB Output is correct
4 Correct 162 ms 12116 KB Output is correct

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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

Subtask #11
0 / 10.0

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