oj.uz

Submission #894181

# Submission time Handle Problem Language Result Execution time Memory
894181 2023-12-28T02:20:11 Z vovik Bubble Sort 2 (JOI18_bubblesort2) C++
100 / 100
 2111 ms 41632 KB 
#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;
}

Compilation message

bubblesort2.cpp: In function 'std::pair<int, int> split(int, std::pair<int, int>)':
bubblesort2.cpp:31:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   31 |         auto [a, b] = split(t[v].R, x);
      |              ^
bubblesort2.cpp:34:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   34 |     auto [a, b] = split(t[v].L, x);
      |          ^
bubblesort2.cpp: In function 'void add(int&, std::pair<int, int>)':
bubblesort2.cpp:39:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   39 |     auto [a, b] = split(v, x);
      |          ^
bubblesort2.cpp: In function 'void del(int&, std::pair<int, int>)':
bubblesort2.cpp:46:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   46 |     auto [a, b] = split(v, x);
      |          ^
bubblesort2.cpp:47:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   47 |     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:55:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for (int i = 0; i < A.size(); ++i) add(v, {A[i], i});
      |                     ~~^~~~~~~~~~
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 < 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 11 ms 27740 KB Output is correct
2 Correct 15 ms 27740 KB Output is correct
3 Correct 13 ms 27740 KB Output is correct
4 Correct 16 ms 27736 KB Output is correct
5 Correct 19 ms 27740 KB Output is correct
6 Correct 13 ms 27740 KB Output is correct
7 Correct 12 ms 27740 KB Output is correct
8 Correct 12 ms 27740 KB Output is correct
9 Correct 13 ms 27736 KB Output is correct
10 Correct 12 ms 27784 KB Output is correct
11 Correct 13 ms 27740 KB Output is correct
12 Correct 13 ms 27740 KB Output is correct
13 Correct 13 ms 27736 KB Output is correct
14 Correct 13 ms 27736 KB Output is correct
15 Correct 13 ms 27740 KB Output is correct
16 Correct 12 ms 27740 KB Output is correct
17 Correct 13 ms 27740 KB Output is correct
18 Correct 12 ms 27740 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 27740 KB Output is correct
2 Correct 15 ms 27740 KB Output is correct
3 Correct 13 ms 27740 KB Output is correct
4 Correct 16 ms 27736 KB Output is correct
5 Correct 19 ms 27740 KB Output is correct
6 Correct 13 ms 27740 KB Output is correct
7 Correct 12 ms 27740 KB Output is correct
8 Correct 12 ms 27740 KB Output is correct
9 Correct 13 ms 27736 KB Output is correct
10 Correct 12 ms 27784 KB Output is correct
11 Correct 13 ms 27740 KB Output is correct
12 Correct 13 ms 27740 KB Output is correct
13 Correct 13 ms 27736 KB Output is correct
14 Correct 13 ms 27736 KB Output is correct
15 Correct 13 ms 27740 KB Output is correct
16 Correct 12 ms 27740 KB Output is correct
17 Correct 13 ms 27740 KB Output is correct
18 Correct 12 ms 27740 KB Output is correct
19 Correct 22 ms 27992 KB Output is correct
20 Correct 25 ms 27996 KB Output is correct
21 Correct 24 ms 27992 KB Output is correct
22 Correct 24 ms 28052 KB Output is correct
23 Correct 23 ms 28296 KB Output is correct
24 Correct 23 ms 27996 KB Output is correct
25 Correct 22 ms 28036 KB Output is correct
26 Correct 22 ms 27992 KB Output is correct
27 Correct 24 ms 27996 KB Output is correct
28 Correct 24 ms 27996 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 27996 KB Output is correct
2 Correct 73 ms 28628 KB Output is correct
3 Correct 124 ms 29268 KB Output is correct
4 Correct 130 ms 29036 KB Output is correct
5 Correct 119 ms 29020 KB Output is correct
6 Correct 118 ms 29020 KB Output is correct
7 Correct 131 ms 29020 KB Output is correct
8 Correct 128 ms 29448 KB Output is correct
9 Correct 121 ms 29196 KB Output is correct
10 Correct 84 ms 29020 KB Output is correct
11 Correct 88 ms 29264 KB Output is correct
12 Correct 82 ms 29016 KB Output is correct
13 Correct 71 ms 29188 KB Output is correct
14 Correct 73 ms 29020 KB Output is correct
15 Correct 71 ms 29020 KB Output is correct
16 Correct 64 ms 29016 KB Output is correct
17 Correct 61 ms 29020 KB Output is correct
18 Correct 61 ms 29020 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 27740 KB Output is correct
2 Correct 15 ms 27740 KB Output is correct
3 Correct 13 ms 27740 KB Output is correct
4 Correct 16 ms 27736 KB Output is correct
5 Correct 19 ms 27740 KB Output is correct
6 Correct 13 ms 27740 KB Output is correct
7 Correct 12 ms 27740 KB Output is correct
8 Correct 12 ms 27740 KB Output is correct
9 Correct 13 ms 27736 KB Output is correct
10 Correct 12 ms 27784 KB Output is correct
11 Correct 13 ms 27740 KB Output is correct
12 Correct 13 ms 27740 KB Output is correct
13 Correct 13 ms 27736 KB Output is correct
14 Correct 13 ms 27736 KB Output is correct
15 Correct 13 ms 27740 KB Output is correct
16 Correct 12 ms 27740 KB Output is correct
17 Correct 13 ms 27740 KB Output is correct
18 Correct 12 ms 27740 KB Output is correct
19 Correct 22 ms 27992 KB Output is correct
20 Correct 25 ms 27996 KB Output is correct
21 Correct 24 ms 27992 KB Output is correct
22 Correct 24 ms 28052 KB Output is correct
23 Correct 23 ms 28296 KB Output is correct
24 Correct 23 ms 27996 KB Output is correct
25 Correct 22 ms 28036 KB Output is correct
26 Correct 22 ms 27992 KB Output is correct
27 Correct 24 ms 27996 KB Output is correct
28 Correct 24 ms 27996 KB Output is correct
29 Correct 37 ms 27996 KB Output is correct
30 Correct 73 ms 28628 KB Output is correct
31 Correct 124 ms 29268 KB Output is correct
32 Correct 130 ms 29036 KB Output is correct
33 Correct 119 ms 29020 KB Output is correct
34 Correct 118 ms 29020 KB Output is correct
35 Correct 131 ms 29020 KB Output is correct
36 Correct 128 ms 29448 KB Output is correct
37 Correct 121 ms 29196 KB Output is correct
38 Correct 84 ms 29020 KB Output is correct
39 Correct 88 ms 29264 KB Output is correct
40 Correct 82 ms 29016 KB Output is correct
41 Correct 71 ms 29188 KB Output is correct
42 Correct 73 ms 29020 KB Output is correct
43 Correct 71 ms 29020 KB Output is correct
44 Correct 64 ms 29016 KB Output is correct
45 Correct 61 ms 29020 KB Output is correct
46 Correct 61 ms 29020 KB Output is correct
47 Correct 400 ms 31784 KB Output is correct
48 Correct 1719 ms 40620 KB Output is correct
49 Correct 2027 ms 41532 KB Output is correct
50 Correct 1995 ms 41532 KB Output is correct
51 Correct 2111 ms 41536 KB Output is correct
52 Correct 1955 ms 41536 KB Output is correct
53 Correct 1958 ms 41556 KB Output is correct
54 Correct 1761 ms 41540 KB Output is correct
55 Correct 1970 ms 41540 KB Output is correct
56 Correct 1764 ms 41532 KB Output is correct
57 Correct 1975 ms 41540 KB Output is correct
58 Correct 1778 ms 41544 KB Output is correct
59 Correct 1566 ms 41540 KB Output is correct
60 Correct 1584 ms 41540 KB Output is correct
61 Correct 1576 ms 41328 KB Output is correct
62 Correct 1578 ms 41532 KB Output is correct
63 Correct 1605 ms 41552 KB Output is correct
64 Correct 1513 ms 41528 KB Output is correct
65 Correct 1416 ms 41632 KB Output is correct
66 Correct 1471 ms 41540 KB Output is correct
67 Correct 1549 ms 41540 KB Output is correct