제출 #891780

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
891780		cuman	Sirni (COCI17_sirni)	C++14	42 / 140	569 ms	50476 KiB

sirni

#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
using i64 = long long;
#define rep(i,l,r) for (int i = (l); i <= (r); i++)

const int MaxN = 1e5;
const int MaxA = 1e6 + 1;
int N, A[MaxN];

struct DSU {
    int e[MaxN];
    void initSz(int n) {
        memset(e, -1, n * sizeof(int));
    }
    int fr(int x) { return e[x] < 0 ? x : e[x] = fr(e[x]); }
    bool unite(int x, int y) {
        x = fr(x), y = fr(y);
        if (x==y) return false;
        if (e[x] > e[y]) swap(x,y);
        e[x] += e[y];
        e[y] = x;
        return true;
    }
};

DSU dsu;

void sub1() {
    sort(A, A + N);
    N = unique(A, A + N) - A;

    vector<array<int,3>> edges;

    rep(i, 0, N-1) {
        rep(j, i+1, N-1) {
            edges.push_back({A[j] % A[i], i, j});
        }
    }

    sort(all(edges));
    dsu.initSz(N);

    long long res = 0;
    for (int i = 0; i < edges.size(); i++) {
        int w = edges[i][0];
        int u = edges[i][1];
        int v = edges[i][2];
        if (dsu.unite(u, v)) res += w;
    }

    cout << res;
}

void sub2() {
    sort(A, A + N);
    N = unique(A, A + N) - A;

    vector<array<int,3>> edges;

    for (int i = 0; i < N; i++) {
        for (int mul = A[i]; mul <= MaxA; mul += A[i]) {
            int j = upper_bound(A, A + N, mul) - A;
            if (j < N) {
                edges.push_back({A[j] % A[i], i, j});
            }
        }
    }

    sort(all(edges));
    dsu.initSz(N);

    long long res = 0;
    for (int i = 0; i < edges.size(); i++) {
        int w = edges[i][0];
        int u = edges[i][1];
        int v = edges[i][2];
        if (dsu.unite(u, v)) res += w;
    }

    cout << res;
}

signed main() {
    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }

    if (N <= 2e3) {
        sub1();
    }
    else {
        sub2();
    }

    return 0;
}

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

sirni.cpp: In function 'void sub1()':
sirni.cpp:45:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
sirni.cpp: In function 'void sub2()':
sirni.cpp:74:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 14 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14