oj.uz

Submission #139890

# Submission time Handle Problem Language Result Execution time Memory
139890 2019-08-01T15:33:56 Z Minnakhmetov Sirni (COCI17_sirni) C++14
84 / 140
 5000 ms 169204 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

const int N = 1e5 + 5, M = 1e7 + 5, INF = 1e9;
int q[N], w[M], nt[M], r_nt[M], c[M];
pair<int, int> mn[N];
bool b[M];

int findSet(int v) {
    return q[v] < 0 ? v : q[v] = findSet(q[v]);
}

bool connect(int a, int b) {
    a = findSet(a);
    b = findSet(b);

    if (a == b)
        return false;

    if (q[a] > q[b])
        swap(a, b);
    q[a] += q[b];
    q[b] = a;

    return true;
}


signed main() { 
#ifdef HOME
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;

    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        b[x] = 1;
    }

    fill(w, w + M, -1);
    fill(c, c + M, -1);
    fill(q, q + N, -1);

    vector<int> v;

    for (int i = 0; i < M; i++) {
        if (b[i]) {
            w[i] = v.size();
            v.push_back(i);
        }
    }

    for (int i = 0; i < v.size(); i++) {
        for (int j = v[i]; j < M; j += v[i]) {
            c[j] = i;
        }
    }


    nt[M - 1] = INF;

    for (int i = M - 2; i >= 0; i--) {
        nt[i] = b[i] ? i : nt[i + 1];
    }
    for (int i = 1; i < M; i++) {
        r_nt[i] = c[i] != -1 ? i : r_nt[i - 1];
    }

    // for (int i = 0; i < 20; i++) {
    //     cout << nt[i] << " ";
    // }
    // cout << "\n";
    // for (int i = 0; i < 20; i++) {
    //     cout << w[i] << " ";
    // }
    // cout << "\n";

    int cnt = v.size();
    ll ans = 0;

    while (cnt > 1) {
        for (int i = 0; i < v.size(); i++)
            mn[i] = { INF, -1 };


        for (int k = 0; k < v.size(); k++) {
            int x = v[k], cur_set = findSet(k);

            for (int i = x; i < M - 1; i += x) {
                int j = x == i ? nt[i + 1] : nt[i];

                if (j < i + x) {
                    int oth_set = findSet(w[j]);
                    if (oth_set != cur_set) {
                        mn[cur_set] = min(mn[cur_set], { j - i, oth_set });
                        mn[oth_set] = min(mn[oth_set], { j - i, cur_set });
                    }
                }
            }

            // int bef = r_nt[x - 1], oth_set = findSet(c[bef]);
            // if (bef != -1 && oth_set != cur_set) {
            //     mn[cur_set] = min(mn[cur_set], { x - bef, oth_set });
            //     mn[oth_set] = min(mn[oth_set], { x - bef, cur_set });
            // }
        }

        for (int i = 0; i < v.size(); i++) {
            if (q[i] < 0 && mn[i].second != -1 && connect(i, mn[i].second))  {
                ans += mn[i].first;
                cnt--;
            }
        }
    }

    cout << ans;


    return 0;
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:62:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v.size(); i++) {
                     ~~^~~~~~~~~~
sirni.cpp:91:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v.size(); i++)
                         ~~^~~~~~~~~~
sirni.cpp:95:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int k = 0; k < v.size(); k++) {
                         ~~^~~~~~~~~~
sirni.cpp:117:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v.size(); i++) {
                         ~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 160476 KB Output is correct
2 Correct 637 ms 159228 KB Output is correct
3 Correct 208 ms 160504 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 606 ms 157344 KB Output is correct
2 Correct 1424 ms 157892 KB Output is correct
3 Correct 209 ms 160652 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 160632 KB Output is correct
2 Correct 203 ms 158456 KB Output is correct
3 Correct 207 ms 160596 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1635 ms 160308 KB Output is correct
2 Correct 3934 ms 160188 KB Output is correct
3 Correct 1179 ms 160116 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 366 ms 158712 KB Output is correct
2 Correct 2915 ms 159196 KB Output is correct
3 Correct 1653 ms 159500 KB Output is correct

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2673 ms 160212 KB Output is correct
2 Execution timed out 5067 ms 160244 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1310 ms 158272 KB Output is correct
2 Correct 4687 ms 159880 KB Output is correct
3 Correct 1072 ms 160032 KB Output is correct

Subtask #8
0 / 14.0

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

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1384 ms 169204 KB Output is correct
2 Execution timed out 5102 ms 168948 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

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