【天梯赛】L3-028 森森旅游(堆优化的Dijkstra、multiset)

依然是dijkstra的模板，由于点数较多用的是堆优化版本的模板
dist要开成long long，开int只能得20分

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
const LL INF = 0x3f3f3f3f3f3f3f3f;
typedef pair<LL, int> PII;
const int N = 100010 * 4;
int n, m, S, T;
int e[N], ne[N], w[N], idx, h1[N], h2[N];
LL dist1[N], dist2[N];
bool st[N];
int q, rate[N];

void add(int a, int b, int c, int h[])
{
    e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}

void dijkstra1()
{
    S = 1, T = n;
    memset(dist1, 0x3f, sizeof dist1);
    dist1[S] = 0;
    priority_queue<PII, vector<PII>, greater<PII>> heap;
    heap.push({0, S});
    while(heap.size())
    {
        auto t = heap.top();
        heap.pop();
        int ver = t.second, distance = t.first;
        if(st[ver]) continue;
        st[ver] = true;
        for(int i = h1[ver]; ~i; i = ne[i])
        {
            int j = e[i];
            if(dist1[j] > dist1[ver] + w[i])
            {
                dist1[j] = dist1[ver] + w[i];
                heap.push({dist1[j], j});
            }
        }
    }
}

void dijkstra2()
{
    S = n, T = 1;
    memset(dist2, 0x3f, sizeof dist2);
    memset(st, false, sizeof st);
    dist2[S] = 0;
    priority_queue<PII, vector<PII>, greater<PII>> heap;
    heap.push({0, S});
    while(heap.size())
    {
        auto t = heap.top();
        heap.pop();
        int ver = t.second, distance = t.first;
        if(st[ver]) continue;
        st[ver] = true;
        for(int i = h2[ver]; ~i; i = ne[i])
        {
            int j = e[i];
            if(dist2[j] > dist2[ver] + w[i])
            {
                dist2[j] = dist2[ver] + w[i];
                heap.push({dist2[j], j});
            }
        }
    }
}

int main()
{
    memset(h1, -1, sizeof h1);
    memset(h2, -1, sizeof h2);
    scanf("%d%d%d", &n, &m, &q);
    while(m --)
    {
        int a, b, c, d;
        scanf("%d%d%d%d", &a, &b, &c, &d);
        add(a, b, c, h1), add(b, a, d, h2);
    }
    for(int i = 1; i <= n; i++) scanf("%d", &rate[i]);

    dijkstra1();
    dijkstra2();

    multiset<LL> s;

    for(int i = 1; i <= n; i++)
    {
        if(dist1[i] != INF && dist2[i] != INF)
        {
            s.insert(dist1[i] + (dist2[i] + rate[i] - 1) / rate[i]);
        }
    }

    while(q --)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        if(dist1[a] != INF && dist2[a] != INF)
        {
            s.erase(s.find(dist1[a] + (dist2[a] + rate[a] - 1) / rate[a]));
            rate[a] = b;
            s.insert(dist1[a] + (dist2[a] + rate[a] - 1) / rate[a]);
        }
        printf("%lld\n", *s.begin());
    }
}