Submission #937068

#	Time	Username	Problem	Language	Result	Execution time	Memory
937068		Pacybwoah	Security Guard (JOI23_guard)	C++17	100 / 100	563 ms	85964 KiB

guard

#include<iostream>
#include<algorithm>
#include<vector>
#include<utility>
#include<queue>
#include<set>
using namespace std;
typedef long long ll;
vector<int> dsu,rep,sz;
int query(int x){
    if(x==dsu[x]) return x;
    dsu[x]=query(dsu[x]);
    return dsu[x];
}
void unite(int a,int b){
    a=query(a);
    b=query(b);
    if(a==b) return;
    if(sz[a]<sz[b]) swap(a,b);
    dsu[b]=a;
    sz[a]+=sz[b];
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,m,q;
    cin>>n>>m>>q;
    vector<ll> s(n+1);
    for(int i=1;i<=n;i++) cin>>s[i];
    int a,b;
    vector<pair<int,int> > ori,edges;
    for(int i=0;i<m;i++){
        cin>>a>>b;
        ori.push_back(make_pair(a,b));
    }
    sort(ori.begin(),ori.end(),[&](pair<int,int> a,pair<int,int> b){return s[a.first]+s[a.second]<s[b.first]+s[b.second];});
    vector<priority_queue<pair<ll,int>,vector<pair<ll,int> >,greater<pair<ll,int> > > > pq(n+1);
    set<pair<ll,int> > finpq;
    vector<bool> vis(n-1);
    dsu.resize(n+1);
    rep.resize(n+1);
    sz.resize(n+1);
    int minpos;
    auto build=[&](){
        for(int i=1;i<=n;i++){
            dsu[i]=i;
            sz[i]=1;
            rep[i]=i;
        }
        if(!edges.empty()){
            for(int i=0;i<n-1;i++){
                auto &[u,v]=edges[i];
                pq[u].push(make_pair(s[u]+s[v],i));
                pq[v].push(make_pair(s[u]+s[v],i));
            }
            for(int i=1;i<=n;i++){
                if(i==minpos) continue;
                finpq.insert(make_pair(pq[i].top().first-s[rep[i]],i));
            }
        }
    }; 
    build();
    for(auto &[u,v]:ori){
        if(query(u)!=query(v)){
            unite(u,v);
            edges.push_back(make_pair(u,v));
        }
    }
    vector<ll> ans(n);
    ll smin=2e9,smax=0;
    for(int i=1;i<=n;i++){
        if(s[i]<smin){
            smin=s[i];
            minpos=i;
        }
        smax=max(smax,s[i]);
        ans[n-1]-=s[i];
    }
    ans[n-1]+=smax;
    for(int i=1;i<=n;i++){
        if(i==minpos) continue;
        ans[n-1]+=smin+s[i];
    }
    build();
    for(int i=n-2;i>=0;i--){
        auto [sum,node]=*finpq.begin();
        finpq.erase(finpq.begin());
        ans[i]=ans[i+1]+sum-smin;
        auto [w,eid]=pq[node].top();
        vis[eid]=1;
        auto [u,v]=edges[eid];
        if(query(u)!=node) swap(u,v);
        v=query(v);u=query(u);finpq.erase(make_pair(pq[v].top().first-s[rep[v]],v));
        a=u;
        b=v;
        if(pq[a].size()<pq[b].size()) swap(a,b);
        dsu[b]=a;
        while(!pq[b].empty()){
            if(vis[pq[b].top().second]){
                pq[b].pop();
            }
            else{
                pq[a].push(pq[b].top());
                pq[b].pop();
            }
        }
        rep[a]=rep[v];
        while(!pq[a].empty()){
            if(vis[pq[a].top().second]){
                pq[a].pop();
            }
            else{
                finpq.insert(make_pair(pq[a].top().first-s[rep[a]],a));
                
                break;
            }
        }
    }
    for(int i=0;i<=q;i++){
        if(i>=n) cout<<ans[n-1]<<"\n";
        else cout<<ans[i]<<"\n";
    }
}

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