oj.uz

답안 #976730

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976730 2024-05-07T04:23:04 Z eysbutno Sirni (COCI17_sirni) C++17
140 / 140
 1601 ms 770656 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = array<int, 2>;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

#ifdef LOCAL
#include "../src/debug.hpp"
#else
#define debug(...) 420
#endif
// g++ -DLOCAL -Wall Practice.cpp -o bin

template<class T> bool smax(T &a, T b) {
    return a < b ? a = b, 1 : 0;
}
template<class T> bool smin(T &a, T b) {
    return a > b ? a = b, 1 : 0;
}
struct DisjointSet {
    vector<int> e;
    DisjointSet(int n) : e(n, -1) {}
    int get(int x) { 
        return e[x] < 0 ? x : e[x] = get(e[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;
    }
};
void solve() {
    int n; cin >> n;
    vector<int> p(n);
    for (int &i : p) {
        cin >> i;
    }
    sort(all(p));
    p.erase(unique(all(p)), end(p));
    const int MX = p.back();
    n = sz(p);
    vector<int> nxt(MX + 1, -1);
    for (int i = 0; i < n; i++) {
        nxt[p[i]] = i;
    }
    for (int i = MX - 1; i >= 1; i--) {
        if (nxt[i] == -1) nxt[i] = nxt[i + 1];
    }
    vector<vector<pii>> edges(MX + 1);
    for (int i = 0; i + 1 < n; i++) {
        edges[p[i + 1] % p[i]].push_back({i, i + 1});
        for (int j = p[i] * 2; j <= MX; j += p[i]) {
            edges[p[nxt[j]] % p[i]].push_back({i, nxt[j]});
        }
    }
    ll res = 0;
    DisjointSet dsu(n);
    for (int i = 0; i <= MX; i++) {
        for (auto [u, v] : edges[i]) {
            if (dsu.unite(u, v)) res += i;
        }
    }
    cout << res << "\n";  
}
int main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1; // cin >> t;
    while (t--) solve();
}
/**
 * Instead of linking up indices, we are
 * interested in linking up numbers, per se.
 * Assume we have some number N. All other numbers
 * that are greater than N can be represented as 
 * KN + v. Obviously, we want to minimize v. So, we
 * can brute force every value of K (because harmonic).
*/

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 274180 KB Output is correct
2 Correct 172 ms 302704 KB Output is correct
3 Correct 105 ms 273560 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1087 ms 668956 KB Output is correct
3 Correct 108 ms 275028 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 274468 KB Output is correct
2 Correct 105 ms 274048 KB Output is correct
3 Correct 108 ms 274512 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 38028 KB Output is correct
2 Correct 94 ms 71240 KB Output is correct
3 Correct 61 ms 51064 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 29784 KB Output is correct
2 Correct 72 ms 51264 KB Output is correct
3 Correct 36 ms 24924 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 49876 KB Output is correct
2 Correct 119 ms 88364 KB Output is correct
3 Correct 54 ms 47416 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 9420 KB Output is correct
2 Correct 125 ms 87328 KB Output is correct
3 Correct 56 ms 51260 KB Output is correct

Subtask #8
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 288324 KB Output is correct
2 Correct 997 ms 646100 KB Output is correct
3 Correct 168 ms 291480 KB Output is correct

Subtask #9
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 292048 KB Output is correct
2 Correct 1601 ms 770656 KB Output is correct
3 Correct 256 ms 349896 KB Output is correct

Subtask #10
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 276720 KB Output is correct
2 Correct 1589 ms 635548 KB Output is correct
3 Correct 67 ms 54356 KB Output is correct