oj.uz

Submission #844172

# Submission time Handle Problem Language Result Execution time Memory
844172 2023-09-05T10:34:41 Z amine_aroua Sirni (COCI17_sirni) C++17
84 / 140
 3801 ms 786432 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(int i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>

const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;

ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (gcd)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (lcm)

// HERE IS THE SOLUTION
struct DSU
{
    vi e;
    DSU(int n)
    {
        e.assign(n , -1);
    }
    int getPar(int x)
    {
        return (e[x] < 0 ? x : e[x] = getPar(e[x]));
    }
    int getSZ(int x)
    {
        return -e[getPar(x)];
    }
    bool unite(int u , int v)
    {
        u = getPar(u) , v = getPar(v);
        if(u == v)
            return 0;
        if(e[u] > e[v])
            swap(u , v);
        e[u]+=e[v];
        e[v] = u;
        return 1;
    }
};
signed main()
{
    boost;
    cin.tie(0);
    cout.tie(0);
    int n ;
    cin>>n;
    int v[n];
    int mx = 0;
    fore(i , n)
    {
        cin>>v[i];
        mx = max(mx , v[i]);
    }
//    if(n <= 1000)
//    {
//        vector<tuple<int , int , int>> edg;
//        fore(i , n)
//        {
//            forr(j, i + 1, n - 1)
//            {
//                edg.pb({min(v[i]%v[j] , v[j]%v[i]) , i , j});
//            }
//        }
//        sort(all(edg));
//        DSU dsu(n);
//        int ans =0;
//        int cnt = n - 1;
//        for(auto [c , U , V] : edg)
//        {
//            if(cnt == 0)
//                break;
//            if(dsu.unite(U , V))
//            {
//                cnt--;
//                ans+=c;
//            }
//        }
//        cout<<ans<<nl;
//    }
//    else
//    {
        sort(v , v + n);
        vii edg[mx + 1];
        fore(i , n)
        {
            int x = v[i];
            int idx = i + 1;
            for(int j = x;j<=mx;j+=x)
            {
                while(idx < n && v[idx] < j)
                {
                    idx++;
                }
                if(idx < n)
                {
                    edg[v[idx]%x].pb({i , idx});
                }
                idx++;
            }
        }
        vector<tuple<int , int , int>> sorted;
        fore(i , mx + 1)
        {
            for(auto [a , b] : edg[i])
            {
                sorted.pb({i , a , b});
            }
        }
        DSU dsu(n);
        int ans = 0;
        int cnt = n - 1;
        for(auto [c , U , V] : sorted)
        {
            if(!cnt)
                break;
            if(dsu.unite(U , V))
            {
                ans+=c;
                cnt--;
            }
        }
        cout<<ans<<nl;
//    }

}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 235724 KB Output is correct
2 Correct 174 ms 247236 KB Output is correct
3 Correct 162 ms 235116 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 227 ms 239996 KB Output is correct
3 Correct 168 ms 235852 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 235600 KB Output is correct
2 Correct 161 ms 234832 KB Output is correct
3 Correct 173 ms 235796 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2145 ms 95912 KB Output is correct
2 Correct 2102 ms 335496 KB Output is correct
3 Correct 2211 ms 174952 KB Output is correct

Subtask #5
0 / 14.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2249 ms 176004 KB Output is correct
2 Correct 2513 ms 591004 KB Output is correct
3 Correct 2112 ms 106816 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 26520 KB Output is correct
2 Correct 3339 ms 388516 KB Output is correct
3 Correct 2191 ms 119316 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2272 ms 310116 KB Output is correct
2 Runtime error 757 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 2383 ms 310280 KB Output is correct
2 Runtime error 942 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 266 ms 247272 KB Output is correct
2 Runtime error 1308 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -