oj.uz

Submission #370755

# Submission time Handle Problem Language Result Execution time Memory
370755 2021-02-24T14:31:51 Z Atill83 Sirni (COCI17_sirni) C++14
140 / 140
 4304 ms 574444 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
const int MAXM = (int) 1e7+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int p[MAXN];
int buy[MAXM];

vector<pii> edg[MAXM];

int par[MAXN];
int sz[MAXN];
int find_set(int p){
    if(par[p] == p)
        return p;
    return par[p] = find_set(par[p]);
}

void merge(int a, int b){
    if(sz[b] > sz[a])
        swap(a, b);
    par[b] = a;
    sz[a] += sz[b];
}



int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    /*cout<<"100000"<<endl;
    for(int i = 2; i < 1e7; i+=100)
        cout<<i<<" ";
    return 0;
    */
    cin>>n;
    memset(buy, -1, sizeof(buy));
    for(int i = 0; i < n; i++){
        cin>>p[i];
        if(p[i] == 1){
            cout<<0<<endl;
            return 0;
        }
    }


    sort(p, p + n);
    n = (unique(p, p + n) - p);

    for(int i = 0; i < n; i++){
        buy[p[i]] = i;
        par[i] = i;
        sz[i] = 1;
    }
    for(int i = MAXM - 1; i > 0; i--){
        if(buy[i - 1] == -1)
            buy[i - 1] = buy[i];
    }

    for(int i = 0; i < n; i++){
        int fir = buy[p[i] + 1];
        if(fir != -1 && p[fir] < 2*p[i]){
            assert(p[fir] - p[i] >= 0);
            edg[p[fir] - p[i]].push_back({i, fir});
        }
        for(ll j = 2LL*p[i]; j < MAXM; j += p[i])
            if(buy[j] != -1 && p[buy[j]] < j + p[i]){
                assert(p[buy[j]] - j >= 0);
                edg[p[buy[j]] - j].push_back({i, buy[j]});
            }
    }
    ll ans = 0;
    for(int i = 0; i < MAXM; i++){
        for(int j = 0; j < edg[i].size(); j++){
            pii u = edg[i][j];
            int a = find_set(u.ff), b = find_set(u.ss);
            if(a != b){
                ans += i;
                merge(a, b);
            }
        }
    }

    assert(sz[find_set(0)] == n);

    cout<<ans<<endl;


    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:89:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for(int j = 0; j < edg[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 230 ms 274540 KB Output is correct
2 Correct 285 ms 276844 KB Output is correct
3 Correct 245 ms 274668 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 322 ms 274540 KB Output is correct
2 Correct 569 ms 275052 KB Output is correct
3 Correct 233 ms 274796 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 274540 KB Output is correct
2 Correct 230 ms 274412 KB Output is correct
3 Correct 246 ms 274540 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 285224 KB Output is correct
2 Correct 981 ms 312224 KB Output is correct
3 Correct 527 ms 290016 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 276076 KB Output is correct
2 Correct 849 ms 296812 KB Output is correct
3 Correct 584 ms 284928 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 775 ms 297464 KB Output is correct
2 Correct 1220 ms 326816 KB Output is correct
3 Correct 518 ms 288608 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 513 ms 278104 KB Output is correct
2 Correct 1297 ms 321444 KB Output is correct
3 Correct 509 ms 287988 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 390 ms 287460 KB Output is correct
2 Correct 1906 ms 483832 KB Output is correct
3 Correct 421 ms 289896 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 287460 KB Output is correct
2 Correct 3907 ms 574444 KB Output is correct
3 Correct 467 ms 293764 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 276844 KB Output is correct
2 Correct 4304 ms 569940 KB Output is correct
3 Correct 530 ms 290016 KB Output is correct