【昂贵的婚礼】

Kent_J_Truman

于 2024-08-15 11:20:57 发布

阅读量92

点赞数 3

分类专栏：算法文章标签：算法图论 c++

本文链接：https://blog.csdn.net/m0_73669127/article/details/141217698

版权

算法专栏收录该内容

38 篇文章 0 订阅

订阅专栏

题目

代码

#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
#define x first
#define y second
const int N = 110, M = 10110;
int h[N], e[M], ne[M], w[M], idx;
bool st[N];
int n, m;
int dist[N];
int tier[N];
void add(int a, int b, int c)
{
    e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}
int Dijkstra(int l, int r)
{
    memset(dist, 0x3f, sizeof dist);
    memset(st,0,sizeof st);
    dist[0] = 0;
    priority_queue<PII, vector<PII>, greater<PII>> heap;
    heap.push({0, 0});
    while(heap.size())
    {
        auto t = heap.top(); heap.pop();
        int u = t.y, distance = t.x;
        if(st[u]) continue;
        st[u] = true;
        
        for(int k = h[u]; ~k; k = ne[k])
        {
            int j = e[k];
            if(tier[j] < l || tier[j] > r) continue;
            if(dist[j] > distance + w[k])
            {
                dist[j] = distance + w[k];
                heap.push({dist[j], j});
            }
        }
    }
    
    return dist[1];
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> m >> n;
    memset(h, -1, sizeof h);
    for(int i = 1; i <= n; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        tier[i] = b;
        add(0, i, a);
        for(int j = 1; j <= c; j++)
        {
            int t, v;
            cin >> t >> v;
            add(t, i, v);
        }
    }
    int res = INT_MAX;
    for(int i = tier[1] - m; i <= tier[1]; i++)
    {
        res = min(res, Dijkstra(i, i+m));
    }
    cout << res << endl;
    return 0;
}