Submission #1228062

#	Time	Username	Problem	Language	Result	Execution time	Memory
1228062		goduadzesaba	Cyberland (APIO23_cyberland)	C++20	15 / 100	32 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<pair<int, long long>> v[N];

    for (int i = 0; i < M; i++) {
        v[x[i]].push_back({y[i], c[i]});
        v[y[i]].push_back({x[i], c[i]});
    }

    arr[0] = 0; // start from node 0, which becomes "unprotected"
    set<pair<long long, int>> s;
    long long d[N];

    for (int i = 0; i < N; i++) {
        if (arr[i] == 0) {
            d[i] = 0;
            s.insert({0, i});
        } else {
            d[i] = inf;
        }
    }

    while (!s.empty()) {
        int x = s.begin()->second;
        s.erase(s.begin());
        for (auto i : v[x]) {
            if (d[i.first] > d[x] + i.second) {
                s.erase({d[i.first], i.first});
                d[i.first] = d[x] + i.second;
                s.insert({d[i.first], i.first});
            }
        }
    }

    if (d[H] == inf) return -1;
    return d[H];
}

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