제출 #229296

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
229296		dolphingarlic	Cities (BOI16_cities)	C++14	100 / 100	2335 ms	49040 KiB

cities

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int important[5];
ll dp[1 << 5][100001];
bool visited[100001];
vector<pair<ll, int>> graph[100001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k, m;
    cin >> n >> k >> m;
    FOR(i, 0, k) cin >> important[i];
    while (m--) {
        int a, b, c;
        cin >> a >> b >> c;
        graph[a].push_back({c, b});
        graph[b].push_back({c, a});
    }

    memset(dp, 0x3f, sizeof(dp));
    FOR(i, 0, k) dp[1 << i][important[i]] = 0;

    FOR(mask, 1, 1 << k) {
        priority_queue<pair<ll, int>> pq;
        for (int i = mask; i; i = mask & (i - 1)) {
            if ((mask ^ i) > i) continue;
            FOR(j, 1, n + 1) dp[mask][j] = min(dp[mask][j], dp[i][j] + dp[mask ^ i][j]);
        }
        
        fill(visited + 1, visited + n + 1, false);
        FOR(i, 1, n + 1) if (dp[mask][i] != 0x3f3f3f3f3f3f3f3f) pq.push({-dp[mask][i], i});

        while (pq.size()) {
            ll cost = pq.top().first;
            int curr = pq.top().second;
            pq.pop();
            if (!visited[curr]) {
                visited[curr] = true;
                for (pair<ll, int> i : graph[curr]) if (i.first - cost < dp[mask][i.second]) {
                    dp[mask][i.second] = i.first - cost;
                    pq.push({cost - i.first, i.second});
                }
            }
        }
    }

    cout << *min_element(dp[(1 << k) - 1] + 1, dp[(1 << k) - 1] + n + 1);
    return 0;
}

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