oj.uz

Submission #1106074

# Submission time Handle Problem Language Result Execution time Memory
1106074 2024-10-29T07:18:23 Z nasir_bashirov Sirni (COCI17_sirni) C++17
98 / 140
 5000 ms 402280 KB 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define db long double
#define vll vector<pll>
#define endl '\n'
#define all(x) x.begin(), x.end()
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

// #define int long long

struct DSU{
    vi par;
    int components;
    DSU(int sz){
        components = sz;
        par.resize(sz + 5, -1);
    }
    int Find(int u){
        if(par[u] < 0)   return u;
        else    return par[u] = Find(par[u]);
    }
    bool Union(int u, int v){
        u = Find(u), v = Find(v);
        if(u != v){
            if(par[u] < par[v]){
                swap(u, v);
            }
            par[u] += par[v];
            par[v] = u;
            components--;
            return true;
        }
        else{
            return false;
        }
    }
};

const int sz = 1e5 + 5;
int n, a[sz], mx;
ll res = 0;

void fmain(){
    fastio;
    cin >> n;
    set<int> st;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        mx = max(mx, a[i]);
        st.insert(a[i]);
    }
    vector<pair<int, pii>> v;
    for(int i : st){
        auto itt = st.upper_bound(i);
        if(itt != st.end()) v.push_back({min(*itt % i, i % *itt), {i, *itt}});
        for(int j = i * 2; j <= mx; j += i){
            auto it = st.lower_bound(j);
            if(it != st.end()){
                v.push_back({min(*it % i, i % *it), {i, *it}});
                j = *it / i * i;
            }
        }
    }
    sort(all(v));
    DSU t(mx);
    for(auto i : v){
        res += i.first * t.Union(i.second.first, i.second.second);
    }
    cout << res;
}

signed main(){
    int tmr = 1;
    // cin >> tmr;
    while(tmr--){
        fmain();
    }
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 39760 KB Output is correct
2 Correct 37 ms 41656 KB Output is correct
3 Correct 10 ms 39540 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 592 KB Output is correct
2 Correct 15 ms 40320 KB Output is correct
3 Correct 9 ms 39696 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 39760 KB Output is correct
2 Correct 9 ms 39504 KB Output is correct
3 Correct 10 ms 39760 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 313 ms 22016 KB Output is correct
2 Correct 1084 ms 56736 KB Output is correct
3 Correct 384 ms 31636 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 7352 KB Output is correct
2 Correct 305 ms 53152 KB Output is correct
3 Correct 286 ms 19520 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 667 ms 57196 KB Output is correct
2 Correct 1310 ms 106240 KB Output is correct
3 Correct 357 ms 32420 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 9668 KB Output is correct
2 Correct 1103 ms 105384 KB Output is correct
3 Correct 373 ms 32028 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 59488 KB Output is correct
2 Execution timed out 5079 ms 402280 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 59044 KB Output is correct
2 Execution timed out 5078 ms 401352 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 42680 KB Output is correct
2 Execution timed out 5073 ms 401000 KB Time limit exceeded
3 Halted 0 ms 0 KB -