Submission #960516

#	Time	Username	Problem	Language	Result	Execution time	Memory
960516		thinknoexit	Security Guard (JOI23_guard)	C++17	37 / 100	191 ms	21016 KiB

guard

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200200;
int a[N];
struct A {
    int v, w;
    bool operator < (const A& o) const {
        if (w != o.w) return w > o.w;
        return a[v] > a[o.v];
    }
};
priority_queue<A> pq;
int dis[N];
bool vis[N];
vector<int> adj[N];
ll ans = 0;
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    memset(dis, 0x3f, sizeof dis);
    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 1;i <= n;i++) {
        cin >> a[i];
    }
    while (m--) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    int idx = max_element(a + 1, a + 1 + n) - a;
    dis[idx] = 0;
    pq.push({ idx, 0 });
    while (!pq.empty()) {
        auto x = pq.top();
        pq.pop();
        int v = x.v;
        if (vis[v]) continue;
        vis[v] = 1;
        ans += dis[v];
        for (auto& x : adj[v]) {
            if (!vis[x] && dis[x] > a[v]) {
                dis[x] = a[v];
                pq.push({ x, a[v] });
            }
        }
    }
    cout << ans;
    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 12 / 12
• Subtask 4: 0 / 13
• Subtask 5: 0 / 8
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24