Submission #2060028

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}

class UnionFind {
  vector<int> data;
 public:
  UnionFind(int size) : data(size, -1) { }
  bool unionSet(int x, int y) {
    x = root(x); y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
    }
    return x != y;
  }
  bool findSet(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};

int Z;
vvi Q;

ll solve(){
    int Z = Q.size();
    if (Z == 1) return 0;

    int consume = (Q.size() - 1) * 2;
    ll cost = 0;
    int rest = 0;
    priority_queue<int> pq;
    rep(i, Z) {
        cost += Q[i][0]; --consume;
        int y = Q[i].size();
        rest += y - 1;
        for (int j=1; j<y; ++j) {
            pq.push(-Q[i][j]);
        }
    }
    if (consume > rest) return -1;
    rep(i, consume) {
        cost += -pq.top(); pq.pop();
    }
    return cost;
}

int main() {
    vector<int> tmp(2);
    loadvec(tmp, 2);
    int N=tmp[0], M=tmp[1];
    vector<int> a(N);
    loadvec(a, N);
    UnionFind uf(N);
    rep(i, M) {
        loadvec(tmp, 2);
        int x=tmp[0], y=tmp[1];
        uf.unionSet(x,y);
    }
    map<int,vi> ms;
    rep(i, N){
        ms[uf.root(i)].pb(a[i]);
    }
    for (auto p:ms){
        sort(ALL(p.second));
        Q.pb(p.second);
    }
    // sort(ALL(Q));
    ll ans = solve();
    if (ans < 0) {
        cout << "Impossible" << endl;
    } else {
        cout << ans << endl;
    }
    return 0;
}

Submission Info

Judge Result