답안 #139921

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
139921	2019-08-01T16:31:58 Z	Minnakhmetov	Sirni (COCI17_sirni)	C++14	126 / 140	5000 ms	179060 KB

sirni

#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], d[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(228);
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x; 

        // x = rnd() % 20 + 1;

        // cout << x << "\n";

        b[x] = 1;
    }
 
    fill(w, w + M, -1);
    fill(c, c + M, -1);
    fill(q, q + N, -1);
 
    vector<int> v;
 
    int cnt = 0;

    for (int i = 0; i < M; i++) {
        if (b[i]) {
            w[i] = cnt++;
        }
    }

    int remain = cnt;

    for (int i = 0; i < M; i++) {
        if (b[i]) {
            for (int j = i + i; j < M; j += i) {
                if (b[j] && connect(w[i], w[j])) {
                    remain--;
                }
                d[j] = 1;
            }
            v.push_back(i);
        }
    }

    // for (int i = 0; i < M; i++) {
    //     if (!d[i] && b[i])
    //         cout << i << "\n";
    // }
    // return 0;

    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";

    // for (int x : v)
    //     cout << x << "\n";
    // return 0;

    ll ans = 0;
 
    while (remain > 1) {
        for (int i = 0; i < cnt; i++)
            mn[i] = { INF, -1 };
 
        for (int k = 0; k < v.size(); k++) {
            int x = v[k], cur_set = findSet(w[x]);
            if (!d[x]) {
                for (int i = x; i < M - 1; i += x) {
                    int j = nt[i + 1];

                    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 < cnt; i++) {
            // cout << mn[i].first << " " << mn[i].second << "\n";
            if (q[i] < 0 && mn[i].second != -1 && connect(i, mn[i].second))  {
                ans += mn[i].first;
                remain--;
            }
        }
    
    }
 
    cout << ans;
 
 
    return 0;
}   

Compilation message

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

Subtask #1

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	221 ms	168596 KB	Output is correct
2	Correct	607 ms	168960 KB	Output is correct
3	Correct	232 ms	170508 KB	Output is correct

Subtask #2

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	535 ms	167132 KB	Output is correct
2	Correct	933 ms	167640 KB	Output is correct
3	Correct	227 ms	170488 KB	Output is correct

Subtask #3

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	221 ms	169160 KB	Output is correct
2	Correct	216 ms	163728 KB	Output is correct
3	Correct	225 ms	170492 KB	Output is correct

Subtask #4

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1289 ms	169360 KB	Output is correct
2	Correct	2000 ms	169332 KB	Output is correct
3	Correct	893 ms	169056 KB	Output is correct

Subtask #5

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	417 ms	168392 KB	Output is correct
2	Correct	1734 ms	168424 KB	Output is correct
3	Correct	1254 ms	168652 KB	Output is correct

Subtask #6

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2127 ms	169408 KB	Output is correct
2	Correct	1891 ms	169480 KB	Output is correct
3	Correct	765 ms	169332 KB	Output is correct

Subtask #7

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1192 ms	167932 KB	Output is correct
2	Correct	2383 ms	169116 KB	Output is correct
3	Correct	833 ms	169308 KB	Output is correct

Subtask #8

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1351 ms	178240 KB	Output is correct
2	Correct	2551 ms	178352 KB	Output is correct
3	Correct	1589 ms	179060 KB	Output is correct

Subtask #9

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1040 ms	178164 KB	Output is correct
2	Correct	4562 ms	177936 KB	Output is correct
3	Correct	746 ms	179036 KB	Output is correct

Subtask #10

0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	427 ms	177412 KB	Output is correct
2	Execution timed out	5095 ms	177904 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-