oj.uz

답안 #984286

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984286 2024-05-16T12:41:25 Z farica Sirni (COCI17_sirni) C++14
140 / 140
 1923 ms 752796 KB 
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>

using std::cout;
using std::endl;
using std::pair;
using std::vector;

class DisjointSets {
  private:
	vector<int> parents;
	vector<int> sizes;

  public:
	DisjointSets(int size) : parents(size), sizes(size, 1) {
		for (int i = 0; i < size; i++) { parents[i] = i; }
	}

	int find(int n) {
		return parents[n] == n ? n : (parents[n] = find(parents[n]));
	}

	bool unite(int n1, int n2) {
		n1 = find(n1);
		n2 = find(n2);
		if (n1 == n2) { return false; }
		if (sizes[n1] < sizes[n2]) { std::swap(n1, n2); }
		sizes[n1] += sizes[n2];
		parents[n2] = n1;
		return true;
	}
};

int main() {
	int card_num;
	std::cin >> card_num;
	vector<int> cards(card_num);
	for (int &c : cards) {
		std::cin >> c;
		assert(c >= 1);
	}

	std::sort(cards.begin(), cards.end());
	// we can erase the dupes bc modding them with the original one = 0
	cards.erase(std::unique(cards.begin(), cards.end()), cards.end());

	int largest = cards.back();  // since we sorted the cards already
	// next_largest[i] contains the index of lowest card value that's >= i
	vector<int> next_largest(largest + 1, -1);
	for (int i = 0; i < cards.size(); i++) { next_largest[cards[i]] = i; }
	for (int c = largest - 1; c >= 0; c--) {
		// if this isn't assigned yet, assign it the previous one
		if (next_largest[c] == -1) { next_largest[c] = next_largest[c + 1]; }
	}

	vector<vector<pair<int, int>>> good_links(largest + 1);
	for (int i = 0; i < cards.size() - 1; i++) {
		// get all relevant cards this card could be connected to
		good_links[cards[i + 1] % cards[i]].push_back({i, i + 1});
		for (int at = 2 * cards[i]; at <= largest; at += cards[i]) {
			int good_mod = next_largest[at];
			good_links[cards[good_mod] % cards[i]].push_back({i, good_mod});
		}
	}

	long long total_cost = 0;
	DisjointSets linked_cards(cards.size());
	for (int c = 0; c <= largest; c++) {
		for (const pair<int, int> &link : good_links[c]) {
			bool result = linked_cards.unite(link.first, link.second);
			total_cost += c * result;
		}
	}

	cout << total_cost << endl;
}

Compilation message

sirni.cpp: In function 'int main()':
sirni.cpp:52:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for (int i = 0; i < cards.size(); i++) { next_largest[cards[i]] = i; }
      |                  ~~^~~~~~~~~~~~~~
sirni.cpp:59:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |  for (int i = 0; i < cards.size() - 1; i++) {
      |                  ~~^~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 183 ms 274340 KB Output is correct
2 Correct 201 ms 302476 KB Output is correct
3 Correct 129 ms 273664 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1263 ms 668680 KB Output is correct
3 Correct 124 ms 274916 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 274404 KB Output is correct
2 Correct 118 ms 273744 KB Output is correct
3 Correct 127 ms 274544 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 38260 KB Output is correct
2 Correct 117 ms 67756 KB Output is correct
3 Correct 80 ms 50228 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 29680 KB Output is correct
2 Correct 85 ms 50992 KB Output is correct
3 Correct 53 ms 24828 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 49924 KB Output is correct
2 Correct 152 ms 90872 KB Output is correct
3 Correct 82 ms 46768 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 9660 KB Output is correct
2 Correct 155 ms 84860 KB Output is correct
3 Correct 75 ms 49184 KB Output is correct

Subtask #8
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 205 ms 288400 KB Output is correct
2 Correct 1250 ms 633348 KB Output is correct
3 Correct 220 ms 291936 KB Output is correct

Subtask #9
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 226 ms 292368 KB Output is correct
2 Correct 1923 ms 752796 KB Output is correct
3 Correct 377 ms 348532 KB Output is correct

Subtask #10
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 276820 KB Output is correct
2 Correct 1743 ms 636668 KB Output is correct
3 Correct 79 ms 53944 KB Output is correct