Submission #960990

#	Time	Username	Problem	Language	Result	Execution time	Memory
960990		thinknoexit	Security Guard (JOI23_guard)	C++17	37 / 100	129 ms	25648 KiB

guard

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200200;
int a[N];
vector<int> adj[N];
struct A {
    int u, v;
    bool operator < (const A& o) const {
        if (a[u] != a[o.u]) return a[u] < a[o.u];
        return a[v] < a[o.v];
    }
};
ll ans = 0;
vector<A> e;
int p[N];
int fr(int i) {
    return p[i] == i ? i : p[i] = fr(p[i]);
}
void dfs(int v, int p = -1) {
    for (auto& x : adj[v]) {
        if (x == p) continue;
        ans += a[v];
        dfs(x, v);
    }
}
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 1;i <= n;i++) {
        cin >> a[i];
        p[i] = i;
    }
    while (m--) {
        int u, v;
        cin >> u >> v;
        if (a[v] > a[u]) swap(u, v);
        e.push_back({ u, v });
    }
    sort(e.begin(), e.end());
    for (auto& x : e) {
        int u = x.u, v = x.v;
        int pu = fr(u), pv = fr(v);
        if (pu == pv) continue;
        adj[u].push_back(v);
        adj[v].push_back(u);
        p[pu] = pv;
    }
    int idx = max_element(a + 1, a + 1 + n) - a;
    dfs(idx);
    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