HDU5361 In Touch(最短路 + 线段树)

/**
题意：一条n个点，第i个点可以到达[i - Ri, i - Li], [i + Li, i + Ri]的任意一个点，花费为Ci,问第1个点
到其他各点的最小花费

思路：Dijkstra + 线段树维护，遇到要更新的data值的时候， 如果data大于等于线段树该节点的最大值，则不更新，
如果小于该节点的最小值，则这个区间的每个点更新，然后放进优先队列，线段树维护的是1到区间[l, r]最短路的
最大值和最小值
*/
#include<bits/stdc++.h>
typedef long long ll;
const int maxn = 2e5 + 10;
const ll INF = 1e18;
using namespace std;

typedef pair<ll, int> pa;
priority_queue<pa, vector<pa>, greater<pa> > que;
ll d[maxn], lazy[maxn * 4], c[maxn];
ll C_max[maxn * 4], C_min[maxn * 4];
int l[maxn], r[maxn], n, T;

void build(int o, int l, int r) {
    lazy[o] = 0; ll x = (l == 1) ? 0 : INF;
    if(l == r) { C_max[o] = x; C_min[o] = x; return ; }
    int mid = (l + r) >> 1, o1 = o << 1, o2 = o << 1 | 1;
    build(o1, l, mid); build(o2, mid + 1, r);
    C_min[o] = min(C_min[o << 1], C_min[o << 1 | 1]);
    C_max[o] = max(C_max[o << 1], C_max[o << 1 | 1]);
}

ll ql, qr, data;

void push_down(int o) {
    if(!lazy[o]) return ;
    lazy[o] = 0; ll x = C_min[o];
    C_min[o << 1] = C_min[o << 1 | 1] = x;
    C_max[o << 1] = C_max[o << 1 | 1] = x;
    lazy[o << 1] = lazy[o << 1 | 1] = 1;
}

void update(int o, int l, int r) {
    if(r < ql || l > qr) return ;
    if(l >= ql && r <= qr) {
        if(data >= C_max[o]) return ;
        if(data <= C_min[o]) {
            C_min[o] = C_max[o] = data; lazy[o] = 1;
            for(int i = l; i <= r; i++) { que.push(pa(data, i)); d[i] = data; }
            return ;
        }
    }
    int mid = (l + r) >> 1, o1 = o << 1, o2 = o << 1 | 1;
    push_down(o);
    update(o1, l, mid); update(o2, mid + 1, r);
    C_max[o] = max(C_max[o << 1], C_max[o << 1 | 1]);
    C_min[o] = min(C_min[o << 1], C_min[o << 1 | 1]);
}

void final_ans(int o, int l, int r) {
    if(l == r) { d[l] = C_min[o]; return ; }
    int mid = (l + r) >> 1, o1 = o << 1, o2 = o << 1 | 1;
    push_down(o);
    final_ans(o1, l, mid); final_ans(o2, mid + 1, r);
}

void Dijkstra(int s) {
    fill(d, d + maxn, INF);
    while(!que.empty()) que.pop();
    build(1, 1, n);
    que.push(pa(0, s)); d[s] = 0;
    while(!que.empty()) {
        pa p = que.top(); que.pop();
        int now = p.second; ll dis = p.first;
        if(dis > d[now]) continue;
        data = dis + c[now];
        //cout << "now = " << now << "  data = " << data << endl;
        ql = now + l[now]; qr = min(n, now + r[now]);
        //printf("ql = %lld qr = %lld\n", ql, qr);
        if(ql <= n) update(1, 1, n);
        ql = max(1, now - r[now]); qr = now - l[now];
       // printf("ql = %lld qr = %lld\n", ql, qr);
        if(qr >= 1) update(1, 1, n);
    }
    final_ans(1, 1, n);
    for(int i = 1; i <= n; i++) {
        if(d[i] == INF) d[i] = -1;
        printf("%lld%c", d[i], i < n ? ' ' : '\n');
    }
}

int main() {
    scanf("%d", &T);
    while(T--) {
        scanf("%d", &n);
        for(int i = 1; i <= n; i++) scanf("%d", &l[i]);
        for(int i = 1; i <= n; i++) scanf("%d", &r[i]);
        for(int i = 1; i <= n; i++) scanf("%lld", &c[i]);
        Dijkstra(1);
    }
    return 0;
}