oj.uz

Submission #46349

# Submission time Handle Problem Language Result Execution time Memory
46349 2018-04-19T17:24:20 Z evpipis Sirni (COCI17_sirni) C++
84 / 140
 5000 ms 786432 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 = 1e7+5;
int cnt[len], nex[2][len], p[len], r[len];
vector<ii> vec[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]++;
    }
}

int main(){
    int n, m = 0, k = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; i++){
        int temp;
        scanf("%d", &temp);
        m = max(m, temp);
        if (!cnt[temp]) cnt[temp] = ++k;
    }

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

        nex[1][i] = nex[1][i+1];
        if (cnt[i+1]) nex[1][i] = 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[1][j] && nex[1][j] < j+i)
                    vec[nex[1][j]%i].pb(mp(cnt[i], cnt[nex[1][j]]));
                else if (j != i && nex[0][j] && nex[0][j] < j+i);
                    vec[nex[0][j]%i].pb(mp(cnt[i], cnt[nex[0][j]]));
            }

    ll ans = 0;
    for (int i = 0; i <= m; i++){
        if (k == 1) break;
        for (int j = 0; j < vec[i].size(); j++){
            if (k == 1) break;
            int x = fin(vec[i][j].fi), y = fin(vec[i][j].se);
            if (x != y)
                join(x, y), ans += i, k--;
        }
    }

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

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:57:22: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
                 else if (j != i && nex[0][j] && nex[0][j] < j+i);
                      ^~
sirni.cpp:58:21: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
                     vec[nex[0][j]%i].pb(mp(cnt[i], cnt[nex[0][j]]));
                     ^~~
sirni.cpp:64:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < vec[i].size(); j++){
                         ~~^~~~~~~~~~~~~~~
sirni.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
sirni.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &temp);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 317408 KB Output is correct
2 Correct 820 ms 344564 KB Output is correct
3 Correct 281 ms 344564 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 344564 KB Output is correct
2 Execution timed out 5197 ms 786432 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 786432 KB Output is correct
2 Correct 301 ms 786432 KB Output is correct
3 Correct 299 ms 786432 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 786432 KB Output is correct
2 Correct 493 ms 786432 KB Output is correct
3 Correct 331 ms 786432 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 236 ms 786432 KB Output is correct
2 Correct 412 ms 786432 KB Output is correct
3 Correct 264 ms 786432 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 401 ms 786432 KB Output is correct
2 Correct 549 ms 786432 KB Output is correct
3 Correct 331 ms 786432 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 238 ms 786432 KB Output is correct
2 Correct 661 ms 786432 KB Output is correct
3 Correct 336 ms 786432 KB Output is correct

Subtask #8
0 / 14.0

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

Subtask #9
0 / 14.0

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

Subtask #10
0 / 14.0

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