oj.uz

Submission #310400

# Submission time Handle Problem Language Result Execution time Memory
310400 2020-10-06T20:54:36 Z thecodingwizard Sirni (COCI17_sirni) C++11
0 / 140
 1818 ms 266168 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ii pair<int, int>

int pa[100000], sz[100000];
vector<ii> edges[(int)1e7+10];
int findSet(int x) {
    return pa[x] == x ? x : pa[x] = findSet(pa[x]);
}
void unite(int a, int b) {
    a = findSet(a); b = findSet(b);
    if (sz[a] > sz[b]) swap(a, b);
    pa[a] = b;
    sz[b] += sz[a];
}

int main() {
    cin.tie(0); ios_base::sync_with_stdio(false);
    int n; cin >> n;

    set<int> nums;
    for (int i = 0; i < n; i++) {
        int p; cin >> p;
        nums.insert(p);
    }
    map<int, int> idx;
    int ctr = 0;
    for (int num : nums) {
        idx[num] = ctr++;
    }
    for (int i = 0; i < n; i++) {
        sz[i] = 1;
        pa[i] = i;
    }

    for (int num : nums) {
        int prev = -1;
        for (int i = num; i <= 1e7; i += num) {
            auto it = i == num ? nums.upper_bound(i) : nums.lower_bound(i);
            if (it != nums.end()) {
                if (prev == *it) continue;
                prev = *it;
                if (i == num) {
                    edges[*it%num].emplace_back(idx[num], idx[*it]);
                } else {
                    edges[*it-i].emplace_back(idx[num], idx[*it]);
                }
            } else {
                break;
            }
        }
        /*
        for (int num2 : nums) {
            if (num < num2)
                edges.pb(mp(num2%num, mp(idx[num], idx[num2])));
        }
        */
    }

    ll ans = 0;
    for (int c = 0; c <= 1e7; c++) {
        for (auto e : edges[c]) {
            if (findSet(e.f) != findSet(e.s)) {
                ans += c;
                unite(e.f, e.s);
            }
        }
    }
    cout << ans << endl;

    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 158 ms 235384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 163 ms 235364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 159 ms 235384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 896 ms 254004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 213 ms 238200 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1818 ms 266168 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 319 ms 242020 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1000 ms 257400 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1030 ms 257528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 235 ms 239480 KB Output isn't correct
2 Halted 0 ms 0 KB -