oj.uz

Submission #959901

# Submission time Handle Problem Language Result Execution time Memory
959901 2024-04-09T09:52:39 Z VMaksimoski008 Sirni (COCI17_sirni) C++14
84 / 140
 2096 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;

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) {
        cout << 0 << '\n';
        return 0;
    }

    DSU dsu; dsu.config(n);
    vector<Edge> edges;

    int mx = *max_element(all(v));
    for(int i=0; i<v.size(); i++) {
        for(int val=v[i]; val<=mx; val+=v[i]) {
            int p = lower_bound(all(v), val) - v.begin();
            if(p == v.size()) continue;
            if(v[p] == v[i]) p++;
            if(p != v.size()) edges.push_back({ i, p, v[p] % v[i] });
        }
    }

    sort(all(edges));

    for(Edge &e : edges)
        if(dsu.uni(e.a, e.b)) ans += e.w;
    cout << ans << '\n';
    return 0;
}

Compilation message

sirni.cpp: In function 'int32_t main()':
sirni.cpp:84:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for(int i=0; i<v.size(); i++) {
      |                  ~^~~~~~~~~
sirni.cpp:87:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |             if(p == v.size()) continue;
      |                ~~^~~~~~~~~~~
sirni.cpp:89:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |             if(p != v.size()) edges.push_back({ i, p, v[p] % v[i] });
      |                ~~^~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 145 ms 51240 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 871 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 600 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 31732 KB Output is correct
2 Correct 478 ms 56884 KB Output is correct
3 Correct 241 ms 56472 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 5888 KB Output is correct
2 Correct 233 ms 52252 KB Output is correct
3 Correct 146 ms 31176 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 305 ms 56492 KB Output is correct
2 Correct 676 ms 106160 KB Output is correct
3 Correct 219 ms 31620 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 10552 KB Output is correct
2 Correct 630 ms 105116 KB Output is correct
3 Correct 215 ms 32172 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 32596 KB Output is correct
2 Runtime error 1626 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 215 ms 32564 KB Output is correct
2 Runtime error 1476 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 29 ms 4864 KB Output is correct
2 Runtime error 2096 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -