oj.uz

답안 #139897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
139897 2019-08-01T15:46:44 Z Minnakhmetov Sirni (COCI17_sirni) C++14
84 / 140
 5000 ms 168876 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;

    mt19937 rnd(time(0));
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        // x = rnd() % 10000000 + 1;

        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];
    }

    r_nt[0] = -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 });
                    }
                }
            }

            if (r_nt[x - 1] != -1) {
                int bef = r_nt[x - 1], oth_set = findSet(c[bef]);
                if (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)
                return 1;
            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:65:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v.size(); i++) {
                     ~~^~~~~~~~~~
sirni.cpp:97:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < v.size(); i++)
                         ~~^~~~~~~~~~
sirni.cpp:101:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int k = 0; k < v.size(); k++) {
                         ~~^~~~~~~~~~
sirni.cpp:125: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

# 결과 실행 시간 메모리 Grader output
1 Correct 204 ms 160376 KB Output is correct
2 Correct 625 ms 159224 KB Output is correct
3 Correct 208 ms 160560 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 611 ms 157304 KB Output is correct
2 Correct 1435 ms 157944 KB Output is correct
3 Correct 208 ms 160632 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 160632 KB Output is correct
2 Correct 203 ms 158456 KB Output is correct
3 Correct 230 ms 160632 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2081 ms 159560 KB Output is correct
2 Correct 4369 ms 159388 KB Output is correct
3 Correct 1250 ms 159740 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 404 ms 158684 KB Output is correct
2 Correct 2973 ms 158960 KB Output is correct
3 Correct 1787 ms 159340 KB Output is correct

Subtask #6
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2971 ms 160024 KB Output is correct
2 Execution timed out 5019 ms 159996 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1362 ms 158404 KB Output is correct
2 Correct 4782 ms 159864 KB Output is correct
3 Correct 1127 ms 159960 KB Output is correct

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1378 ms 168784 KB Output is correct
2 Execution timed out 5069 ms 168876 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1290 ms 168820 KB Output is correct
2 Execution timed out 5032 ms 168644 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 416 ms 167592 KB Output is correct
2 Execution timed out 5022 ms 168588 KB Time limit exceeded
3 Halted 0 ms 0 KB -