oj.uz

답안 #544433

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544433 2022-04-01T22:18:02 Z Olympia Sirni (COCI17_sirni) C++17
112 / 140
 5000 ms 649088 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <bitset>
#include <stack>
#include <cstdlib>
#include <queue>
#include <stdint.h>
#include <vector>
#include <cassert>
#include <numeric>
#include <iostream>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <limits.h>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

using namespace std;

class DisjointSetUnion {
protected:
    vector<int> parent;
    vector<int> compSize;
    const int n;
    int connectedComponents;
public:
    int getConnectedComponents() const {
        return connectedComponents;
    }

public:
    DisjointSetUnion(int sz) : n(sz), connectedComponents(sz) {
        parent.resize(sz), compSize.resize(sz);
        for (int i = 0; i < n; i++) {
            parent[i] = i, compSize[i] = 1;
        }
    }

    int find_head(int x) const {
        int cur = x;
        while (cur != parent[cur]) {
            cur = parent[cur];
        }
        return cur;
    }

    void join(int x, int y) {
        x = find_head(x);
        y = find_head(y);
        if (x == y) {
            return;
        }
        if (compSize[x] > compSize[y]) {
            swap(x, y);
            //ensures that compSize[x1] <= compSize[y1]
        }
        parent[x] = y;
        compSize[y] += compSize[x];
        connectedComponents--;
    }

    bool comp(int x, int y) {
        return (find_head(x) == find_head(y));
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N;
    cin >> N;
    vector<int> v(N); set<int> s;
    for (int i = 0; i < N; i++) {
        cin >> v[i]; s.insert(v[i]);
    }
    v.clear();
    for (int i: s) v.push_back(i);
    DisjointSetUnion dsu(N);
    if (N <= 1e3) {
        vector<pair<int, pair<int, int>>> vec;
        for (int i = 0; i < N; i++) {
            for (int j = i + 1; j < N; j++) {
                vec.emplace_back(min(v[i] % v[j], v[j] % v[i]), make_pair(i, j));
            }
        }
        sort(vec.begin(), vec.end());
        int64_t ans = 0;
        for (int i = 0; i < vec.size(); i++) {
            if (dsu.comp(vec[i].second.first, vec[i].second.second)) {
                continue;
            }
            dsu.join(vec[i].second.first, vec[i].second.second);
            ans += vec[i].first;
        }
        cout << ans;
        return 0;
    }
    int MX = 0;
    for (int i = 0; i < N; i++) {
        MX = max(MX, v[i]);
    }
    vector<int> indices[MX + 1];
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= MX; j += v[i]) {
            indices[j].push_back(i);
        }
    }
    int64_t tot = 0;
    for (int mx = 0; mx < 100; mx++) {
        for (int i = 0; i < N; i++) {
            if (v[i] - mx < 0) {
                continue;
            }
            for (int ind: indices[v[i] - mx]) {
                if (v[i] % v[ind] == mx) {
                    if (dsu.comp(i, ind)) {
                        continue;
                    }
                    dsu.join(i, ind);
                    tot += mx;
                    if (dsu.getConnectedComponents() == 1) {
                        cout << tot << '\n';
                        exit(0);
                    }
                }
            }
        }
    }

}

Compilation message

sirni.cpp:25: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   25 | #pragma GCC optimization ("O3")
      | 
sirni.cpp:26: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   26 | #pragma GCC optimization ("unroll-loops")
      | 
sirni.cpp: In function 'int main()':
sirni.cpp:98:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |         for (int i = 0; i < vec.size(); i++) {
      |                         ~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 6596 KB Output is correct
2 Correct 64 ms 6644 KB Output is correct
3 Correct 48 ms 6596 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 6596 KB Output is correct
2 Correct 66 ms 6604 KB Output is correct
3 Correct 47 ms 6596 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 6596 KB Output is correct
2 Correct 41 ms 6676 KB Output is correct
3 Correct 50 ms 6596 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 232 ms 46612 KB Output is correct
2 Correct 617 ms 68820 KB Output is correct
3 Correct 417 ms 67108 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 29384 KB Output is correct
2 Correct 3890 ms 200668 KB Output is correct
3 Correct 232 ms 33780 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 437 ms 55812 KB Output is correct
2 Correct 754 ms 85956 KB Output is correct
3 Correct 275 ms 56880 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 12240 KB Output is correct
2 Correct 1027 ms 97056 KB Output is correct
3 Correct 324 ms 61808 KB Output is correct

Subtask #8
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 476 ms 277644 KB Output is correct
2 Correct 4391 ms 638248 KB Output is correct
3 Correct 501 ms 289316 KB Output is correct

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 418 ms 289508 KB Output is correct
2 Execution timed out 5072 ms 649088 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 216 ms 242052 KB Output isn't correct
2 Halted 0 ms 0 KB -