oj.uz

Submission #542516

# Submission time Handle Problem Language Result Execution time Memory
542516 2022-03-26T19:55:27 Z tabr Dancing Elephants (IOI11_elephants) C++17
100 / 100
 8772 ms 12088 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

const int MAX_N = 150015;
const int MAX_B = 500;
int B;
int n;
int l;
int upd_cnt;
int x[MAX_N];
pair<int, int> pos[MAX_N];
int jump_cnt[MAX_N];
int jump_pos[MAX_N];
vector<int> e[MAX_B];
int order[MAX_N];

void init(int n_, int l_, int x_[]) {
    n = n_;
    l = l_;
    B = (int) sqrt(n_);
    for (int i = 0; i < n; i++) {
        x[i] = x_[i];
    }
    iota(order, order + n, 0);
}

void build_one(int id) {
    for (int i = 0; i < (int) e[id].size(); i++) {
        pos[e[id][i]] = make_pair(id, i);
    }
    for (int i = (int) e[id].size() - 1, j = (int) e[id].size(); i >= 0; i--) {
        while (j > 0 && x[e[id][j - 1]] > x[e[id][i]] + l) {
            j--;
        }
        if (j == (int) e[id].size()) {
            jump_cnt[e[id][i]] = 1;
            jump_pos[e[id][i]] = x[e[id][i]] + l + 1;
        } else {
            jump_cnt[e[id][i]] = jump_cnt[e[id][j]] + 1;
            jump_pos[e[id][i]] = jump_pos[e[id][j]];
        }
    }
}

void build() {
    sort(order, order + n, [&](int i, int j) {
        return x[i] < x[j];
    });
    for (int i = 0; i < B; i++) {
        e[i] = vector<int>(order + n * i / B, order + n * (i + 1) / B);
        build_one(i);
    }
}

int update(int i, int y) {
    if (n == 1) {
        return 1;
    }
    if (upd_cnt == 0) {
        build();
    }
    upd_cnt++;
    if (upd_cnt == n / B - 1) {
        upd_cnt = 0;
    }
    // remove x[i]
    e[pos[i].first].erase(e[pos[i].first].begin() + pos[i].second);
    build_one(pos[i].first);
    // add x[i]
    x[i] = y;
    for (int id = 0; id < B; id++) {
        if (id == B - 1 || x[e[id + 1][0]] > y) {
            x[150001] = y;
            auto iter = lower_bound(e[id].begin(), e[id].end(), 150001, [&](int j, int k) {
                return x[j] < x[k];
            });
            e[id].insert(iter, i);
            build_one(id);
            break;
        }
    }
    // answer
    int ans = 0;
    int now = 0;
    for (int id = 0; id < B; id++) {
        x[150001] = now;
        auto iter = lower_bound(e[id].begin(), e[id].end(), 150001, [&](int j, int k) {
            return x[j] < x[k];
        });
        if (iter == e[id].end()) {
            continue;
        }
        ans += jump_cnt[*iter];
        now = jump_pos[*iter];
    }
    return ans;
}

#ifdef tabr
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n_ = 4;
    int l_ = 10;
    int x_[10];
    x_[0] = 10;
    x_[1] = 15;
    x_[2] = 17;
    x_[3] = 20;
    init(n_, l_, x_);
    debug(update(2, 16));  // 1
    debug(update(1, 25));  // 2
    debug(update(3, 35));  // 2
    debug(update(0, 38));  // 2
    debug(update(2, 0));   // 3
    return 0;
}
#endif

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 407 ms 1336 KB Output is correct
8 Correct 509 ms 1488 KB Output is correct
9 Correct 745 ms 2516 KB Output is correct
10 Correct 1525 ms 2516 KB Output is correct
11 Correct 1554 ms 2576 KB Output is correct
12 Correct 1527 ms 2692 KB Output is correct
13 Correct 1643 ms 2508 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 407 ms 1336 KB Output is correct
8 Correct 509 ms 1488 KB Output is correct
9 Correct 745 ms 2516 KB Output is correct
10 Correct 1525 ms 2516 KB Output is correct
11 Correct 1554 ms 2576 KB Output is correct
12 Correct 1527 ms 2692 KB Output is correct
13 Correct 1643 ms 2508 KB Output is correct
14 Correct 685 ms 1804 KB Output is correct
15 Correct 815 ms 1908 KB Output is correct
16 Correct 1873 ms 3020 KB Output is correct
17 Correct 2436 ms 3608 KB Output is correct
18 Correct 2776 ms 3728 KB Output is correct
19 Correct 2433 ms 3372 KB Output is correct
20 Correct 2487 ms 3832 KB Output is correct
21 Correct 2671 ms 3596 KB Output is correct
22 Correct 2600 ms 3368 KB Output is correct

Subtask #5
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 407 ms 1336 KB Output is correct
8 Correct 509 ms 1488 KB Output is correct
9 Correct 745 ms 2516 KB Output is correct
10 Correct 1525 ms 2516 KB Output is correct
11 Correct 1554 ms 2576 KB Output is correct
12 Correct 1527 ms 2692 KB Output is correct
13 Correct 1643 ms 2508 KB Output is correct
14 Correct 685 ms 1804 KB Output is correct
15 Correct 815 ms 1908 KB Output is correct
16 Correct 1873 ms 3020 KB Output is correct
17 Correct 2436 ms 3608 KB Output is correct
18 Correct 2776 ms 3728 KB Output is correct
19 Correct 2433 ms 3372 KB Output is correct
20 Correct 2487 ms 3832 KB Output is correct
21 Correct 2671 ms 3596 KB Output is correct
22 Correct 2600 ms 3368 KB Output is correct
23 Correct 4442 ms 6920 KB Output is correct
24 Correct 4581 ms 6812 KB Output is correct
25 Correct 3779 ms 6788 KB Output is correct
26 Correct 8772 ms 6780 KB Output is correct
27 Correct 8489 ms 6784 KB Output is correct
28 Correct 922 ms 2368 KB Output is correct
29 Correct 892 ms 2360 KB Output is correct
30 Correct 925 ms 2260 KB Output is correct
31 Correct 894 ms 2380 KB Output is correct
32 Correct 8650 ms 6784 KB Output is correct
33 Correct 5547 ms 6784 KB Output is correct
34 Correct 8066 ms 6788 KB Output is correct
35 Correct 5772 ms 6780 KB Output is correct
36 Correct 3650 ms 6788 KB Output is correct
37 Correct 7524 ms 7404 KB Output is correct
38 Correct 8447 ms 6780 KB Output is correct
39 Correct 7727 ms 6788 KB Output is correct
40 Correct 8756 ms 6788 KB Output is correct
41 Correct 8183 ms 7640 KB Output is correct
42 Correct 8518 ms 12088 KB Output is correct