oj.uz

답안 #542502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
542502 2022-03-26T19:18:36 Z tabr 코끼리 (Dancing Elephants) (IOI11_elephants) C++17
97 / 100
 9000 ms 8304 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 = 810;
int B;
int n;
int l;
int upd_cnt;
int x[MAX_N];
int pos[MAX_N];
int jump_cnt[MAX_N];
int jump_pos[MAX_N];
int e[MAX_B][MAX_B];
int f[MAX_B][MAX_B];
int sz[MAX_B];
int order[MAX_N];
 
void init(int n_, int l_, int x_[]) {
    n = n_;
    l = l_;
    B = (int) sqrt(n * 1.2);
    for (int i = 0; i < n; i++) {
        x[i] = x_[i];
    }
    iota(order, order + n, 0);
}
 
void build_one(int id) {
    sort(e[id], e[id] + sz[id], [&](int i, int j) {
        return x[i] < x[j];
    });
    for (int i = 0; i < sz[id]; i++) {
        pos[e[id][i]] = id;
        f[id][i] = x[e[id][i]];
    }
    for (int i = sz[id] - 1, j = sz[id]; i >= 0; i--) {
        while (j > 0 && x[e[id][j - 1]] > x[e[id][i]] + l) {
            j--;
        }
        if (j == sz[id]) {
            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++) {
        sz[i] = 0;
        for (int j = n * i / B; j < n * (i + 1) / B; j++) {
            e[i][sz[i]] = order[j];
            sz[i]++;
        }
        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]
    for (int j = 0; j < sz[pos[i]] - 1; j++) {
        if (e[pos[i]][j] == i) {
            e[pos[i]][j] = e[pos[i]][sz[pos[i]] - 1];
            break;
        }
    }
    sz[pos[i]]--;
    build_one(pos[i]);
    // add x[i]
    x[i] = y;
    for (int id = 0; id < B; id++) {
        if (id == B - 1 || x[e[id + 1][0]] > y) {
            e[id][sz[id]] = i;
            sz[id]++;
            build_one(id);
            break;
        }
    }
    // answer
    int ans = 0;
    int now = 0;
    for (int id = 0; id < B; id++) {
        auto iter = lower_bound(f[id], f[id] + sz[id], now);
        if (iter == f[id] + sz[id]) {
            continue;
        }
        ans += jump_cnt[e[id][iter - f[id]]];
        now = jump_pos[e[id][iter - f[id]]];
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 490 ms 2004 KB Output is correct
8 Correct 616 ms 2260 KB Output is correct
9 Correct 925 ms 3648 KB Output is correct
10 Correct 1669 ms 3644 KB Output is correct
11 Correct 1704 ms 3648 KB Output is correct
12 Correct 1790 ms 3648 KB Output is correct
13 Correct 1741 ms 3648 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 490 ms 2004 KB Output is correct
8 Correct 616 ms 2260 KB Output is correct
9 Correct 925 ms 3648 KB Output is correct
10 Correct 1669 ms 3644 KB Output is correct
11 Correct 1704 ms 3648 KB Output is correct
12 Correct 1790 ms 3648 KB Output is correct
13 Correct 1741 ms 3648 KB Output is correct
14 Correct 786 ms 2488 KB Output is correct
15 Correct 1014 ms 2768 KB Output is correct
16 Correct 2271 ms 3884 KB Output is correct
17 Correct 2854 ms 4640 KB Output is correct
18 Correct 3101 ms 4632 KB Output is correct
19 Correct 3289 ms 4632 KB Output is correct
20 Correct 2834 ms 4640 KB Output is correct
21 Correct 3129 ms 4632 KB Output is correct
22 Correct 2985 ms 4636 KB Output is correct

Subtask #5
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 404 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 490 ms 2004 KB Output is correct
8 Correct 616 ms 2260 KB Output is correct
9 Correct 925 ms 3648 KB Output is correct
10 Correct 1669 ms 3644 KB Output is correct
11 Correct 1704 ms 3648 KB Output is correct
12 Correct 1790 ms 3648 KB Output is correct
13 Correct 1741 ms 3648 KB Output is correct
14 Correct 786 ms 2488 KB Output is correct
15 Correct 1014 ms 2768 KB Output is correct
16 Correct 2271 ms 3884 KB Output is correct
17 Correct 2854 ms 4640 KB Output is correct
18 Correct 3101 ms 4632 KB Output is correct
19 Correct 3289 ms 4632 KB Output is correct
20 Correct 2834 ms 4640 KB Output is correct
21 Correct 3129 ms 4632 KB Output is correct
22 Correct 2985 ms 4636 KB Output is correct
23 Correct 5909 ms 8296 KB Output is correct
24 Correct 6288 ms 8304 KB Output is correct
25 Correct 5367 ms 8296 KB Output is correct
26 Execution timed out 9088 ms 8200 KB Time limit exceeded
27 Halted 0 ms 0 KB -