POJ ~ 1062 ~ 昂贵的聘礼 （加限制Dijkstra + 建图）

思路： 物品看做点，优惠关系看做边。以0当做起点，1作为终点，跑N遍dijstra，每次，控制一个等级区间。不要忘了建一条0~各个物品的边，权值为物品原价格，表示直接买。

AC代码1：

多加个等级条件即可，然后枚举最低等级，在等级符合要求的区间内求0~1的最短路。求一个最小值就是答案。

套的模板，不过忘了调用init，两个小时没整过样例，搞得怀疑人生。程序不允许半点马虎啊，唉。

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
const int MAXN = 105;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int from, to, dist;       //起点,终点,距离
    Edge(int u, int v, int w):from(u), to(v), dist(w) {}
};
int M, level[MAXN];//等级
struct Dijkstra
{
    int n, m;                 //结点数,边数(包括反向弧)
    vector<Edge> edges;       //边表。edges[e]和edges[e^1]互为反向弧
    vector<int> G[MAXN];      //邻接表，G[i][j]表示结点i的第j条边在edges数组中的序号
    int vis[MAXN];            //标记数组
    int d[MAXN];              //s到各个点的最短路
    int pre[MAXN];            //上一条弧

    void init(int n)
    {
        this->n = n;
        edges.clear();
        for (int i = 0; i <= n; i++) G[i].clear();
    }

    void add_edge(int from, int to, int dist)
    {
        edges.push_back(Edge(from, to, dist));
        m = edges.size();
        G[from].push_back(m - 1);
    }

    struct HeapNode
    {
        int from, dist;
        bool operator < (const HeapNode& rhs) const
        {
            return rhs.dist < dist;
        }
        HeapNode(int u, int w): from(u), dist(w) {}
    };

    void dijkstra(int s,int MIN)
    {
        priority_queue<HeapNode> Q;
        for (int i = 0; i <= n; i++) d[i] = INF;
        d[s] = 0;
        memset(vis, 0, sizeof(vis));
        Q.push(HeapNode(s, 0));
        while (!Q.empty())
        {
            HeapNode x = Q.top(); Q.pop();
            int u = x.from;
            if (vis[u]) continue;
            vis[u] = true;
            for (int i = 0; i < G[u].size(); i++)
            {
                Edge& e = edges[G[u][i]];
                if (level[MIN] <= level[e.to] && level[e.to] <= level[MIN] + M &&
                    d[e.to] >= d[u] + e.dist)
                {
                    d[e.to] = d[u] + e.dist;
                    pre[e.to] = G[u][i];
                    Q.push(HeapNode(e.to, d[e.to]));
                }
            }
        }
    }
};
Dijkstra solve;
int main()
{
    int n, m;
    while (~scanf("%d%d", &M, &n))
    {
        solve.init(n);
        for (int i = 1; i <= n; i++)
        {
            int P, X, L, T, V;
            scanf("%d%d%d", &P, &L, &X);
            level[i] = L;
            solve.add_edge(0, i, P);
            while (X--)
            {
                int T, V;
                scanf("%d%d", &T, &V);
                solve.add_edge(T, i, V);
            }
        }
        int ans = INF;
        for (int i = 1; i <= n; i++)
        {
            solve.dijkstra(0, i);
            ans = min(ans, solve.d[1]);
        }
        printf("%d\n", ans);
    }
    return 0;
}
/*
1 4
10000 3 2
2 8000
3 5000
1000 2 1
4 200
3000 2 1
4 200
50 2 0
*/

AC代码2：

把dis数组初始化为物品本身的价格，把不可用的点标记为true不去更新这些物品的价值。

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAXN = 105;
const int INF = 0x3f3f3f3f;
int n, m, d[MAXN], price[MAXN], level[MAXN], G[MAXN][MAXN];
bool vis[MAXN];
int dijkstra()
{
    for (int i = 1; i <= n; i++) d[i] = price[i];
    for (int i = 1; i <= n; i++)
    {
        int MIN = INF, pos;
        for (int j = 1; j <= n; j++)
        {
            if (!vis[j] && d[j] <= MIN) MIN = d[pos = j];
        }
        vis[pos] = true;
        for (int j = 1; j <= n; j++)
        {
            if (!vis[j] && d[j] > d[pos] + G[pos][j])
            {
                d[j] = d[pos] + G[pos][j];
            }
        }
    }
    return d[1];
}
int main()
{
    while (~scanf("%d%d", &m, &n))
    {
        memset(G, INF, sizeof(G));
        for (int i = 1; i <= n; i++)
        {
            int X;
            scanf("%d%d%d", &price[i], &level[i], &X);
            G[0][i] = price[i];
            while (X--)
            {
                int T, V;
                scanf("%d%d", &T, &V);
                G[T][i] = V;
            }
        }
        int ans = INF;
        for (int i = 1; i <= n; i++)
        {
            int MIN = level[i], MAX = level[i] + m;
            for (int j = 1; j <= n; j++)
            {
                if (MIN <= level[j] && level[j] <= MAX) vis[j] = false;
                else vis[j] = true;
            }
            ans = min(ans, dijkstra());
        }
        printf("%d\n", ans);
    }
    return 0;
}
/*
1 4
10000 3 2
2 8000
3 5000
1000 2 1
4 200
3000 2 1
4 200
50 2 0
*/