oj.uz

Submission #310401

# Submission time Handle Problem Language Result Execution time Memory
310401 2020-10-06T20:54:59 Z thecodingwizard Sirni (COCI17_sirni) C++11
98 / 140
 5000 ms 385752 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;
                edges[*it%num].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
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 235388 KB Output is correct
2 Correct 232 ms 237816 KB Output is correct
3 Correct 161 ms 235512 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 235384 KB Output is correct
2 Correct 701 ms 236152 KB Output is correct
3 Correct 163 ms 235512 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 235472 KB Output is correct
2 Correct 160 ms 235384 KB Output is correct
3 Correct 161 ms 235512 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 964 ms 254352 KB Output is correct
2 Correct 2458 ms 280932 KB Output is correct
3 Correct 1018 ms 257944 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 238328 KB Output is correct
2 Correct 685 ms 258552 KB Output is correct
3 Correct 848 ms 252904 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1806 ms 266824 KB Output is correct
2 Correct 3433 ms 295972 KB Output is correct
3 Correct 1104 ms 257500 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 322 ms 242084 KB Output is correct
2 Correct 2346 ms 289276 KB Output is correct
3 Correct 1006 ms 256748 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 955 ms 257400 KB Output is correct
2 Execution timed out 5088 ms 359388 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1047 ms 257152 KB Output is correct
2 Execution timed out 5095 ms 353104 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 239352 KB Output is correct
2 Execution timed out 5087 ms 385752 KB Time limit exceeded
3 Halted 0 ms 0 KB -