# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152963 | hdj79 | Kronican (COCI16_kronican) | C++14 | 2 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
using namespace std;
int root(int x,int parent[]){
if(x==parent[x]) return x;
parent[x]=root(parent[x],parent);
return parent[x];
}
int main(){
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin>>n>>k;
int parent[n];
int graf [n][n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>graf[i][j];
}
parent[i]=i;
}
int skupine=n;
int sol=0;
int myn=999999999;
int indx1=0;
int indx2=0;
while(skupine>k){
int myn=999999999;
int indx1=0;
int indx2=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j) continue;
if(root(i,parent)!=root(j,parent)){
if(graf[i][j]<myn){
myn=graf[i][j];
indx1=i;
indx2=j;
}
}
}
}
parent[indx1]=parent[indx2];
sol+=myn;
skupine--;
}
cout<<sol;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |