oj.uz

Submission #959912

# Submission time Handle Problem Language Result Execution time Memory
959912 2024-04-09T10:04:25 Z VMaksimoski008 Sirni (COCI17_sirni) C++14
84 / 140
 1535 ms 786432 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[0] == v[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]) {
            while(j + 1 < n && v[j] < val) j++;
            if(v[j] == v[i]) j++;
            if(j != n) edges.push_back({ i, j, v[j] % v[i] });
        }
    }

    // for(int &x : v) cout << x << '\n';

    // for(auto &e : edges) cout << e.a << " " << e.b << ": " << e.w << '\n';

    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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 171 ms 51664 KB Output is correct
3 Correct 3 ms 1052 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Runtime error 650 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 856 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1128 ms 33372 KB Output is correct
2 Correct 1235 ms 56220 KB Output is correct
3 Correct 856 ms 55080 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 4604 KB Output is correct
2 Correct 236 ms 52500 KB Output is correct
3 Correct 819 ms 31556 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1254 ms 58096 KB Output is correct
2 Correct 1535 ms 105880 KB Output is correct
3 Correct 1140 ms 32492 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 10296 KB Output is correct
2 Correct 1392 ms 104744 KB Output is correct
3 Correct 987 ms 32316 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1244 ms 32308 KB Output is correct
2 Runtime error 730 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1287 ms 32060 KB Output is correct
2 Runtime error 804 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 6320 KB Output is correct
2 Runtime error 1208 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -