Submission #1228060

#	Time	Username	Problem	Language	Result	Execution time	Memory
1228060		goduadzesaba	Cyberland (APIO23_cyberland)	C++20	0 / 100	31 ms	8004 KiB

cyberland

#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;

const long long inf = 1e18;

double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
    vector<vector<pair<int, long long>>> v(N);  // safer vector

    // Build the graph
    for (int i = 0; i < M; i++) {
        v[x[i]].emplace_back(y[i], c[i]);
        v[y[i]].emplace_back(x[i], c[i]);
    }

    vector<long long> d(N, inf);
    set<pair<long long, int>> s;

    // Initialize sources (unprotected computers)
    for (int i = 0; i < N; i++) {
        if (arr[i] == 0) {
            d[i] = 0;
            s.insert({0, i});
        }
    }

    // Dijkstra's algorithm
    while (!s.empty()) {
        auto [dist, u] = *s.begin();
        s.erase(s.begin());

        for (auto [to, cost] : v[u]) {
            if (d[to] > d[u] + cost) {
                s.erase({d[to], to});
                d[to] = d[u] + cost;
                s.insert({d[to], to});
            }
        }
    }

    return d[H] == inf ? -1 : d[H];
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 19
• Subtask 5: 0 / 7
• Subtask 6: 0 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3