oj.uz

답안 #904059

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
904059 2024-01-11T19:02:52 Z vjudge1 Odašiljači (COCI20_odasiljaci) C++17
42 / 70
 185 ms 34452 KB 
#include<bits/stdc++.h>
using namespace std;
#define double long double
struct coordenada{
    int x, y;
};
struct Dsu {
    vector<int> parent, rank, size;
    Dsu(int N) {
        parent.resize(N);
        rank.resize(N);
        size.resize(N, 1);
        for (int i = 0; i < N; i++){
            parent[i] = i;
        }
    }
    bool isSameSet(int i, int j){
        return findSet(i) == findSet(j);
    }
    int findSet(int i) { 
        if(parent[i] == i){
            return i;
        }else{
            return parent[i] = findSet(parent[i]);
        } 
    }
    void unionSet(int i, int j){
        int x = findSet(i);
        int y = findSet(j);
        if (x != y){
            if (rank[x] > rank[y]){
                parent[y] = x;
                size[x] += size[y];
            }else if(rank[x] < rank[y]){
                parent[x] = y;
                size[y] += size[x];
            }else{
                parent[x] = y;
                size[y] += size[x];
                rank[y]++;
            }
        }
    }

    int getSize(int i){
        return size[findSet(i)];
    }
};

int main() {
    
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cout<<fixed<<setprecision(7);
    int m;
    cin >> m;

    vector<pair<double,pair<int,int>>> edges, edges_mst;
    vector<coordenada>puntos(m);
    for(int i = 0; i < m; i++){
        coordenada c;
        cin>>c.x>>c.y;
        puntos[i]=c;
    }
    for(int i=0;i<m;i++){
        for(int j=0;j<m;j++){
            if(i==j)continue;
            double cost=(double)sqrt((abs(puntos[i].x-puntos[j].x)*abs(puntos[i].x-puntos[j].x))+(abs(puntos[i].y-puntos[j].y)*abs(puntos[i].y-puntos[j].y)));
            edges.push_back({cost,{i,j}});
        }
    }
    sort(edges.begin(), edges.end());

    Dsu dsu(m);

    // Kruskal
    double costo_total = 0;
    for(int i = 0; i < edges.size(); i++){
        double w=edges[i].first;
        int a = edges[i].second.first;
        int b = edges[i].second.second;
        if(!dsu.isSameSet(a, b)){   // Si a y b no estan en la misma componente conexa
            dsu.unionSet(a, b);     // entonces las uno
            costo_total = w;
            edges_mst.push_back({w, {a, b}});
        }
    }

    // Finalmente se obtiene el costo minimo para conectar todos los nodos
    cout << (costo_total/=2) << "\n";

    return 0;
}

Compilation message

odasiljaci.cpp: In function 'int main()':
odasiljaci.cpp:77:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long double, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for(int i = 0; i < edges.size(); i++){
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
42.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Incorrect 1 ms 736 KB Output isn't correct
5 Incorrect 2 ms 992 KB Output isn't correct
6 Correct 59 ms 10704 KB Output is correct
7 Correct 46 ms 10188 KB Output is correct
8 Correct 110 ms 34452 KB Output is correct
9 Incorrect 171 ms 34256 KB Output isn't correct
10 Incorrect 185 ms 33720 KB Output isn't correct