제출 #1245837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1245837		qminh1908	Cities (BOI16_cities)	C++20	100 / 100	1712 ms	42320 KiB

cities

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define debug(x) cout << #x << ' ' << x << '\n';
const int maxn = 1e5 + 5, inf = 1e18;
int n, k, m, dp[1 << 5][maxn];
vector <pii> adj[maxn];
signed main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    memset (dp, 0x3f, sizeof(dp));
    cin >> n >> k >> m;
    for (int i = 0, x; i < k; i++) {
        cin >> x;
        dp[1 << i][x] = 0;
    }
    for (int i = 1, u, v, w; i <= m; i++) {
        cin >> u >> v >> w;
        adj[u].push_back ({v, w});
        adj[v].push_back ({u, w});
    }
    priority_queue <pii, vector <pii>, greater <>> pq;
    for (int mask = 0; mask < (1 << k); mask++) {
        for (int i = 1; i <= n; i++) {
            for (int sub = mask; sub; sub = (sub - 1) & mask) {
                dp[mask][i] = min (dp[mask][i], dp[sub][i] + dp[mask ^ sub][i]);
            }
            if (dp[mask][i] < inf) pq.push ({dp[mask][i], i});
        }
        while (!pq.empty()) {
            auto [du, u] = pq.top();
            pq.pop();
            for (auto [v, w] : adj[u]) {
                if (dp[mask][v] <= du + w) continue;
                dp[mask][v] = du + w;
                pq.push ({dp[mask][v], v});
            }
        }
    }
    int ans = inf;
    for (int i = 1; i <= n; i++) {
        ans = min (ans, dp[(1 << k) - 1][i]);
        //debug(dp[(1 << k) - 1][i]);
    }
    cout << ans;
}

• Subtask 1: 22 / 22
• Subtask 2: 14 / 14
• Subtask 3: 15 / 15
• Subtask 4: 23 / 23
• Subtask 5: 26 / 26