oj.uz

Submission #1065194

# Submission time Handle Problem Language Result Execution time Memory
1065194 2024-08-19T02:59:49 Z ezGeometry Sirni (COCI17_sirni) C++14
84 / 140
 2113 ms 786432 KB 
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <tuple>

using namespace std;
using ll = long long;

int n;
vector<int> parent, sizes;
int cc;

void init() {
	parent.resize(n);
	sizes.resize(n);

	cc = n;

	for (int i = 0; i < n; i++) {
		parent[i] = i;
		sizes[i] = 1;
	}
}

int find_set(int a) {
	if (parent[a] == a) {
		return a;
	}
	return parent[a] = find_set(parent[a]);
}

void join_set(int a, int b) {
	a = find_set(a);
	b = find_set(b);
	if (a == b) {
		return;
	}

	if (sizes[a] > sizes[b]) {
		swap(a, b);
	}

	cc--;
	parent[a] = b;
	sizes[b] += sizes[a];
}

int main() {
	cin >> n;

	set<int> q;
	int mp = 0;

	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		q.insert(x);
		mp = max(mp, x);
	}

	vector<int> p;

	for (int c : q) {
		p.push_back(c);
	}
	n = p.size();

	// Kruskal's Algorithm for MST
	vector<tuple<int, int, int>> edges;

	// It is optimal to go from c to lower_bound(ck) and then from ck to ck+m
	for (int j = 0; j < n; j++) {
		int c = p[j];

		auto it1 = upper_bound(p.begin(), p.end(), c);
		// it1 is essentially p.begin() + (j + 1)
		if (it1 != p.end()) {
			edges.push_back(make_tuple(*it1 % c, j, it1 - p.begin()));
		}

		/*if (j != n - 1) {
			edges.push_back(make_tuple(p[j + 1] % c, j, j + 1));
		}*/

		for (int i = 2 * c; i <= mp; i += c) {
			auto it = lower_bound(p.begin(), p.end(), i);
			edges.push_back(make_tuple(*it % c, j, it - p.begin()));
		}
	}

	sort(edges.begin(), edges.end());

	ll ans = 0;
	init();

	for (auto c : edges) {
		ll w, a, b;
		tie(w, a, b) = c;

		if (find_set(a) == find_set(b)) {
			continue;
		}

		join_set(a, b);
		ans += w;
		
		if (cc == 1) {
			break;
		}
	}

	cout << ans << endl;

	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 204 ms 49752 KB Output is correct
3 Correct 4 ms 856 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Runtime error 737 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 604 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 30264 KB Output is correct
2 Correct 802 ms 54512 KB Output is correct
3 Correct 364 ms 53784 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 4352 KB Output is correct
2 Correct 320 ms 50272 KB Output is correct
3 Correct 252 ms 29396 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 529 ms 54812 KB Output is correct
2 Correct 1082 ms 103940 KB Output is correct
3 Correct 331 ms 30036 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 10308 KB Output is correct
2 Correct 1059 ms 102900 KB Output is correct
3 Correct 348 ms 29620 KB Output is correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 30484 KB Output is correct
2 Runtime error 1535 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 30508 KB Output is correct
2 Runtime error 1476 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 4552 KB Output is correct
2 Runtime error 2113 ms 786432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -