oj.uz

답안 #204179

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204179 2020-02-24T21:31:23 Z DS007 Bubble Sort 2 (JOI18_bubblesort2) C++14
60 / 100
 5698 ms 168648 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 1000;
map<int, int> m;
int t[N * 8], lazy[N * 8];
multiset<int> pos[N];

void push_down(int v) {
    t[v] += lazy[v];
    lazy[v * 2] += lazy[v];
    lazy[v * 2 + 1] += lazy[v];
    lazy[v] = 0;
}

void update(int v, int l, int r, int tl, int tr, int val) {
    if (tl > tr)
        return;
    push_down(v); push_down(v * 2); push_down(v * 2 + 1);
    if (l == tl && r == tr) {
        lazy[v] += val;
        push_down(v);
        return;
    }

    int mid = (l + r) / 2;
    update(v * 2, l, mid, tl, min(mid, tr), val);
    update(v * 2 + 1, mid + 1, r, max(tl, mid + 1), tr, val);
    t[v] = max(t[v * 2], t[v * 2 + 1]);
}

void add(int e, int i) {
    update(1, 0, N - 1, e, N - 1, -1);
    int dif = pos[e].empty() ? 0 : *pos[e].rbegin();
    pos[e].insert(i);
    dif = *pos[e].rbegin() - dif;
    update(1, 0, N - 1, e, e, dif);
}

void remove(int e, int i) {
    update(1, 0, N - 1, e, N - 1, 1);
    int dif = *pos[e].rbegin();
    pos[e].erase(i);
    dif = pos[e].empty() ? -dif : *pos[e].rbegin() - dif;
    update(1, 0, N - 1, e, e, dif);
}

vector<int> countScans(vector<int> a, vector<int> x, vector<int> v) {
    for (auto &i : a) m[i] = 0;
    for (auto &i : v) m[i] = 0;
    int cur = 0;
    for (auto &i : m) i.second = cur++;

    for (int i = 0; i < a.size(); i++) {
        a[i] = m[a[i]];
        add(a[i], i + 1);
    }

    vector<int> ans;
    for (int i = 0; i < x.size(); i++) {
        v[i] = m[v[i]];
        remove(a[x[i]], x[i] + 1);
        add(v[i], x[i] + 1);
        a[x[i]] = v[i];
        ans.push_back(t[1]);
        // cout << t[1] << "\n";
    }

    return ans;
}

/*signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    countScans({1, 2, 3, 4}, {0, 2}, {3, 1});
}*/

Compilation message

bubblesort2.cpp: In function 'std::vector<int> countScans(std::vector<int>, std::vector<int>, std::vector<int>)':
bubblesort2.cpp:54:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a.size(); i++) {
                     ~~^~~~~~~~~~
bubblesort2.cpp:60:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < x.size(); i++) {
                     ~~^~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 47608 KB Output is correct
2 Correct 40 ms 47736 KB Output is correct
3 Correct 48 ms 47992 KB Output is correct
4 Correct 44 ms 47992 KB Output is correct
5 Correct 45 ms 47992 KB Output is correct
6 Correct 50 ms 47992 KB Output is correct
7 Correct 43 ms 47992 KB Output is correct
8 Correct 44 ms 47864 KB Output is correct
9 Correct 42 ms 47992 KB Output is correct
10 Correct 42 ms 47992 KB Output is correct
11 Correct 42 ms 47992 KB Output is correct
12 Correct 42 ms 47992 KB Output is correct
13 Correct 42 ms 47992 KB Output is correct
14 Correct 49 ms 47992 KB Output is correct
15 Correct 46 ms 47912 KB Output is correct
16 Correct 43 ms 47992 KB Output is correct
17 Correct 42 ms 47992 KB Output is correct
18 Correct 42 ms 47992 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 47608 KB Output is correct
2 Correct 40 ms 47736 KB Output is correct
3 Correct 48 ms 47992 KB Output is correct
4 Correct 44 ms 47992 KB Output is correct
5 Correct 45 ms 47992 KB Output is correct
6 Correct 50 ms 47992 KB Output is correct
7 Correct 43 ms 47992 KB Output is correct
8 Correct 44 ms 47864 KB Output is correct
9 Correct 42 ms 47992 KB Output is correct
10 Correct 42 ms 47992 KB Output is correct
11 Correct 42 ms 47992 KB Output is correct
12 Correct 42 ms 47992 KB Output is correct
13 Correct 42 ms 47992 KB Output is correct
14 Correct 49 ms 47992 KB Output is correct
15 Correct 46 ms 47912 KB Output is correct
16 Correct 43 ms 47992 KB Output is correct
17 Correct 42 ms 47992 KB Output is correct
18 Correct 42 ms 47992 KB Output is correct
19 Correct 64 ms 49528 KB Output is correct
20 Correct 69 ms 49912 KB Output is correct
21 Correct 68 ms 49784 KB Output is correct
22 Correct 72 ms 49784 KB Output is correct
23 Correct 66 ms 49656 KB Output is correct
24 Correct 66 ms 49656 KB Output is correct
25 Correct 68 ms 49528 KB Output is correct
26 Correct 68 ms 49528 KB Output is correct
27 Correct 64 ms 49400 KB Output is correct
28 Correct 69 ms 49400 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 49144 KB Output is correct
2 Correct 152 ms 50552 KB Output is correct
3 Correct 239 ms 51832 KB Output is correct
4 Correct 235 ms 51576 KB Output is correct
5 Correct 221 ms 51576 KB Output is correct
6 Correct 232 ms 51704 KB Output is correct
7 Correct 219 ms 51576 KB Output is correct
8 Correct 217 ms 51704 KB Output is correct
9 Correct 236 ms 51704 KB Output is correct
10 Correct 217 ms 51704 KB Output is correct
11 Correct 204 ms 51904 KB Output is correct
12 Correct 198 ms 51704 KB Output is correct
13 Correct 207 ms 51580 KB Output is correct
14 Correct 204 ms 51704 KB Output is correct
15 Correct 205 ms 51704 KB Output is correct
16 Correct 192 ms 51576 KB Output is correct
17 Correct 210 ms 51824 KB Output is correct
18 Correct 202 ms 51576 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 47608 KB Output is correct
2 Correct 40 ms 47736 KB Output is correct
3 Correct 48 ms 47992 KB Output is correct
4 Correct 44 ms 47992 KB Output is correct
5 Correct 45 ms 47992 KB Output is correct
6 Correct 50 ms 47992 KB Output is correct
7 Correct 43 ms 47992 KB Output is correct
8 Correct 44 ms 47864 KB Output is correct
9 Correct 42 ms 47992 KB Output is correct
10 Correct 42 ms 47992 KB Output is correct
11 Correct 42 ms 47992 KB Output is correct
12 Correct 42 ms 47992 KB Output is correct
13 Correct 42 ms 47992 KB Output is correct
14 Correct 49 ms 47992 KB Output is correct
15 Correct 46 ms 47912 KB Output is correct
16 Correct 43 ms 47992 KB Output is correct
17 Correct 42 ms 47992 KB Output is correct
18 Correct 42 ms 47992 KB Output is correct
19 Correct 64 ms 49528 KB Output is correct
20 Correct 69 ms 49912 KB Output is correct
21 Correct 68 ms 49784 KB Output is correct
22 Correct 72 ms 49784 KB Output is correct
23 Correct 66 ms 49656 KB Output is correct
24 Correct 66 ms 49656 KB Output is correct
25 Correct 68 ms 49528 KB Output is correct
26 Correct 68 ms 49528 KB Output is correct
27 Correct 64 ms 49400 KB Output is correct
28 Correct 69 ms 49400 KB Output is correct
29 Correct 74 ms 49144 KB Output is correct
30 Correct 152 ms 50552 KB Output is correct
31 Correct 239 ms 51832 KB Output is correct
32 Correct 235 ms 51576 KB Output is correct
33 Correct 221 ms 51576 KB Output is correct
34 Correct 232 ms 51704 KB Output is correct
35 Correct 219 ms 51576 KB Output is correct
36 Correct 217 ms 51704 KB Output is correct
37 Correct 236 ms 51704 KB Output is correct
38 Correct 217 ms 51704 KB Output is correct
39 Correct 204 ms 51904 KB Output is correct
40 Correct 198 ms 51704 KB Output is correct
41 Correct 207 ms 51580 KB Output is correct
42 Correct 204 ms 51704 KB Output is correct
43 Correct 205 ms 51704 KB Output is correct
44 Correct 192 ms 51576 KB Output is correct
45 Correct 210 ms 51824 KB Output is correct
46 Correct 202 ms 51576 KB Output is correct
47 Correct 1524 ms 88580 KB Output is correct
48 Incorrect 5698 ms 168648 KB Output isn't correct
49 Halted 0 ms 0 KB -