oj.uz

Submission #46360

# Submission time Handle Problem Language Result Execution time Memory
46360 2018-04-19T18:15:38 Z evpipis Sirni (COCI17_sirni) C++11
98 / 140
 5000 ms 458132 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fi first
#define se second
#define mp make_pair
typedef pair<int, int> ii;
typedef long long ll;

const int len = 1e5+2;
int cnt[100*len], nex[100*len][2], p[len], r[len];
int u[100 * len], v[100 * len], edcnt = 0;
int cnt_sz[100*len];
vector<int> vec[100*len];

int fin(int i){
    if (p[i] == i) return i;
    return p[i] = fin(p[i]);
}

void join(int i, int j){
    if (r[i] > r[j])
        p[j] = i;
    else{
        p[i] = j;
        if (r[i] == r[j]) r[j]++;
    }
}

void read(int &res){
    char c;
    while (c = getchar(), c < '0' || c > '9'){}
    res = c-'0';
    while (c = getchar(), c >= '0' && c <= '9')
        res = 10*res+c-'0';
}

int main(){
    int n, m = 0, k = 0;
    read(n);
    for (int i = 0; i < n; i++){
        int temp;
        read(temp);

        m = max(m, temp);
        if (!cnt[temp]) cnt[temp] = ++k;
    }

    for (int i = m; i >= 1; i--){
        nex[i][0] = nex[i+1][0];
        if (cnt[i]) nex[i][0] = i;

        nex[i][1] = nex[i+1][1];
        if (cnt[i+1]) nex[i][1] = i+1;
    }

    for (int i = 1; i <= k; i++){
        r[i] = 0;
        p[i] = i;
    }

    for (int i = 1; i <= m; i++) {
        if (cnt[i]) {
            for (int j = i; j <= m; j+=i){
                if (j == i && nex[j][1] && nex[j][1] < j+i){
                    cnt_sz[nex[j][1]-j]++;
                }
                else if (j != i && nex[j][0] && nex[j][0] < j+i){
                    cnt_sz[nex[j][0]-j]++;
                }
            }
        }
    }

    for (int i = 0; i <= m; i++){
        if (cnt_sz[i])
            vec[i].reserve(cnt_sz[i]);
    }

    for (int i = 1; i <= m; i++)
        if (cnt[i])
            for (int j = i; j <= m; j+=i){
                if (j == i && nex[j][1] && nex[j][1] < j+i) {
                    u[edcnt] = cnt[i];
                    v[edcnt] = cnt[nex[j][1]];
                    vec[nex[j][1]-j].pb(edcnt);
                    edcnt++;
                    //vec[nex[j][1]-j].pb(mp(cnt[i], cnt[nex[j][1]]));
                }
                else if (j != i && nex[j][0] && nex[j][0] < j+i){
                    u[edcnt] = cnt[i];
                    v[edcnt] = cnt[nex[j][0]];
                    vec[nex[j][0]-j].pb(edcnt);
                    edcnt++;
                    //vec[nex[j][0]-j].pb(mp(cnt[i], cnt[nex[j][0]]));
                }
            }

    ll ans = 0;
    for (int i = 0; i <= m; i++){
        if (k == 1) break;
        for (auto it : vec[i]){
            if (k == 1) break;
            int x = fin(u[it]), y = fin(v[it]);
            if (x != y)
                join(x, y), ans += i, k--;
        }
    }

    printf("%lld\n", ans);
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 336 ms 317524 KB Output is correct
2 Correct 440 ms 317928 KB Output is correct
3 Correct 303 ms 317928 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 317928 KB Output is correct
2 Correct 1417 ms 317928 KB Output is correct
3 Correct 306 ms 318184 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 318184 KB Output is correct
2 Correct 353 ms 318184 KB Output is correct
3 Correct 311 ms 318260 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 318260 KB Output is correct
2 Correct 728 ms 318260 KB Output is correct
3 Correct 363 ms 318260 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 219 ms 318260 KB Output is correct
2 Correct 481 ms 318260 KB Output is correct
3 Correct 245 ms 318260 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 318260 KB Output is correct
2 Correct 775 ms 318260 KB Output is correct
3 Correct 351 ms 318260 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 318260 KB Output is correct
2 Correct 654 ms 318260 KB Output is correct
3 Correct 384 ms 318260 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 879 ms 367900 KB Output is correct
2 Execution timed out 5070 ms 458132 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 837 ms 458132 KB Output is correct
2 Execution timed out 5093 ms 458132 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 458132 KB Output is correct
2 Execution timed out 5092 ms 458132 KB Time limit exceeded
3 Halted 0 ms 0 KB -