oj.uz

Submission #1111231

# Submission time Handle Problem Language Result Execution time Memory
1111231 2024-11-11T19:25:31 Z f0rizen Cities (BOI16_cities) C++17
74 / 100
 6000 ms 170596 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll infll = 1e18;

template<typename T>
istream &operator>>(istream &is, vector<T> &a) {
    for (auto &i : a) {
        is >> i;
    }
    return is;
}

int32_t main() {
#ifdef LOCAL
    freopen("/tmp/input.txt", "r", stdin);
#else
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int n, k, m;
    cin >> n >> k >> m;
    vector<int> a(k);
    cin >> a;
    for (auto &i : a) {
        --i;
    }
    vector<vector<pair<int, int>>> g(n);
    for (int i = 0; i < m; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        --u, --v;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    vector<vector<ll>> dp(1 << k, vector<ll>(n, infll));
    using pii = pair<ll, pair<int, int>>;
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    for (int i = 0; i < k; ++i) {
        dp[1 << i][a[i]] = 0;
        pq.push({dp[1 << i][a[i]], {1 << i, a[i]}});
    }
    while (!pq.empty()) {
        auto [_, a] = pq.top();
        pq.pop();
        auto [mask, v] = a;
        if (_ > dp[mask][v]) {
            continue;
        }
        for (auto [u, w] : g[v]) {
            if (dp[mask][u] > dp[mask][v] + w) {
                dp[mask][u] = dp[mask][v] + w;
                pq.push({dp[mask][u], {mask, u}});
            }
            for (int upmask = mask;; upmask = (upmask + 1) | mask) {
                if (dp[upmask][u] > dp[mask][v] + dp[upmask ^ mask][u] + w) {
                    dp[upmask][u] = dp[mask][v] + dp[upmask ^ mask][u] + w;
                    pq.push({dp[upmask][u], {upmask, u}});
                }
                if (upmask == (1 << k) - 1) {
                    break;
                }
            }
        }
    }
    ll ans = infll;
    for (int i = 0; i < n; ++i) {
        ans = min(ans, dp[(1 << k) - 1][i]);
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 508 ms 36648 KB Output is correct
2 Correct 493 ms 34444 KB Output is correct
3 Correct 230 ms 17204 KB Output is correct
4 Correct 63 ms 9536 KB Output is correct
5 Correct 228 ms 21308 KB Output is correct
6 Correct 45 ms 8388 KB Output is correct
7 Correct 4 ms 848 KB Output is correct
8 Correct 2 ms 592 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1228 KB Output is correct
2 Correct 7 ms 1228 KB Output is correct
3 Correct 5 ms 848 KB Output is correct
4 Correct 6 ms 1236 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1778 ms 90776 KB Output is correct
2 Correct 1969 ms 89940 KB Output is correct
3 Correct 876 ms 37232 KB Output is correct
4 Correct 1225 ms 46888 KB Output is correct
5 Correct 294 ms 25060 KB Output is correct
6 Correct 108 ms 12220 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6031 ms 170596 KB Time limit exceeded
2 Halted 0 ms 0 KB -