Submission #4639043

---

Source Code Expand

#include <bits/stdc++.h>
#define INF 1e9
using namespace std;

int N, M, R;
int cost[201][201];

void warshall_floyd() {
    for (int k = 0; k < N; k++) {
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
            }
        }
    }
    return;
}

int perm(vector<int> r) {
    sort(r.begin(), r.end());
    int ans = INF;
    do {
        int sum = 0;
        for (int i = 0; i < R - 1; i++) {
            sum += cost[r[i]][r[i + 1]];
        }
        ans = min(ans, sum);
    } while (next_permutation(r.begin(), r.end()));
    return ans;
}

int main() {
    cin >> N >> M >> R;
    vector<int> r(R);
    for (int i = 0; i < R; i++) {
        int town;
        cin >> town;
        r[i] = town - 1;
    }

    fill(cost[0], cost[200], INF);
    for (int i = 0; i < M; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        a--;
        b--;
        cost[a][b] = c;
        cost[b][a] = c;
    }
    warshall_floyd();
    
    cout << perm(r) << endl;
}

Submission Info

Judge Result