10.5—A
#include<stdio.h>
#include<algorithm>
using namespace std;
int n;
int father[110];
struct Node{
int s,e,w;
}node[110*110];
void init(){
for(int i=0;i<110;i++){
father[i]=i;
}
}
int findFather(int x){
int a=x;
while(father[x]!=x){
x=father[x];
}//x即为父亲节点
//化简
while(father[a]!=a){
int z=a;
a=father[a];
father[a]=x;
}
return x;
}
bool cmp(Node a,Node b){
return a.w<b.w;
}
int Kruskral(int n,int m){
init();
sort(node,node+n*(n-1)/2,cmp);
int num=0,ans=0;
for(int i=0;i<m;i++){
int fa=findFather(node[i].s);
int fb=findFather(node[i].e);
//printf("++++++++++%d,%d\n",fa,fb);
if(fa!=fb){
father[fa]=fb;
num++;
ans+=node[i].w;
//printf("**********%d\n",node[i].w);
if(num==n-1)break;
}
}
if(num==n-1)return ans;
else return -1;
}
int main(){
while(1){
scanf("%d",&n);
if(n==0)break;
int a,b,c;
for(int i=0;i<n*(n-1)/2;i++){
scanf("%d%d%d",&a,&b,&c);
node[i].s=a;
node[i].e=b;
node[i].w=c;
}
int ans=Kruskral(n,n*(n-1)/2);
printf("%d\n",ans);
}
}
10.5—B
这个题我觉得他的数据有点问题,毕竟一个通过的都没有
题目
#include<stdio.h>
#include<algorithm>
#include<math.h>
using namespace std;
struct Pos{
double x,y;
}pos[110];
struct Edge{
int x,y;
double w;
}edge[110];
int n;
int father[110];
bool cmp(Edge a,Edge b){
return a.w<b.w;
}
void init(){
for(int i=0;i<n;i++){
father[i]=i;
}
}
int findFather(int x){
int a=x;
while(father[x]!=x){
x=father[x];
}
while(a!=father[a]){
int z=a;
a=father[a];
father[z]=x;
}
return x;
}
double Kruskal(int n,int m){
init();
sort(edge,edge+m,cmp);
int count=0;
double ans=0;
for(int i=0;i<m;i++){
int fa=findFather(edge[i].x);
int fb=findFather(edge[i].y);
if(fa!=fb){
ans+=edge[i].w;
father[fa]=fb;
count++;
if(count==n-1)break;
}
}
if(count==n-1)return ans;
else return -1;
}
int main(){
while(1){
scanf("%d",&n);
if(n==0)break;
double a,b;
for(int i=0;i<n;i++){
scanf("%lf%lf",&a,&b);
pos[i].x=a;
pos[i].y=b;
}
int num=0;
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
edge[num].x=i;
edge[num].y=j;
edge[num].w=sqrt((pos[i].x-pos[j].x)*(pos[i].x-pos[j].x)+(pos[i].y-pos[j].y)*(pos[i].y-pos[j].y));//printf("%d,%d,%.2lf\n",edge[num].x,edge[num].y,edge[num].w);
num++;
}
}
double res=Kruskal(n,n*(n-1)/2);
printf("%.2lf\n",res);
}
}
10.5—C
#include<stdio.h>
const int INF=100000000;
const int MAXV=110;
int g[110][110];
int d[110];
int vis[110];
int n,m;//路数,村庄数
int Prim(){
for(int i=0;i<110;i++){
d[i]=INF;
vis[i]=0;
}
d[1]=0;
int ans=0;//存放最小生成树的边权之和
for(int i=1;i<m+1;i++){
int u=-1,MIN=INF;
for(int j=1;j<m+1;j++){
if(d[j]<MIN&&vis[j]==0){
u=j;
MIN=d[j];
}
}
if(u==-1)return-1;
vis[u]=1;
ans+=d[u];
for(int v=1;v<m+1;v++){
if(vis[v]==0&&g[u][v]!=INF&&g[u][v]<d[v]){
d[v]=g[u][v];
}
}
}
return ans;
}
int main(){
while(1){
for(int i=0;i<MAXV;i++){
for(int j=0;j<MAXV;j++){
g[i][j]=INF;
}
}
scanf("%d%d",&n,&m);
if(n==0)break;
int a,b,c;
for(int i=0;i<n;i++){
scanf("%d%d%d",&a,&b,&c);
g[a][b]=c;
g[b][a]=c;
}
int ans=Prim();
if(ans==-1){
printf("?\n");
}else{
printf("%d\n",ans);
}
}
}
10.5—D
#include<stdio.h>
#include<algorithm>
using namespace std;
struct Edge{
int x,y,w;
}edge[110*110];
int n;
int father[110];
bool cmp(Edge a,Edge b){
return a.w<b.w;
}
void init(){
for(int i=1;i<n+1;i++){
father[i]=i;
}
}
int findFather(int x){
int a=x;
while(father[x]!=x){
x=father[x];
}
while(a!=father[a]){
int z=a;
a=father[a];
father[z]=x;
}
return x;
}
int Union(int a,int b){
int fa=findFather(a);
int fb=findFather(b);
if(fa!=fb){
father[fa]=fb;
return 0;
}else return -1;
}
int Kruskal(int n,int m){
sort(edge,edge+m,cmp);
int count1=0;
int ans=0;
for(int i=0;i<m;i++){
//int temp=Union(edge[i].x,edge[i].y);
if(findFather(edge[i].x)!=findFather(edge[i].y)){
Union(edge[i].x,edge[i].y);
ans+=edge[i].w;
count1++;
if(count1==n-1)break;
}
}
if(count1==n-1)return ans;
else return -1;
}
int main(){
while(1){
scanf("%d",&n);
if(n==0)break;
init();
int a,b,c,d;
int num=0;
for(int i=0;i<n*(n-1)/2;i++){
scanf("%d%d%d%d",&a,&b,&c,&d);
edge[num].x=a;
edge[num].y=b;
if(d==1){//已建好
edge[num].w=0;
}else{
edge[num].w=c;
}
num++;
}
int res=Kruskal(n,n*(n-1)/2);
printf("%d\n",res);
}
}