Submission #715155

#	Time	Username	Problem	Language	Result	Execution time	Memory
715155		ismayil	Sirni (COCI17_sirni)	C++17	42 / 140	339 ms	786432 KiB

sirni

#include <bits/stdc++.h>
#define ll long long
using namespace std;
struct edge{
    int u, v, w;
    bool operator<(edge other){
        return w < other.w;
    }
};
const int MAX = 1e3 + 1;
int _parent[MAX], _size[MAX];
void make(int i){
    _parent[i] = i;
    _size[i] = 1;
}
int find(int i){
    if(_parent[i] == i) return i;
    return _parent[i] = find(_parent[i]);
}
bool  merge(int u, int v){
    u = find(u), v = find(v);
    if(u == v) return false;
    if(_size[u] < _size[v]) swap(u, v);
    _parent[v] = u;
    _size[u] += _size[v];
    return true;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n;
    cin>>n;
    vector<int> P(n + 1);
    int g[n + 1][n + 1];
    for(int i = 1; i <= n; i++) cin>>P[i], make(i);
    for(int i = 1; i <= n; i++){
        for(int j = i + 1; j <= n; j++){
            g[i][j] = min(P[i] % P[j], P[j] % P[i]);
        }
    }
    vector<edge> edges;
    for(int i = 1; i <= n; i++){
        for(int j = i + 1; j <= n; j++){
            edges.push_back({i, j, g[i][j]});
        }
    }
    sort(edges.begin(), edges.end());
    int ans = 0;
    for(auto e : edges){
        if(merge(e.u, e.v)){
            ans += e.w;
            n--;
        }
    }
    cout<<ans<<endl;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 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