제출 #882883

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
882883		SansPapyrus683	Sirni (COCI17_sirni)	C++17	140 / 140	1497 ms	763044 KiB

sirni

#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>

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

// BeginCodeSnip{DSU (from module)}
struct DSU {
    vector<int> e;
    DSU(int N) { e = vector<int>(N, -1); }

    // get representive component (uses path compression)
    int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }

    bool same_set(int a, int b) { return get(a) == get(b); }

    int size(int x) { return -e[get(x)]; }

    bool unite(int x, int y) {  // union by size
        x = get(x), y = get(y);
        if (x == y) return false;
        if (e[x] > e[y]) std::swap(x, y);
        e[x] += e[y];
        e[y] = x;
        return true;
    }
};
// EndCodeSnip

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 = *std::max_element(cards.begin(), cards.end());
    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++) {
        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;
    DSU 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;
}

컴파일 시 표준 에러 (stderr) 메시지

sirni.cpp: In function 'int main()':
sirni.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i = 0; i < cards.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
sirni.cpp:59:23: 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 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 14 / 14
• Subtask 6: 14 / 14
• Subtask 7: 14 / 14
• Subtask 8: 14 / 14
• Subtask 9: 14 / 14
• Subtask 10: 14 / 14