Submission #1369801

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__",", __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000

struct edge{
  int to, cost, id;
};

vector<edge> vec[100];
bool visited[100];
pair<int,bool> es[10000];
// edge-id, is-heiro?

int circle_from = -1;
bool dfs(int d, int from){
  visited[d]=true;
  bool iscircle=false;
  for(auto &e : vec[d]) if(e.to!=from){
    if(visited[e.to]){
      iscircle = true;
      es[e.id].se = true;
      circle_from = e.to;
    }
    else {
      if( dfs(e.to, d) ){
        iscircle = true;
        es[e.id].se = true;
      }
    }
  }
  if(circle_from==d) iscircle=false;
  return iscircle;
}

int main(){
  int n,m,k;
  cin>>n>>m>>k;
  rep(i,m){
    int a,b,c;
    cin>>a>>b>>c;
    a--;b--;
    vec[a].pb(((edge){b,c,i}));
    vec[b].pb(((edge){a,c,i}));
    es[i] = mp(c,false);
  }

  fill(visited, visited+n, false);
  int s = 0;
  rep(i,n) if(!visited[i]){
    s++;
    dfs(i,-1);
  }

  if(s>=k){
    cout << 0 << endl;
    return 0;
  }

  sort(es, es+m);

  vector<int> heiro, eda;
  rep(i,m){
    if(es[i].se) heiro.pb(es[i].fi);
    else eda.pb(es[i].fi);
  }
  sort(all(heiro)); sort(all(eda));

  long ans = 12345678901234;
  if(eda.size()>=k-s){
    long tmp = 0;
    rep(i,k-s) tmp+= eda[i];
    ans = min(ans, tmp);
  }
  if(heiro.size()>0){
    long tmp = heiro[0];
    vector<int> hoge;
    hoge.resize(eda.size()+heiro.size()-1);
    merge(all(eda), ++begin(heiro), end(heiro), hoge.begin());
    rep(i,k-s) tmp += hoge[i];
    ans = min(ans, tmp);
  }
  assert(ans < INF);
  cout << ans << endl;
  //
  // int ans = INF;
  // if(k-s+1<=m){
  //   int tmp = 0;
  //   rep(i,k-s+1) tmp += es[i].fi;
  //   ans = min(tmp, ans);
  // }
  // {
  //   int i=0; int cnt=0; int tmp=0;
  //   while(i<m && cnt<k-s){
  //     if(es[i].se==false){cnt++; tmp+=es[i].fi;}
  //     i++;
  //   }
  //   if(cnt==k-s) ans = min(ans, tmp);
  // }
  // cout << ans << endl;

  return 0;
}

Submission Info

Judge Result