# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153055 | hdj79 | Kronican (COCI16_kronican) | C++14 | 1328 ms | 18856 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>
#include<vector>
using namespace std;
int root(int x,int parent[]){
if(x==parent[x]) return x;
parent[x]=root(parent[x],parent);
return parent[x];
}
void nadji(vector<vector<int> > *b,vector<int> *p,int k,int br,int n){
if((*p).size()==n){(*b).push_back(*p);return;}
if(br<k){
(*p).push_back(1);
nadji(b,p,k,br+1,n);
(*p).pop_back();
}
(*p).push_back(0);
nadji(b,p,k,br,n);
(*p).pop_back();
}
int izracunaj(int a){
if(a<=10) return a;
return 20-a;
}
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;
long long best=999999999;
long long sol=0;
vector<vector<int> > bitmaske;
vector<int> priv;
nadji(&bitmaske,&priv,izracunaj(k),0,n);
for(int br=0;br<bitmaske.size()-1;br++){
skupine=n;
for(int i=0;i<n;i++) parent[i]=i;
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 && parent[i]==i && ((bitmaske[br][parent[j]]==1 && k<=10) || (bitmaske[br][parent[j]]==0 && k>10))){
myn=graf[i][j];
indx1=i;
indx2=j;
}
}
}
}
if(myn==999999999) { sol=myn;break;}
parent[indx1]=parent[indx2];
sol+=myn;
skupine--;
//cout<<myn<<endl;
}
if(sol<best) best=sol;
//cout<<sol<<endl;
sol=0;
}
cout<<best;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |