제출 #551571

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
551571		chenwz	Sirni (COCI17_sirni)	C++11	140 / 140	4989 ms	395436 KiB

sirni

// [COCI2016-2017#6] Sirni
#include <bits/stdc++.h>
using namespace std;
const int NN = 1e5 + 4;
#define _for(i, a, b) for (int i = (a); i < (int)(b); ++i)
int P[NN], pa[NN];
int find_set(int x) { return pa[x] == x ? x : pa[x] = find_set(pa[x]); }
struct Edge {
  int u, v, w;
  bool operator<(const Edge& e) const { return w < e.w; }
};
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  vector<Edge> es;
  int n;
  cin >> n;
  _for(i, 0, n) cin >> P[i], pa[i] = i;
  sort(P, P + n), n = unique(P, P + n) - P;
  long long ans = 0;
  _for(i, 0, n) for (int x = P[i], y = x; y <= P[n - 1]; y += x) {
    int k = lower_bound(P + i + 1, P + n, y) - P;
    if (k < n && P[k] / x == y / x) es.push_back({i, k, P[k] % x});
  }
  sort(es.begin(), es.end());
  for (const Edge& e : es) {
    int u = find_set(e.u), v = find_set(e.v);
    if (u != v) ans += e.w, pa[u] = v;
  }
  cout << ans << endl;
  return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14