제출 #580952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
580952		Lucpp	Two Antennas (JOI19_antennas)	C++17	24 / 100	623 ms	24896 KiB

antennas

#include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int)(x).size())
const int INF = 1e9+5;

const int K = 500;
const int MAX = 2e5+1;

int n, L;
int h[MAX], a[MAX], b[MAX], ans[MAX], maxH[MAX], byH[MAX], v[MAX], p[MAX], memo[MAX], lastAdd[MAX];
vector<int> d[MAX];
vector<pair<int, int>> queries[MAX], todo[MAX];

void updV(int i, int val){
    v[i] = max(v[i], val);
    ans[i/K] = max(ans[i/K], v[i]);
}

void addH(int i){
    byH[i] = h[i];
    maxH[i/K] = max(maxH[i/K], h[i]);
    lastAdd[i/K] = L;
}
void remH(int i){
    byH[i] = -INF;
    maxH[i/K] = -INF;
    for(int j = i-(i%K); j < min(n, i-(i%K)+K); j++){
        maxH[i/K] = max(maxH[i/K], byH[j]);
    }
    for(int j = 0; j < sz(d[i/K]); j++){
        if(i-a[i] >= d[i/K][j]){
            updV(i, h[i]-h[d[i/K][j]]);
            break;
        }
    }
}

void add_single(int i){
    updV(i, byH[i]-h[L]);
}
void add_to_block(int block){
    ans[block] = max(ans[block], maxH[block]-h[L]);
    if(!d[block].empty()){
        if(lastAdd[block] != L && h[d[block].back()] <= h[L]) return;
    }
    while(!d[block].empty() && h[d[block].back()] > h[L]) d[block].pop_back();
    d[block].push_back(L);
}

int qry(int R){
    int res = -INF;
    int i = L-(L%K);
    while(i+K-1 <= R){
        res = max(res, ans[i/K]);
        i += K;
    }
    if(i <= R){
        int j = 0; 
        int end = min(i+K, n);
        for(; i < end; i++){
            int x = p[i];
            if(x > R) continue;
            res = max(res, v[x]);
            if(byH[x] == -INF) continue;
            while(j < sz(d[i/K]) && x-a[x] < d[i/K][j]) j++;
            if(j < sz(d[i/K])) res = max(res, h[x]-h[d[i/K][j]]);
        }
    }
    return res;
}

void solve(){
    for(L = n-1; L >= 0; L--){
        for(auto [i, op] : todo[L]){
            if(op == 1) addH(i);
            else remH(i);
        }
        int i = L+a[L];
        for(; i <= min(L+b[L], n-1) && i % K != 0; i++){
            add_single(i);
        }
        while(i+K-1 <= min(L+b[L], n-1)){
            add_to_block(i/K);
            i += K;
        }
        for(; i <= min(L+b[L], n-1); i++){
            add_single(i);
        }
        for(auto [R, ind] : queries[L]){
            memo[ind] = max(memo[ind], qry(R));
        }
    }
}

void init(){
    fill_n(ans, n, -INF);
    fill_n(maxH, n, -INF);
    fill_n(byH, n, -INF);
    fill_n(v, n, -INF);
    fill_n(lastAdd, n, n);
    for(int i = 0; i < MAX; i++) d[i].clear();
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    init();
    for(int i = 0; i < n; i++){
        cin >> h[i] >> a[i] >> b[i];
        p[i] = i;
        if(i-a[i] >= 0) todo[i-a[i]].emplace_back(i, 1);
        if(i-b[i]-1 >= 0) todo[i-b[i]-1].emplace_back(i, -1);
    }
    for(int i = 0; i < n; i += K){
        int j = min(i+K, n);
        sort(p+i, p+j, [&](int x, int y){return x-a[x] > y-a[y];});
    }

    int q;
    cin >> q;
    fill_n(memo, q, -1);
    for(int i = 0; i < q; ++i){
        int l, r;
        cin >> l >> r;
        l--, r--;
        queries[l].emplace_back(r, i);
    }
    solve();
    for(int i = 0; i < n; i++) h[i] = -h[i];
    init();
    solve();
    for(int i = 0; i < q; i++) cout << memo[i] << "\n";
}

• Subtask 1: 2 / 2
• Subtask 2: 0 / 11
• Subtask 3: 22 / 22
• Subtask 4: 0 / 65