제출 #715383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715383		fuad27	Sirni (COCI17_sirni)	C++17	84 / 140	1392 ms	786432 KiB

sirni

#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
struct DSU {
  vector<int> e;
  DSU(int N) {e = vector<int>(N, -1);}
  int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
  bool same_set(int a, int b) { return get(a) == get(b); }
  int size(int x) { return -e[get(x)]; }
  bool unite(int x, int y) {
    x = get(x), y = get(y);
    if (x == y) return false;
    if (e[x] > e[y]) swap(x, y);
    e[x] += e[y]; e[y] = x; return true;
  }
};
const int N=1e7+100;
vector<int> great(N,1e9);
vector<pair<long long, pair<int,int>>> ed;
int main () {
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  vector<int> v;
  {
    set<int> s;
    for(int i = 0;i<n;i++) {
      int a;
      cin >> a;
      s.insert(a);
    }
    v=vector<int>(s.begin(),s.end());
  }
  n=v.size();
  for(int i = 0;i<n;i++)great[v[i]]=i;
  for(int j = N-3;j>=0;j--) {
      great[j]=min(great[j],great[j+1]);
  }
  for(int i=0;i<n;i++) {
    for(int j=v[i];j<N-3;j+=v[i]) {
      if(j!=v[i]) {
        if(great[j]<n) {
          ed.push_back({v[great[j]]-j,{i,great[j]}});
        }
      }
      else if(great[j+1]<n) {
        ed.push_back({v[great[j+1]]-j,{i,great[j+1]}});
      }
    }
  }
  sort(ed.begin(),ed.end());
  DSU d(n+1);
  long long sum=0;
  for(auto i:ed) {
    sum+=(int)d.unite(i.second.first,i.second.second)*i.first;
  }
  cout << sum << "\n";
}

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