oj.uz

답안 #959924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959924 2024-04-09T10:17:58 Z VMaksimoski008 Sirni (COCI17_sirni) C++14
140 / 140
 3974 ms 402452 KB 
#include <bits/stdc++.h>
 
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
 
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
 
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
 
struct DSU {
    int n, comp;
    vector<int> par, size;
 
    void config(int _n) {
        n = _n + 1;
        comp = _n;
        par.resize(n+1);
        size.resize(n+1, 1);
        for(int i=1; i<=n; i++) par[i] = i;
    }
 
    int get(int u) {
        if(u == par[u]) return u;
        return par[u] = get(par[u]);
    }
 
    bool uni(int u, int v) {
        u = get(u), v = get(v);
 
        if(u == v) return false;
        if(size[u] < size[v]) swap(u, v);
 
        size[u] += size[v];
        par[v] = u;
        comp--;
 
        return true;
    }
 
    int getComp() { return comp; }
    int getSize(int u) { return size[get(u)]; }
    bool sameSet(int u, int v) { return get(u) == get(v); }
};
 
struct Edge {
    int a, b, w;
    bool operator<(Edge &e) { return w < e.w; }
};
 
int32_t main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);
 
    int n;
    ll ans = 0;
    cin >> n;
 
    vector<int> v(n);
    for(int &x : v) cin >> x;
    set<int> s;
    for(int &x : v) s.insert(x);
    v = vector<int>(all(s));
 
    if(v[0] == 1 || v.size() == 1) {
        cout << 0 << '\n';
        return 0;
    }
 
    DSU dsu; dsu.config(n);
    vector<Edge> edges;
 
    n = v.size();
    int mx = v[n-1];
    for(int i=0; i<n; i++) {
        int j = i;
        for(int val=v[i]; val<=mx; val+=v[i]) {
            int last = j;
            while(j + 1 < n && v[j] < val) j++;
            if(v[j] == v[i]) j++;
            if(j != n && last != j) edges.push_back({ i, j, v[j] % v[i] });
        }
    }
 
    sort(all(edges));
    for(Edge &e : edges)
        if(dsu.uni(e.a, e.b)) ans += e.w;
    cout << ans << '\n';
    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 30 ms 4472 KB Output is correct
3 Correct 2 ms 796 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 99 ms 1592 KB Output is correct
3 Correct 2 ms 600 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 720 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 932 ms 20152 KB Output is correct
2 Correct 1054 ms 56896 KB Output is correct
3 Correct 692 ms 31104 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 5880 KB Output is correct
2 Correct 232 ms 52540 KB Output is correct
3 Correct 669 ms 19116 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1054 ms 57456 KB Output is correct
2 Correct 1292 ms 106024 KB Output is correct
3 Correct 931 ms 33312 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 10284 KB Output is correct
2 Correct 1153 ms 105300 KB Output is correct
3 Correct 768 ms 31492 KB Output is correct

Subtask #8
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1061 ms 32516 KB Output is correct
2 Correct 3194 ms 402452 KB Output is correct
3 Correct 1069 ms 33104 KB Output is correct

Subtask #9
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1041 ms 32044 KB Output is correct
2 Correct 3974 ms 400312 KB Output is correct
3 Correct 1056 ms 32824 KB Output is correct

Subtask #10
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 5628 KB Output is correct
2 Correct 3922 ms 399968 KB Output is correct
3 Correct 807 ms 31292 KB Output is correct