#1196202 (C++23) No.3781 Erase One, Gain from the Other

• 問題: No.3781 Erase One, Gain from the Other
• ユーザー: noya2
• 提出日時: 2026-10-31 02:14:35
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 275 ms / 2,000 ms
• コード長: 8,796 bytes
• コンパイル時間: 3,894 ms
• コンパイル使用メモリ: 372,072 KB
• 実行使用メモリ: 68,944 KB
• 最終ジャッジ日時: 2026-10-31 02:14:49
• 合計ジャッジ時間: 12,457 ms
• ジャッジサーバーID （参考情報）: judge4_0 / judge3_0

ファイルパターン	結果
sample	AC * 1
other	AC * 34

ソースコード

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

// https://judge.yosupo.jp/submission/360414

template<class T>
struct DirectedMST{
  private:
    struct dsu_undo{
      int n;
      vector<int> par;
      vector<pair<int,int>> history;
      vector<size_t> snapshots;
      dsu_undo(int m) : n(m), par(n*2,-1){
        iota(par.begin()+n,par.end(),0);
      }
      int leader(int i){
        if(par[i] < 0) return i;
        history.emplace_back(i,par[i]);
        return par[i] = leader(par[i]);
      }
      int get(int i){return par[leader(i)+n];}
      int get_naive(int i){
        while(par[i] > 0) i = par[i];
        return par[i+n];
      }
      void merge(int i, int j, int k){
        i = leader(i), j = leader(j);
        if(i != j) {
          history.emplace_back(i,par[i]);
          history.emplace_back(j,par[j]);
          if(par[i] > par[j]) swap(i,j);
          par[i] += par[j];
          par[j] = i;
        }
        history.emplace_back(i+n,par[i+n]);
        par[i+n] = k;
      }
      void snapshot(){snapshots.emplace_back(history.size());}
      void undo(){
        while(history.size() > snapshots.back()){
          par[history.back().first] = history.back().second;
          history.pop_back();
        }
        snapshots.pop_back();
      }
    };
    struct skew_heap{
      private:
        int n;
        vector<T> val, lz;
        vector<int> l, r;
        void push(int i){
          if(~l[i]) add(l[i],lz[i]);
          if(~r[i]) add(r[i],lz[i]);
          lz[i] = 0;
        }
      public:
        skew_heap(const vector<T>& val_) : n(val_.size()), val(val_), lz(n,0), l(n,-1), r(n,-1) {}
        void add(int i, T f){val[i] += f, lz[i] += f;}
        int merge(int x, int y){
          if(!~x) return y;
          if(!~y) return x;
          if(val[y] < val[x]) swap(x,y);
          ll res = x;
          int z = -1;
          while(~x){
            if(val[y] < val[x]){
              swap(x,y);
              if(~z) r[z] = x;
            }
            z = x;
            swap(l[x],r[x]);
            push(x);
            x = r[x];
          }
          r[z] = y;
          return res;
        }
        inline T get(int i){return val[i];}
        int pop(int i){
          push(i);
          return merge(l[i],r[i]);
        }
    };
    int n, m;
    vector<T> weight;
    vector<int> h, from, to, nxt;
  public:
    DirectedMST(int n_) : n(n_), m(0), h(n_,-1){}
    void add_edge(int u, int v, T w){
      weight.push_back(w);
      from.push_back(v);
      to.push_back(u);
      nxt.push_back(h[v]);
      h[v] = m++;
    }
    pair<T,vector<int>> solve(int root){
      skew_heap hp(weight);
      dsu_undo d(n*2);
      vector<int> top(n,-1), st, link(n,-1);
      for(int u = 0; u < n; ++u) if(u != root) for(int e = h[u]; ~e; e = nxt[e]) top[u] = hp.merge(top[u],e);
      st.reserve(n);
      vector<bool> seen(n,false);
      seen[root] = true;
      link[root] = -2;
      int cur = n;
      T ans = 0;
      for(int u = 0; u < n; ++u) if(!~link[u]){
        int v = u;
        while(!seen[v]){
          if(~link[v]){
            link.push_back(-1);
            top.push_back(-1);
            seen.push_back(false);
            d.snapshot();
            while(true){
              int w = st.back();
              top[cur] = hp.merge(top[cur],top[w]);
              d.merge(cur,w,cur);
              if(w == v) break;
              st.pop_back();
            }
            st.pop_back();
            v = cur++;
          }
          ll e = top[v];
          while(~e && d.get(to[e]) == v) e = hp.pop(e);
          if(!~e) return {};
          st.push_back(v);
          link[v] = e;
          ans += hp.get(e);
          hp.add(e,-hp.get(e));
          top[v] = hp.pop(e);
          v = d.get(to[e]);
        }
        while(!st.empty()){
          seen[st.back()] = 1;
          st.pop_back();
        }
      }
      link[root] = -1;
      for(--cur; cur >= n; --cur){
        d.undo();
        int v = d.get_naive(from[link[cur]]);
        link[v] = link[cur];
        link.pop_back();
      }
      return {ans,link};
    }
};

void solve(){
    int n, m; in(n,m);
    DirectedMST<ll> g(n+1);
    vector<ll> a(n); in(a);
    const ll BIG = 1001001001;
    rep(i,m){
        int u, v; in(u,v); u--, v--;
        g.add_edge(u,v,BIG-a[u]);
        g.add_edge(v,u,BIG-a[v]);
    }
    rep(i,n){
        g.add_edge(n,i,BIG-0);
    }
    ll ans = g.solve(n).first;
    ans = BIG * n - ans;
    out(ans);
}

int main(){
    int t = 1; in(t);
    while (t--) { solve(); }
}