提出 #74223452

---

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int INF = 1e18;
vector<int>ord;
void solve(int tc) {
    int n, m; cin >> n >> m;
    vector<vector<int>>dis(n + 1, vector<int>(n + 1, INF));
    for (int i = 1; i <= n; i++)dis[i][i] = 0;
    for (int i = 0; i < m; i++) {
        int u, v, w; cin >> u >> v >> w;
        dis[u][v] = min(dis[u][v] , w);
    }
    for (int k = 1; k <= n; k++) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                dis[i][j] = min(dis[i][j] ,
                                dis[i][k] + dis[k][j]);
            }
        }
    }
    int s, k; cin >> s >> k;
    for (int i = 0; i < k; i++) {
        int x; cin >> x;
        ord.push_back(x);
    }
    vector<vector<int>>dp(1 << k, vector<int>(k, INF));
    for(int i=0;i<k;i++){
        dp[1<<i][i] = dis[s][ord[i]];
    }
    for (int mask = 1; mask < (1 << k); mask++) {
        for (int last = 0; last < k; last++) {
            if (mask >> last & 1) {
                for (int next = 0; next < k; next++) {
                    if (!(mask >> next & 1)) {
                        int new_mask = mask | (1 << next);
                        dp[new_mask][next] = min(dp[new_mask][next] , 
                                             dp[mask][last] + dis[ord[last]][ord[next]]);
                    }
                }
            }
        }
    }
    int ans = INF;
    for(int i=0;i<k;i++){
        ans = min(ans , dp[(1<<k) - 1][i] + dis[ord[i]][s]);
    }
    cout << (ans == INF ? -1 : ans) << endl;
}
int32_t main() {
    FAST
    int t = 1;
    // cin >> t;
    for (int tc = 1; tc <= t; tc++)
        solve(tc);
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function 'void solve(long long int)':
./Main.cpp:8:16: warning: unused parameter 'tc' [-Wunused-parameter]
    8 | void solve(int tc) {
      |                ^

ジャッジ結果