fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "icebear"
  33. /*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
  34.  
  35. const int MOD = 1e9 + 7;
  36. const int inf = 1e9 + 27092008;
  37. const ll INF = 1e18 + 27092008;
  38. const int N = 150 + 5;
  39. int n, x[N], y[N];
  40. struct Edge {
  41.     int u, v;
  42.     long double d;
  43.     bool operator < (const Edge &other) const {
  44.         return d < other.d;
  45.     }
  46. };
  47. vector<Edge> edges;
  48. int lab[N];
  49. long double w, c;
  50.  
  51. int root(int v) {
  52.     return (lab[v] < 0 ? v : lab[v] = root(lab[v]));
  53. }
  54.  
  55. bool unite(int u, int v) {
  56.     u = root(u); v = root(v);
  57.     if (u == v) return false;
  58.     if (lab[u] > lab[v]) swap(u, v);
  59.     lab[u] += lab[v];
  60.     lab[v] = u;
  61.     return true;
  62. }
  63.  
  64. long double MST() {
  65.     sort(all(edges));
  66.     memset(lab, -1, sizeof lab);
  67.     long double ans = 0;
  68.     for(auto &x : edges) if (unite(x.u, x.v))
  69.         ans += x.d;
  70.     return ans;
  71. }
  72.  
  73. void init(void) {
  74.     cin >> n;
  75.     FOR(i, 1, n) cin >> x[i] >> y[i];
  76.     cin >> w >> c;
  77.     FOR(i, 1, n) FOR(j, i + 1, n)
  78.         edges.pb({i, j, (long double)sqrt((x[i]-x[j])*(x[i]-x[j]) + (y[i]-y[j])*(y[i]-y[j])) * c});
  79. }
  80.  
  81. void process(void) {
  82.     long double ans = MST();
  83.     FOR(i, 1, n) edges.pb({0, i, w});
  84.     cout << fixed << setprecision(9) << min(ans, MST());
  85. }
  86.  
  87. int main() {
  88.     ios_base::sync_with_stdio(0);
  89.     cin.tie(0); cout.tie(0);
  90.     if (fopen(task".inp", "r")) {
  91.         freopen(task".inp", "r", stdin);
  92.         freopen(task".out", "w", stdout);
  93.     }
  94.     int tc = 1;
  95. //    cin >> tc;
  96.     while(tc--) {
  97.         init();
  98.         process();
  99.     }
  100.     return 0;
  101. }
  102.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0.000000000
https://ideone.com/oqH3Fr
language:
C++14 (gcc 8.3)
created:
14 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!