제출 #978922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978922		Br3ad	Sirni (COCI17_sirni)	C++17	0 / 140	455 ms	130352 KiB

sirni

#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <numeric>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>

using namespace std;
#define ll long long
#define ull unsigned long long
#define f first
#define s second
#define PF push_front
#define PB push_back
#define MP make_pair
#define max(a, b) ((a > b)? a : b)
#define min(a, b) ((a < b)? a : b)
#define max3(a, b, c) max(max(a, b), c)
#define min3(a, b, c) min(min(a, b), c)

const int N = 1e5 + 5;
const int P = 1e7 + 5;
const int M = 1e9 + 7; 
const int inf = 0x3f3f3f3f;
const ll int INF = 1e18;

struct DSU {
    vector<int> parent;

    DSU(int n){
        parent = vector<int>(n);
        iota(parent.begin(), parent.end(), 0);
    }

    int find_parent(int p){
        return (parent[p] == p)? p : parent[p] = find_parent(parent[p]);
    }

    bool merge(int a, int b){
        a = find_parent(a);
        b = find_parent(b);
        parent[a] = b;
        return (a != b);
    }
};

int main(){
    
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    // ifstream cin();
    // ofstream cout();
    
    int n, p[N];
    cin >> n;
    for(int i = 0; i < n; i++){
        cin >> p[i];
    }

    sort(p, p+n);

    vector<pair<int, int>> nearest(P, MP(0, 0));
    nearest[P-1] = {-1, -1};
    for(int i = 0; i < n; i++) nearest[p[i]] = {p[i], i};
    for(int i = P-2; i >= 0; i--){
        if(nearest[i].f == 0) nearest[i] = nearest[i+1];
    }

    vector<pair<int, pair<int, int>>> edge;
    for(int i = 0; i < n; i++){
        if(nearest[p[i]+1].f == -1) break;
        edge.PB(MP(nearest[p[i]+1].f%p[i], MP(i, nearest[p[i]+1].s)));

        for(int cur = p[i]*2; cur < P; cur += p[i]){
            if(nearest[cur].f == -1) break;
            edge.PB(MP(nearest[cur].f%p[i], MP(i, nearest[cur].s)));
        }
    }

    sort(edge.begin(), edge.end());
    DSU dsu(n);

    int ans = 0;
    for(auto [w, p] : edge){
        if(dsu.merge(p.f, p.s)){
            ans += w;
        }
    }

    cout << ans << endl;
}

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