oj.uz

Submission #894180

# Submission time Handle Problem Language Result Execution time Memory
894180 2023-12-28T02:19:20 Z vovik Bubble Sort 2 (JOI18_bubblesort2) C++
100 / 100
 2375 ms 41556 KB 
#pragma GCC optimize(3)
#include <bits/stdc++.h>

std::vector<int> countScans(std::vector<int> A, std::vector<int> X, std::vector<int> V);

struct node {
    std::pair<int, int> x{};
    int y = rand();
    int L = 0, R = 0;
    int sz = 1;
    int cost = -1e9;
};

const int N = 1e6 + 5;
node t[N];
int cur = 0;

void pull(int v) {
    t[v].sz = t[t[v].L].sz + t[t[v].R].sz + 1;
    t[v].cost = std::max({t[t[v].L].cost, t[v].x.second - t[t[v].L].sz, t[t[v].R].cost - t[t[v].L].sz - 1});
}

int merge(int v, int u) {
    if (!v || !u) return v | u;
    if (t[v].y > t[u].y) return t[v].R = merge(t[v].R, u), pull(v), v;
    return pull(t[u].L = merge(v, t[u].L)), pull(u), u;
}

std::pair<int, int> split(int v, std::pair<int, int> x) {
    if (!v) return {v, v};
    if (t[v].x <= x) {
        auto [a, b] = split(t[v].R, x);
        return t[v].R = a, pull(v), std::pair<int, int>{v, b};
    }
    auto [a, b] = split(t[v].L, x);
    return t[v].L = b, pull(v), std::pair<int, int>{a, v};
}

void add(int&v, std::pair<int, int> x) {
    auto [a, b] = split(v, x);
    t[++cur].x = x;
    pull(cur);
    v = merge(merge(a, cur), b);
}

void del(int&v, std::pair<int, int> x) {
    auto [a, b] = split(v, x);
    auto [y, z] = split(a, {x.first, x.second - 1});
    v = merge(y, b);
}

std::vector<int> countScans(std::vector<int> A, std::vector<int> X, std::vector<int> V) {
    t[0].sz = 0;
    std::vector<int> ans(X.size());
    int v = 0;
    for (int i = 0; i < A.size(); ++i) add(v, {A[i], i});
    for (int i = 0; i < X.size(); ++i) del(v, {A[X[i]], X[i]}), A[X[i]] = V[i], add(v, {A[X[i]], X[i]}), ans[i] = t[v].cost;
    return ans;
}


#ifdef __APPLE__
#include <cstdio>
#include <cstdlib>
#include <vector>

int readInt() {
    int i;
    if (scanf("%d", &i) != 1) {
        fprintf(stderr, "Error while reading input\n");
        exit(1);
    }
    return i;
}

int main() {
    int N, Q;
    N = readInt();
    Q = readInt();

    std::vector<int> A(N);
    for (int i = 0; i < N; i++)
        A[i] = readInt();

    std::vector<int> X(Q), V(Q);
    for (int j = 0; j < Q; j++) {
        X[j] = readInt();
        V[j] = readInt();
    }

    std::vector<int> res = countScans(A, X, V);

    for (int j = 0; j < int(res.size()); j++)
        printf("%d\n", res[j]);
}
#endif

Compilation message

bubblesort2.cpp: In function 'std::pair<int, int> split(int, std::pair<int, int>)':
bubblesort2.cpp:32:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |         auto [a, b] = split(t[v].R, x);
      |              ^
bubblesort2.cpp:35:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |     auto [a, b] = split(t[v].L, x);
      |          ^
bubblesort2.cpp: In function 'void add(int&, std::pair<int, int>)':
bubblesort2.cpp:40:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   40 |     auto [a, b] = split(v, x);
      |          ^
bubblesort2.cpp: In function 'void del(int&, std::pair<int, int>)':
bubblesort2.cpp:47:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   47 |     auto [a, b] = split(v, x);
      |          ^
bubblesort2.cpp:48:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   48 |     auto [y, z] = split(a, {x.first, x.second - 1});
      |          ^
bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:56:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 0; i < A.size(); ++i) add(v, {A[i], i});
      |                     ~~^~~~~~~~~~
bubblesort2.cpp:57:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for (int i = 0; i < X.size(); ++i) del(v, {A[X[i]], X[i]}), A[X[i]] = V[i], add(v, {A[X[i]], X[i]}), ans[i] = t[v].cost;
      |                     ~~^~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27740 KB Output is correct
2 Correct 14 ms 27760 KB Output is correct
3 Correct 20 ms 27780 KB Output is correct
4 Correct 15 ms 27740 KB Output is correct
5 Correct 15 ms 27736 KB Output is correct
6 Correct 15 ms 27740 KB Output is correct
7 Correct 15 ms 27740 KB Output is correct
8 Correct 15 ms 27888 KB Output is correct
9 Correct 15 ms 27740 KB Output is correct
10 Correct 15 ms 27740 KB Output is correct
11 Correct 15 ms 27780 KB Output is correct
12 Correct 20 ms 27736 KB Output is correct
13 Correct 15 ms 27736 KB Output is correct
14 Correct 15 ms 27740 KB Output is correct
15 Correct 20 ms 27872 KB Output is correct
16 Correct 15 ms 27784 KB Output is correct
17 Correct 15 ms 27740 KB Output is correct
18 Correct 15 ms 27884 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27740 KB Output is correct
2 Correct 14 ms 27760 KB Output is correct
3 Correct 20 ms 27780 KB Output is correct
4 Correct 15 ms 27740 KB Output is correct
5 Correct 15 ms 27736 KB Output is correct
6 Correct 15 ms 27740 KB Output is correct
7 Correct 15 ms 27740 KB Output is correct
8 Correct 15 ms 27888 KB Output is correct
9 Correct 15 ms 27740 KB Output is correct
10 Correct 15 ms 27740 KB Output is correct
11 Correct 15 ms 27780 KB Output is correct
12 Correct 20 ms 27736 KB Output is correct
13 Correct 15 ms 27736 KB Output is correct
14 Correct 15 ms 27740 KB Output is correct
15 Correct 20 ms 27872 KB Output is correct
16 Correct 15 ms 27784 KB Output is correct
17 Correct 15 ms 27740 KB Output is correct
18 Correct 15 ms 27884 KB Output is correct
19 Correct 27 ms 28020 KB Output is correct
20 Correct 27 ms 28028 KB Output is correct
21 Correct 26 ms 27996 KB Output is correct
22 Correct 27 ms 27992 KB Output is correct
23 Correct 36 ms 27996 KB Output is correct
24 Correct 26 ms 27996 KB Output is correct
25 Correct 26 ms 27996 KB Output is correct
26 Correct 25 ms 27924 KB Output is correct
27 Correct 35 ms 28048 KB Output is correct
28 Correct 26 ms 27968 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 27992 KB Output is correct
2 Correct 74 ms 28596 KB Output is correct
3 Correct 135 ms 29008 KB Output is correct
4 Correct 128 ms 29196 KB Output is correct
5 Correct 130 ms 29016 KB Output is correct
6 Correct 123 ms 29264 KB Output is correct
7 Correct 125 ms 29196 KB Output is correct
8 Correct 133 ms 29192 KB Output is correct
9 Correct 125 ms 29016 KB Output is correct
10 Correct 88 ms 29192 KB Output is correct
11 Correct 89 ms 29016 KB Output is correct
12 Correct 82 ms 29020 KB Output is correct
13 Correct 75 ms 29012 KB Output is correct
14 Correct 75 ms 29192 KB Output is correct
15 Correct 72 ms 29200 KB Output is correct
16 Correct 64 ms 29264 KB Output is correct
17 Correct 63 ms 29196 KB Output is correct
18 Correct 63 ms 29008 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27740 KB Output is correct
2 Correct 14 ms 27760 KB Output is correct
3 Correct 20 ms 27780 KB Output is correct
4 Correct 15 ms 27740 KB Output is correct
5 Correct 15 ms 27736 KB Output is correct
6 Correct 15 ms 27740 KB Output is correct
7 Correct 15 ms 27740 KB Output is correct
8 Correct 15 ms 27888 KB Output is correct
9 Correct 15 ms 27740 KB Output is correct
10 Correct 15 ms 27740 KB Output is correct
11 Correct 15 ms 27780 KB Output is correct
12 Correct 20 ms 27736 KB Output is correct
13 Correct 15 ms 27736 KB Output is correct
14 Correct 15 ms 27740 KB Output is correct
15 Correct 20 ms 27872 KB Output is correct
16 Correct 15 ms 27784 KB Output is correct
17 Correct 15 ms 27740 KB Output is correct
18 Correct 15 ms 27884 KB Output is correct
19 Correct 27 ms 28020 KB Output is correct
20 Correct 27 ms 28028 KB Output is correct
21 Correct 26 ms 27996 KB Output is correct
22 Correct 27 ms 27992 KB Output is correct
23 Correct 36 ms 27996 KB Output is correct
24 Correct 26 ms 27996 KB Output is correct
25 Correct 26 ms 27996 KB Output is correct
26 Correct 25 ms 27924 KB Output is correct
27 Correct 35 ms 28048 KB Output is correct
28 Correct 26 ms 27968 KB Output is correct
29 Correct 33 ms 27992 KB Output is correct
30 Correct 74 ms 28596 KB Output is correct
31 Correct 135 ms 29008 KB Output is correct
32 Correct 128 ms 29196 KB Output is correct
33 Correct 130 ms 29016 KB Output is correct
34 Correct 123 ms 29264 KB Output is correct
35 Correct 125 ms 29196 KB Output is correct
36 Correct 133 ms 29192 KB Output is correct
37 Correct 125 ms 29016 KB Output is correct
38 Correct 88 ms 29192 KB Output is correct
39 Correct 89 ms 29016 KB Output is correct
40 Correct 82 ms 29020 KB Output is correct
41 Correct 75 ms 29012 KB Output is correct
42 Correct 75 ms 29192 KB Output is correct
43 Correct 72 ms 29200 KB Output is correct
44 Correct 64 ms 29264 KB Output is correct
45 Correct 63 ms 29196 KB Output is correct
46 Correct 63 ms 29008 KB Output is correct
47 Correct 416 ms 31812 KB Output is correct
48 Correct 2181 ms 40620 KB Output is correct
49 Correct 2040 ms 41532 KB Output is correct
50 Correct 2375 ms 41540 KB Output is correct
51 Correct 2308 ms 41540 KB Output is correct
52 Correct 2201 ms 41540 KB Output is correct
53 Correct 2008 ms 41536 KB Output is correct
54 Correct 2044 ms 41540 KB Output is correct
55 Correct 2001 ms 41536 KB Output is correct
56 Correct 1888 ms 41296 KB Output is correct
57 Correct 2221 ms 41540 KB Output is correct
58 Correct 1870 ms 41536 KB Output is correct
59 Correct 1610 ms 41536 KB Output is correct
60 Correct 1675 ms 41332 KB Output is correct
61 Correct 1558 ms 41552 KB Output is correct
62 Correct 1626 ms 41540 KB Output is correct
63 Correct 1573 ms 41556 KB Output is correct
64 Correct 1489 ms 41544 KB Output is correct
65 Correct 1497 ms 41536 KB Output is correct
66 Correct 1477 ms 41556 KB Output is correct
67 Correct 1522 ms 41536 KB Output is correct