nyoj 三国志 (Dijkstra + 01背包)

。。。 总是没思路  真要命

注意两点之间可能有多条权值不同的路径，不过只要在输入时取最小值就好了。。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#include<climits>
#include<string.h>
#include<cmath>
#include<stdlib.h>
#include<vector>
#include<set>
#define INF 1e7
#define MAXN 100010
#define maxn 50
#define maxm 1000
#define Mod 1000007
using namespace std;
typedef long long LL;


int T;
int s, n, m;
int a, b, c;
int v[110];
int G[110][110];
int dist[1000010];
int vis[110];
int dp[1000010];

void Dijkstra()
{
    for (int i = 0; i <= n; ++i)
        dist[i] = G[0][i],vis[i] = 0;
    int pos, min;
    vis[0] = 1;
    dist[0] = 0;
    for (int i = 1; i <= n; ++i) {
        min = INF;
        for (int j = 1; j <= n; ++j) {
            if (!vis[j] && min > dist[j]) {
                pos = j;
                min = dist[j];
            }
        }
        vis[pos] = 1;
        for (int j = 1; j <= n; ++j) {
            if (!vis[j] && dist[j] > dist[pos] + G[pos][j])
                dist[j] = dist[pos] + G[pos][j];
        }
    }
}

void bag01()
{
    for (int i = 1; i <= n; ++i)
        for (int j = s; j >= dist[i]; --j)
            dp[j] = max(dp[j - dist[i]] + v[i],dp[j]);
}

void run()
{
    scanf("%d%d%d", &s, &n, &m);
    memset(v,0,sizeof(v));
    memset(dp,0,sizeof(dp));
    for (int i = 0; i <= n; ++i)
        for (int j = 0; j <= n; ++j)
            G[i][j] = INF;
    for (int i = 0; i < m; ++i) {
        scanf("%d%d%d", &a, &b, &c);
        if (c < G[a][b])
            G[a][b] = G[b][a] = c;
    }
    for (int i = 1; i <= n; ++i) 
        scanf("%d",&v[i]);
    Dijkstra();
    bag01();
    printf("%d
",dp[s]);
}
int main()
{
    scanf("%d", &T);
    while (T--)
        run();
    return 0;
}