Submission #952415

#	Time	Username	Problem	Language	Result	Execution time	Memory
952415		ttamx	Security Guard (JOI23_guard)	C++17	50 / 100	121 ms	18376 KiB

guard

#include<bits/stdc++.h>

using namespace std;

const int N=2e5+5;

using ll = long long;

int n,m,q;
int s[N],deg[N];
ll ans;
vector<tuple<ll,int,int>> edge;
int p[N];

int fp(int u){
    return p[u]=u==p[u]?u:fp(p[u]);
}

bool uni(int u,int v){
    u=fp(u),v=fp(v);
    return u!=v?p[u]=v,true:false;
}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> m >> q;
    for(int i=1;i<=n;i++){
        cin >> s[i];
        ans-=s[i];
    }
    for(int i=0;i<m;i++){
        int u,v;
        cin >> u >> v;
        edge.emplace_back(s[u]+s[v],u,v);
    }
    ans+=*max_element(s+1,s+n+1);
    sort(edge.begin(),edge.end());
    for(int i=1;i<=n;i++)p[i]=i;
    for(auto [w,u,v]:edge)if(uni(u,v))ans+=w;
    cout << ans;
}

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