WA on 8

代码

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
const int N = 1e5 + 5;
const ll inf = 0x3f3f3f3f3f3f3f3f;

int n, q, st, cnt, rt1, rt2;
int ls[N << 5], rs[N << 5];
ll dis[N << 3];
bool vis[N << 3];
priority_queue<pair<ll, int> > pq;
list<pair<int, ll> > e[N << 5];

void add(int u, int v, ll w){
    e[u].push_back(make_pair(v, w));
}

void build1(int &p, int l, int r){
    if (l == r)
        return p = l, void();
    p = ++ cnt;
    int mid = l + r >> 1;
    build1(ls[p], l, mid), build1(rs[p], mid + 1, r);
    add(p, ls[p], 0), add(p, rs[p], 0);
}

void build2(int &p, int l, int r){
    if (l == r)
        return p = l, void();
    p = ++ cnt;
    int mid = l + r >> 1;
    build2(ls[p], l, mid), build2(rs[p], mid + 1, r);
    add(ls[p], p, 0), add(rs[p], p, 0);
}

void update(int p, int l, int r, int u, ll w, int L, int R, int op){
    if (L <= l && r <= R)
        return (op == 2 ? add(u, p, w) : add(p, u, w)), void();
    int mid = l + r >> 1;
    if (L <= mid)
        update(ls[p], l, mid, u, w, L, R, op);
    if (R > mid)
        update(rs[p], mid + 1, r, u, w, L, R, op);
}

void dijkstra(int s){
    for (int i = 1; i < N; i ++)
        dis[i] = inf;
    dis[s] = 0;
    pq.push(make_pair(0, s));
    while (!pq.empty()){
        int u = pq.top().second;
        pq.pop();
        if (vis[u])
            continue;
        vis[u] = 1;
        for (auto [v, w] : e[u]){
            if (!vis[v] && dis[v] > dis[u] + w){
                dis[v] = dis[u] + w;
                pq.push(make_pair(-dis[v], v));
            }
        }
    }
}

void solve(){
    cin >> n >> q >> st;
    cnt = n;
    build1(rt1, 1, n), build2(rt2, 1, n);
    for (int i = 1, op; i <= q; ++ i){
        cin >> op;
        if (op == 1){
            int u, v, w;
            cin >> u >> v >> w;
            add(u, v, w);
        }
        else {
            int u, l, r, w;
            cin >> u >> l >> r >> w;
            update((op == 2 ? rt1 : rt2), 1, n, u, w, l, r, op);
        }
    }
    dijkstra(st);
    for (int i = 1; i <= n; i ++){
        // cout << dis[i] << ":";
        if (dis[i] < inf)
            cout << dis[i] << " ";
        else
            cout << -1 << " ";
    }
}

signed main(){
    // freopen("code.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
        solve();
    return 0;
}