제출 #1274794

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1274794		JeanBombeur	Dancing Elephants (IOI11_elephants)	C++17	100 / 100	1631 ms	14264 KiB

elephants

#include <bits/stdc++.h>
#include "elephants.h"
#define all(a) (a).begin(), (a).end()
using namespace std;

const int N = 15e4;
const int SZ = 400;

vector <int> pos[N];
vector <pair <int, int>> dp[N];

int x[N];

int length, nb_blocks;

void compute(int id) {
    int sz = (int)size(pos[id]);
    dp[id].resize(sz);
    for (int nxt = sz - 1, i = nxt; ~i; i --) {
        while (pos[id][nxt - 1] > pos[id][i] + length)
            nxt --;
        dp[id][i] = (nxt == sz - 1) ? make_pair(1, pos[id][i] + length) : make_pair(1 + dp[id][nxt].first, dp[id][nxt].second);
    }
    return;
}

void upd(int v, bool add) {
    int id = 0;
    while (id < nb_blocks - 1 && pos[id].back() < v)
        id ++;
    if (add)
        pos[id].insert(lower_bound(all(pos[id]), v), v);
    else
        pos[id].erase(lower_bound(all(pos[id]), v));
    if (pos[id].size() == 2 * SZ) {
        for (int i = nb_blocks ++; i > id + 1; i --) {
            swap(pos[i], pos[i - 1]);
            swap(dp[i], dp[i - 1]);
        }
        pos[id + 1].insert(pos[id + 1].begin(), pos[id].begin() + SZ, pos[id].end());
        pos[id].erase(pos[id].begin() + SZ, pos[id].end());
        compute(id + 1);
    }
    if (pos[id].empty()) {
        -- nb_blocks;
        for (int i = id; i < nb_blocks; i ++) {
            swap(pos[i], pos[i + 1]);
            swap(dp[i], dp[i + 1]);
        }
    }
    else
        compute(id);
    return;
}

int answer() {
    int ans = 0, id = 0, cur = -1;
    while (id < nb_blocks) {
        int i = upper_bound(all(pos[id]), cur) - pos[id].begin();
        ans += dp[id][i].first;
        cur = dp[id][i].second;
        while (id < nb_blocks && cur >= pos[id].back())
            id ++;
    }
    return ans;
}

void init(int N, int L, int X[]) {
    length = L;
    nb_blocks = (SZ - 1 + N) / SZ;
    for (int i = 0; i < N; i ++)
        pos[i / SZ].push_back(x[i] = X[i]);
    for (int i = 0; i < nb_blocks; i ++)
        compute(i);
    return;
}

int update(int id, int nv) {
    upd(x[id], 0);
    upd(x[id] = nv, 1);
    return answer();
}

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 24 / 24
• Subtask 4: 47 / 47
• Subtask 5: 3 / 3