제출 #668504

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
668504		Doxeno	Sirni (COCI17_sirni)	C++17	140 / 140	3183 ms	538840 KiB

sirni

#include <algorithm>
#include <bits/stdc++.h>
#include <functional>
#include <numeric>
#include <utility>
 
using namespace std;
vector<int> dad, sz;
inline int find(int a){
    if(dad[a] != a){
        dad[a] = find(dad[a]);
    }
    return dad[a];
}
inline bool uni (int a, int b){
    a = find(a);
    b = find(b);
    if(a == b)return 0;
    if(sz[a] < sz[b])swap(a,b);
    dad[b] = a;
    sz[a] += sz[b];
    return 1;
}

int main(){
    int N;
    cin >> N;
    set<int> s;
    int a;
 
    for(int i = 0; i < N; ++i){
        cin >> a;
        s.insert(a);
    }
    N = s.size();
    vector<int> v;
    for(auto x: s)v.emplace_back(x);
 
    long long ans = 0;
    const int m = 1e7+1;
    vector<vector<pair<int, int>>> eg(m);
 
    for(int i = 0; i < N; ++i){
        for(int j = v[i]; j <= v.back(); j += v[i]){
            int k = lower_bound(v.begin() + i + 1, v.end(), j) -v.begin();
            if(k < 0 || k >= N || v[k] - j >= v[i])continue;
            eg[v[k] - j].push_back({k, i});
        }
    }
 
 
    dad.resize(N); 
  	sz.assign(N, 1);
    iota(dad.begin(), dad.end(), 0);
 
 
    for(int w = 0; w < m; ++w){
        for(auto [i, j]: eg[w]){
            if(uni(i, j))ans += w;
        }
    }
 
 
 
    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