oj.uz

답안 #680567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680567 2023-01-11T09:08:37 Z nutella Bubble Sort 2 (JOI18_bubblesort2) C++17
60 / 100
 901 ms 26568 KB 
#include <bits/stdc++.h>
#include "bubblesort2.h"

using namespace std;

mt19937 rnd(228);

struct Info {
    int mx = 0;

    Info() = default;

    explicit Info(int x) : mx(x) {}
};

Info operator+(Info a, Info b) {
    return Info{max(a.mx, b.mx)};
}

struct Tag {
    int add = 0;

    Tag() = default;

    explicit Tag(int x) : add(x) {}
};

void apply(Info &a, Tag &b) {
    a.mx += b.add;
}

void apply(Tag &a, Tag &b) {
    a.add += b.add;
}

using key_type = pair<int, int>;

struct Node {
    int y = 0, sz = 0;
    key_type key{};
    Info mine{}, subtree{};
    Tag tag{};

    int L = 0, R = 0;

    Node() = default;

    Node(int prior, key_type key, int siz, Info val) : y(prior), key(key), sz(siz), mine(val), subtree(val) {}
};

void apply(Node &x, Tag &b) {
    apply(x.tag, b);
    apply(x.mine, b);
    apply(x.subtree, b);
}

vector<Node> t{{}};

int create(Node b = Node()) {
    t.emplace_back(b);
    return t.size() - 1;
}

void apply(int x, Tag b) {
    apply(t[x], b);
}

void push(int x) {
    apply(t[x].L, t[x].tag);
    apply(t[x].R, t[x].tag);
    t[x].tag = Tag();
}

void pull(int x) {
    t[x].sz = 1 + t[t[x].L].sz + t[t[x].R].sz;
    t[x].subtree = t[t[x].L].subtree + t[x].mine + t[t[x].R].subtree;
}

int merge(int l, int r) {
    if (!l || !r) return l ^ r;
    push(l), push(r);
    if (t[l].y > t[r].y) {
        t[l].R = merge(t[l].R, r);
        pull(l);
        return l;
    } else {
        t[r].L = merge(l, t[r].L);
        pull(r);
        return r;
    }
}

//key <= k
pair<int, int> split_key(int x, key_type k) {
    if (!x) return {};
    push(x);
    if (t[x].key > k) {
        auto se = split_key(t[x].L, k);
        t[x].L = se.second;
        pull(x);
        return {se.first, x};
    } else {
        auto se = split_key(t[x].R, k);
        t[x].R = se.first;
        pull(x);
        return {x, se.second};
    }
}

//left contains siz
pair<int, int> split_sz(int x, int siz) {
    if (!x) return {};
    push(x);
    if (t[t[x].L].sz >= siz) {
        auto se = split_sz(t[x].L, siz);
        t[x].L = se.second;
        pull(x);
        return {se.first, x};
    } else {
        auto se = split_sz(t[x].R, siz - t[t[x].L].sz - 1);
        t[x].R = se.first;
        pull(x);
        return {x, se.second};
    }
}

void debug_node(int x, string pref = "") {
    if (!x) {
        return;
    }
    pref += "->" + to_string(x);
    debug_node(t[x].L, pref);
    cout << pref << endl;
    debug_node(t[x].R, pref);
}

std::vector<int> countScans(std::vector<int> A, std::vector<int> X, std::vector<int> V) {
    int Q = X.size(), n = A.size();

    int root = 0;

    auto insert = [&](int i) {
        auto [L, R] = split_key(root, {A[i], i});

        Node now = Node(rnd(), {A[i], i}, 1, Info(i - t[L].sz));

        int x = create(now);

        apply(R, Tag(-1));

        root = merge(L, merge(x, R));
    };

    auto erase = [&](int i) {
        auto [LL, R] = split_key(root, {A[i], i});

        auto [L, trash] = split_sz(LL, t[LL].sz - 1);

        apply(R, Tag(1));

        root = merge(L, R);
    };

    for (int i = 0; i < n; ++i) {
        insert(i);
    }

    std::vector<int> answer(Q);
    for (int j = 0; j < Q; j++) {
        int i = X[j];

        erase(i);
        A[i] = V[j];
        insert(i);

        answer[j] = t[root].subtree.mx;
    }
    return answer;
}

Compilation message

bubblesort2.cpp: In constructor 'Node::Node(int, key_type, int, Info)':
bubblesort2.cpp:40:14: warning: 'Node::key' will be initialized after [-Wreorder]
   40 |     key_type key{};
      |              ^~~
bubblesort2.cpp:39:16: warning:   'int Node::sz' [-Wreorder]
   39 |     int y = 0, sz = 0;
      |                ^~
bubblesort2.cpp:48:5: warning:   when initialized here [-Wreorder]
   48 |     Node(int prior, key_type key, int siz, Info val) : y(prior), key(key), sz(siz), mine(val), subtree(val) {}
      |     ^~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 4 ms 444 KB Output is correct
3 Correct 8 ms 684 KB Output is correct
4 Correct 7 ms 684 KB Output is correct
5 Correct 7 ms 692 KB Output is correct
6 Correct 7 ms 596 KB Output is correct
7 Correct 8 ms 692 KB Output is correct
8 Correct 7 ms 624 KB Output is correct
9 Correct 7 ms 596 KB Output is correct
10 Correct 7 ms 596 KB Output is correct
11 Correct 7 ms 596 KB Output is correct
12 Correct 7 ms 596 KB Output is correct
13 Correct 7 ms 596 KB Output is correct
14 Correct 7 ms 648 KB Output is correct
15 Correct 8 ms 688 KB Output is correct
16 Correct 7 ms 572 KB Output is correct
17 Correct 7 ms 596 KB Output is correct
18 Correct 8 ms 568 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 4 ms 444 KB Output is correct
3 Correct 8 ms 684 KB Output is correct
4 Correct 7 ms 684 KB Output is correct
5 Correct 7 ms 692 KB Output is correct
6 Correct 7 ms 596 KB Output is correct
7 Correct 8 ms 692 KB Output is correct
8 Correct 7 ms 624 KB Output is correct
9 Correct 7 ms 596 KB Output is correct
10 Correct 7 ms 596 KB Output is correct
11 Correct 7 ms 596 KB Output is correct
12 Correct 7 ms 596 KB Output is correct
13 Correct 7 ms 596 KB Output is correct
14 Correct 7 ms 648 KB Output is correct
15 Correct 8 ms 688 KB Output is correct
16 Correct 7 ms 572 KB Output is correct
17 Correct 7 ms 596 KB Output is correct
18 Correct 8 ms 568 KB Output is correct
19 Correct 27 ms 1328 KB Output is correct
20 Correct 34 ms 1360 KB Output is correct
21 Correct 33 ms 1364 KB Output is correct
22 Correct 31 ms 1376 KB Output is correct
23 Correct 33 ms 1368 KB Output is correct
24 Correct 34 ms 1316 KB Output is correct
25 Correct 30 ms 1328 KB Output is correct
26 Correct 33 ms 1320 KB Output is correct
27 Correct 34 ms 1328 KB Output is correct
28 Correct 31 ms 1364 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 1752 KB Output is correct
2 Correct 146 ms 3704 KB Output is correct
3 Correct 261 ms 6876 KB Output is correct
4 Correct 251 ms 6808 KB Output is correct
5 Correct 261 ms 6832 KB Output is correct
6 Correct 233 ms 6812 KB Output is correct
7 Correct 235 ms 6872 KB Output is correct
8 Correct 265 ms 6940 KB Output is correct
9 Correct 255 ms 6876 KB Output is correct
10 Correct 172 ms 6900 KB Output is correct
11 Correct 175 ms 6844 KB Output is correct
12 Correct 186 ms 6848 KB Output is correct
13 Correct 153 ms 6836 KB Output is correct
14 Correct 176 ms 6920 KB Output is correct
15 Correct 164 ms 6900 KB Output is correct
16 Correct 155 ms 6816 KB Output is correct
17 Correct 140 ms 6940 KB Output is correct
18 Correct 149 ms 6844 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 4 ms 444 KB Output is correct
3 Correct 8 ms 684 KB Output is correct
4 Correct 7 ms 684 KB Output is correct
5 Correct 7 ms 692 KB Output is correct
6 Correct 7 ms 596 KB Output is correct
7 Correct 8 ms 692 KB Output is correct
8 Correct 7 ms 624 KB Output is correct
9 Correct 7 ms 596 KB Output is correct
10 Correct 7 ms 596 KB Output is correct
11 Correct 7 ms 596 KB Output is correct
12 Correct 7 ms 596 KB Output is correct
13 Correct 7 ms 596 KB Output is correct
14 Correct 7 ms 648 KB Output is correct
15 Correct 8 ms 688 KB Output is correct
16 Correct 7 ms 572 KB Output is correct
17 Correct 7 ms 596 KB Output is correct
18 Correct 8 ms 568 KB Output is correct
19 Correct 27 ms 1328 KB Output is correct
20 Correct 34 ms 1360 KB Output is correct
21 Correct 33 ms 1364 KB Output is correct
22 Correct 31 ms 1376 KB Output is correct
23 Correct 33 ms 1368 KB Output is correct
24 Correct 34 ms 1316 KB Output is correct
25 Correct 30 ms 1328 KB Output is correct
26 Correct 33 ms 1320 KB Output is correct
27 Correct 34 ms 1328 KB Output is correct
28 Correct 31 ms 1364 KB Output is correct
29 Correct 46 ms 1752 KB Output is correct
30 Correct 146 ms 3704 KB Output is correct
31 Correct 261 ms 6876 KB Output is correct
32 Correct 251 ms 6808 KB Output is correct
33 Correct 261 ms 6832 KB Output is correct
34 Correct 233 ms 6812 KB Output is correct
35 Correct 235 ms 6872 KB Output is correct
36 Correct 265 ms 6940 KB Output is correct
37 Correct 255 ms 6876 KB Output is correct
38 Correct 172 ms 6900 KB Output is correct
39 Correct 175 ms 6844 KB Output is correct
40 Correct 186 ms 6848 KB Output is correct
41 Correct 153 ms 6836 KB Output is correct
42 Correct 176 ms 6920 KB Output is correct
43 Correct 164 ms 6900 KB Output is correct
44 Correct 155 ms 6816 KB Output is correct
45 Correct 140 ms 6940 KB Output is correct
46 Correct 149 ms 6844 KB Output is correct
47 Incorrect 901 ms 26568 KB Output isn't correct
48 Halted 0 ms 0 KB -