暑假集训--最小生成树

克鲁斯卡尔

#include <cstdio>
#include <algorithm>
using namespace std;
#define maxn 200005
#define ll long long
int fa[maxn], n, m;
struct Edge
{
    int x;
    int y;
    int z;
} edge[maxn];
bool cmp(Edge a,Edge b)
{
    return a.z < b.z;
}
int Find(int x)
{
    if(x==fa[x])
        return x;
    else
        return fa[x] = Find(fa[x]);
}
int main()
{
    scanf("%d%d", &n, &m);
    int ans = 0;
    for (int i = 1; i <= m;i++)
    {
        scanf("%d%d%d", &edge[i].x, &edge[i].y, &edge[i].z);
    }
    sort(edge + 1, edge + 1 + m,cmp);
    for (int i = 1; i <= n;i++)
        fa[i] = i;
    for (int i = 1; i <= m;i++)
    {
        int x = Find(edge[i].x);
        int y = Find(edge[i].y);
        if(x==y)
            continue;
        fa[x] = y;
        ans += edge[i].z;
    }
    printf("%d\n",ans);
    system("pause");
}

普里姆

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define maxn1 100005
#define maxn2 3005
#define ll long long
int a[maxn2][maxn2], d[maxn1], n, m, ans;
bool vis[maxn2][maxn2];
void Prim()
{
	memset(d, 0x3f, sizeof(d));
	memset(vis, 0, sizeof(vis));
	d[1] = 0;
	for (int i = 1; i < n;i++)
	{
		int x = 0;
		for (int j = 1; j <= n;j++)
			if(!vis[j]&&(x==0||d[j]<d[x]))
				x = j;
		vis[x] = 1;
		for (int y = 1; y <= n;y++)
			if(!vis[y])
				d[y] = min(d[y], a[x][y]);
	}
}
int main()
{
	scanf("%d%d", &n, &m);
	memset(a,0x3f,sizeof(a));
	for (int i = 1; i <= n;i++)
		a[i][i] = 0;
	for (int i = 1; i <= m;i++)
	{
		int x, y, z;
		scanf("%d%d%d", &x, &y, &z);
		a[x][y] = a[y][x] = min(z, a[x][y]);   //有些题两点之间会有多条边
	}
	Prim();
	for (int i = 2; i <= n;i++)
		ans += d[i];
	printf("%d\n", ans);
}

C - Building a Space Station

You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write a computer program to complete the task.
The space station is made up with a number of units, called cells. All cells are sphere-shaped, but their sizes are not necessarily uniform. Each cell is fixed at its predetermined position shortly after the station is successfully put into its orbit. It is quite strange that two cells may be touching each other, or even may be overlapping. In an extreme case, a cell may be totally enclosing another one. I do not know how such arrangements are possible.

All the cells must be connected, since crew members should be able to walk from any cell to any other cell. They can walk from a cell A to another cell B, if, (1) A and B are touching each other or overlapping, (2) A and B are connected by a `corridor’, or (3) there is a cell C such that walking from A to C, and also from B to C are both possible. Note that the condition (3) should be interpreted transitively.

You are expected to design a configuration, namely, which pairs of cells are to be connected with corridors. There is some freedom in the corridor configuration. For example, if there are three cells A, B and C, not touching nor overlapping each other, at least three plans are possible in order to connect all three cells. The first is to build corridors A-B and A-C, the second B-C and B-A, the third C-A and C-B. The cost of building a corridor is proportional to its length. Therefore, you should choose a plan with the shortest total length of the corridors.

You can ignore the width of a corridor. A corridor is built between points on two cells’ surfaces. It can be made arbitrarily long, but of course the shortest one is chosen. Even if two corridors A-B and C-D intersect in space, they are not considered to form a connection path between (for example) A and C. In other words, you may consider that two corridors never intersect.

Input
The input consists of multiple data sets. Each data set is given in the following format.

n
x1 y1 z1 r1
x2 y2 z2 r2
…
xn yn zn rn

The first line of a data set contains an integer n, which is the number of cells. n is positive, and does not exceed 100.

The following n lines are descriptions of cells. Four values in a line are x-, y- and z-coordinates of the center, and radius (called r in the rest of the problem) of the sphere, in this order. Each value is given by a decimal fraction, with 3 digits after the decimal point. Values are separated by a space character.

Each of x, y, z and r is positive and is less than 100.0.

The end of the input is indicated by a line containing a zero.

Output
For each data set, the shortest total length of the corridors should be printed, each in a separate line. The printed values should have 3 digits after the decimal point. They may not have an error greater than 0.001.

Note that if no corridors are necessary, that is, if all the cells are connected without corridors, the shortest total length of the corridors is 0.000.
Sample Input
3
10.000 10.000 50.000 10.000
40.000 10.000 50.000 10.000
40.000 40.000 50.000 10.000
2
30.000 30.000 30.000 20.000
40.000 40.000 40.000 20.000
5
5.729 15.143 3.996 25.837
6.013 14.372 4.818 10.671
80.115 63.292 84.477 15.120
64.095 80.924 70.029 14.881
39.472 85.116 71.369 5.553
0
Sample Output
20.000
0.000
73.834

把点变成了球，要注意的就是两球距离是球心距减两个球的半径，如果小于零或者两个球相切则距离为零。
还有就是浮点数比较大小的写法。

#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define ll long long
#define maxn 100005
#define eps 1e-8   //浮点数精度
int fa[maxn], n;
struct Edge
{
	int x, y;
	double z;
} edge[maxn];
struct node
{
	double a, b, c, r;
} cell[maxn];
bool cmp(Edge a,Edge b)
{
	return a.z < b.z;
}
int Find(int x)
{
	if(x==fa[x])
		return x;
	return fa[x] = Find(fa[x]);
}
int main()
{
	while(~scanf("%d",&n))
	{
		if(!n)
			break;
		int cnt = 1;
		for (int i = 1; i <= n;i++)
		{
			scanf("%lf%lf%lf%lf", &cell[i].a, &cell[i].b, &cell[i].c, &cell[i].r);
		}
		for (int i = 1; i <= n;i++)
		{
			for (int j = i + 1; j <= n;j++)
			{
				edge[cnt].x = i;
				edge[cnt].y = j;
				double dis = sqrt((cell[i].a - cell[j].a) * (cell[i].a - cell[j].a) + (cell[i].b - cell[j].b) * (cell[i].b - cell[j].b) + (cell[i].c - cell[j].c) * (cell[i].c - cell[j].c));
				if (fabs(dis - cell[i].r - cell[j].r) > eps && dis - cell[i].r - cell[j].r>0)
					edge[cnt].z = dis - cell[i].r - cell[j].r;
				else
					edge[cnt].z = 0;
				cnt++;
			}
		}
		cnt--;
		sort(edge + 1, edge + 1 + cnt, cmp);
		for (int i = 1; i <= n;i++)
			fa[i] = i;
		double ans = 0.0;
		for (int i = 1; i <= cnt;i++)
		{
			int x = Find(edge[i].x);
			int y = Find(edge[i].y);
			if(x==y)
				continue;
			fa[x] = y;
			ans += edge[i].z;
		}
		printf("%.3lf\n", ans);
	}
}

D - Constructing Roads

There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected.

We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.
Input
The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j.

Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.
Output
You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.
Sample Input
3
0 990 692
990 0 179
692 179 0
1
1 2
Sample Output
179

这道题变动的地方就是有一些点已经连通，然后在这个条件下求最小生成树，提前把这些点合并起来即可。

#include <cstdio>
#include <algorithm>
using namespace std;
#define maxn 105
int fa[maxn], n, q, ans;
struct Edge
{
    int x, y, z;
} edge[maxn*maxn];
bool cmp(Edge a,Edge b)
{
    return a.z < b.z;
}
int find(int x)
{
    if(x==fa[x])
        return x;
    return fa[x] = find(fa[x]);
}
void Union(int x,int y)
{
    int X = find(x);
    int Y = find(y);
    if(X!=Y)
        fa[Y] = X;
}
void Init()
{
    for (int i = 1; i <= n;i++)
        fa[i] = i;
}
int main()
{
    int cnt = 1;
    scanf("%d", &n);
    Init();
    for (int i = 1; i <= n;i++)
    {
        for (int j = 1; j <= n;j++)
        {
            int w;
            scanf("%d", &w);
            edge[cnt].x = i;
            edge[cnt].y = j;
            edge[cnt++].z = w;
        }
    }
    scanf("%d", &q);
    for (int i = 1; i <= q;i++)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        Union(x, y);  //合并
    }
    cnt--;
    sort(edge + 1, edge + 1 + cnt, cmp);
    for (int i = 1; i <= cnt;i++)
    {
        int x = find(edge[i].x);
        int y = find(edge[i].y);
        if(x==y)
            continue;
        fa[x] = y;
        ans += edge[i].z;
    }
    printf("%d\n", ans);
}

K - The Unique MST

Given a connected undirected graph, tell if its minimum spanning tree is unique.

Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, say T = (V’, E’), with the following properties:

1. V’ = V.
2. T is connected and acyclic.

Definition 2 (Minimum Spanning Tree): Consider an edge-weighted, connected, undirected graph G = (V, E). The minimum spanning tree T = (V, E’) of G is the spanning tree that has the smallest total cost. The total cost of T means the sum of the weights on all the edges in E’.
Input
The first line contains a single integer t (1 <= t <= 20), the number of test cases. Each case represents a graph. It begins with a line containing two integers n and m (1 <= n <= 100), the number of nodes and edges. Each of the following m lines contains a triple (xi, yi, wi), indicating that xi and yi are connected by an edge with weight = wi. For any two nodes, there is at most one edge connecting them.
Output
For each input, if the MST is unique, print the total cost of it, or otherwise print the string ‘Not Unique!’.
Sample Input
2
3 3
1 2 1
2 3 2
3 1 3
4 4
1 2 2
2 3 2
3 4 2
4 1 2
Sample Output
3
Not Unique!

判断最小生成树是否唯一，这里先把最小生成树求出来并记录加入树的那些边，之后每次删去其中一条边再求最小生成树，但是删去原树的边之后有可能无法连通，需要特判。最后比较两次的代价，不相等或者无法连通则树唯一，反之则不唯一。

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define maxn 105
int fa[maxn], n, t, m, ans;
bool flag = 0;
struct Edge
{
    int x, y, z;
    bool flag;
} edge[maxn*maxn];
bool cmp(Edge a,Edge b)
{
    return a.z < b.z;
}
int find(int x)
{
    if(x==fa[x])
        return x;
    return fa[x] = find(fa[x]);
}
int Kruskal(int k)  //删去原树中某边后可能无法构成树
{
    int sum = 0;
    int cnt = 1;
    for (int i = 1; i <= n;i++)
        fa[i] = i;
    for (int i = 1; i <= m;i++)
    {
        if(i==k)
            continue;
        int x = find(edge[i].x);
        int y = find(edge[i].y);
        if(x==y)
            continue;
        fa[x] = y;
        cnt++;
        sum += edge[i].z;
    }
    if(cnt!=n)  //不连通
        return -1;
    return sum;
}
int main()
{
    cin >> t;
    while(t--)
    {
        flag = 0;
        cin >> n >> m;
        for (int i = 1; i <= m;i++)
        {
            cin >> edge[i].x >> edge[i].y >> edge[i].z;
            edge[i].flag = 0;
        }
        for (int i = 1; i <= n;i++)
            fa[i] = i;
        sort(edge + 1, edge + 1 + m, cmp);
        int cnt = 0;
        for (int i = 1; i <= m;i++)
        {
            int x = find(edge[i].x);
            int y = find(edge[i].y);
            if(x==y)
                continue;
            fa[x] = y;
            edge[i].flag = 1;   //标记这条边加入了MST
            ans += edge[i].z;
        }
        for (int i = 1; i <= m;i++)
        {
            if(edge[i].flag==0) //跳过不在树中的边
                continue;
            int cnt = Kruskal(i);
            if(cnt==ans)
            {
                flag = 1;
                break;
            } 
        }
        if(flag)
            cout << "Not Unique!" << endl;
        else
            cout << ans << endl;
        ans = 0;
    }
}