Submission #1207939

#	Time	Username	Problem	Language	Result	Execution time	Memory
1207939		onbert	Tower (JOI24_tower)	C++20	63 / 100	2095 ms	9844 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 2e5 + 5, INF = 1e15;
int n, q, d, a, b;
vector<pair<int,int>> block, space;
vector<int> qry;

int belong(int i) {
    int id = lower_bound(block.begin(), block.end(), make_pair(i+1, -INF)) - block.begin() - 1;
    if (id >= 0 && i <= block[id].second) return id;
    else return -1;
}

int bef(int x) {
    return lower_bound(block.begin(), block.end(), make_pair(x, -INF)) - block.begin() - 1;
}

vector<int> ansA;
int Aqry(int x) {
    int id = bef(x);
    return ansA[id] + a * (x - (block[id].second + 1));
}
void A() {
    ansA.resize(n);
    ansA[0] = 0;
    for (int i=1;i<n;i++) ansA[i] = Aqry((block[i].second+1) - d) + b;
    while (q--) {
        int x;
        cin >> x;
        if (belong(x) != -1) cout << "-1\n";
        else cout << Aqry(x) << "\n";
    }
}

void B() {
    while (q--) {
        int x;
        cin >> x;
        if (belong(x) != -1) {
            cout << "-1\n";
            continue;
        }
        int ans = 0;
        while (x != 0) {
            int id = lower_bound(block.begin(), block.end(), make_pair(x, -INF)) - block.begin() - 1;
            // cout << x << " " << id << endl;
            int jump = block[id].second - (block[id].second % d) + (x % d);
            if (jump <= block[id].second) jump += d;
            ans += b * ((x - jump) / d);
            x = jump;
            if (id == 0) {
                ans += a * x, x = 0;
                break;
            }

            ans += b, x -= d;
            id = belong(x);
            if (id != -1) {
                ans += a * (x - (block[id].first - 1));
                x = block[id].first - 1;
            }
            // cout << x << " " << ans << endl;
        }
        cout << ans << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> q >> d >> a >> b;
    n++;
    vector<pair<int,int>> vec(n);
    vec[0] = {-(d-1), -1};
    for (int i=1;i<n;i++) cin >> vec[i].first >> vec[i].second;
    for (int i=0;i<n;i++) {
        auto [l, r] = vec[i];
        if (block.size()) {
            if (r <= block.back().second) continue;
            else if (l - 1 <= block.back().second) {
                l = block.back().first;
                block.pop_back();
            }
        }
        if ((r+1) - (l-1) > d) r = INF;
        else {
            int id = belong(r+1 - d);
            if (id != -1) r = block[id].second + d;
        }
        block.push_back({l, r});
        // cout << i << " " << l << " " << r << endl;
    }
    n = block.size();
    // for (auto [l, r]:vec) cout << l << " " << r << endl;
    if (a * d <= b) A();
    else B();
}

• Subtask 1: 0 / 5
• Subtask 2: 38 / 38
• Subtask 3: 25 / 25
• Subtask 4: 0 / 32