oj.uz

Submission #1057744

# Submission time Handle Problem Language Result Execution time Memory
1057744 2024-08-14T04:49:40 Z kitetrietrie Sirni (COCI17_sirni) C++14
140 / 140
 2641 ms 454132 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int nmax = 1e7 + 1;
using ll = long long;
int n;

vector<int> v;
int root[nmax + 5];
int nxt[nmax + 5];

struct tt{
    int x;
    int y;
    int z;
};

vector<tt> edge;

bool cmp(tt x, tt y){
    return x.z < y.z;
}

int find(int u) { return (u == root[u] ? u : root[u] = find(root[u])); }


signed main(){
    cin>>n;
    for(int i = 1 , x ; i <= n ; ++i){
        cin>>x;
        v.push_back(x);

    }
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
    int j = 0;
    for(int i = 1 ; i <= v.back() ; ++i){
        while(i > v[j] ) j++;
        nxt[i] = v[j];
    }


    for (int x : v) for (int y = x; y <= v.back(); y += x) {
        int p = nxt[(y==x?y+1:y)];
        if (!p) break;
        if (y + x < p) y = (p - y) / x * x + y;
        edge.push_back({x, p, p - y});
    }

    for(auto i : v) root[i] = i;

    sort(edge.begin(),edge.end(),cmp);
    ll ans = 0;
    for (tt ee : edge) {
        int u = ee.x, v = ee.y, c = ee.z;
        //cout<<u<<'.'<<v<<'.'<<c<<"\n";
        u = find(u), v = find(v);
        if (u != v) {
            root[u] = v;
            ans += 1ll*c;
        }
  }
  cout << ans;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 78684 KB Output is correct
2 Correct 28 ms 81232 KB Output is correct
3 Correct 13 ms 78872 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 16 ms 79316 KB Output is correct
3 Correct 13 ms 78700 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 78684 KB Output is correct
2 Correct 11 ms 70236 KB Output is correct
3 Correct 12 ms 78720 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 23348 KB Output is correct
2 Correct 265 ms 59168 KB Output is correct
3 Correct 112 ms 30000 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14076 KB Output is correct
2 Correct 172 ms 55344 KB Output is correct
3 Correct 91 ms 19744 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 55708 KB Output is correct
2 Correct 326 ms 104216 KB Output is correct
3 Correct 105 ms 31040 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 11328 KB Output is correct
2 Correct 336 ms 104716 KB Output is correct
3 Correct 118 ms 30792 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 95280 KB Output is correct
2 Correct 1701 ms 435976 KB Output is correct
3 Correct 155 ms 96736 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 93484 KB Output is correct
2 Correct 2438 ms 454132 KB Output is correct
3 Correct 172 ms 103464 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 81612 KB Output is correct
2 Correct 2641 ms 450804 KB Output is correct
3 Correct 115 ms 31028 KB Output is correct