有一个 m 行 n 列的点阵,相邻两点可以相连。
一条纵向的连线花费一个单位,一条横向的连线花费两个单位。
某些点之间已经有连线了,试问至少还需要花费多少个单位才能使所有的点全部连通。
输入格式
第一行输入两个正整数 m 和 n。
以下若干行每行四个正整数 x1,y1,x2,y2,表示第 x1 行第 y1 列的点和第 x2 行第 y2 列的点已经有连线。
输入保证|x1−x2|+|y1−y2|=1。
输出格式
输出使得连通所有点还需要的最小花费。
数据范围
1≤m,n≤1000
0≤已经存在的连线数≤10000
输入样例:
2 2
1 1 2 1
输出样例:
3
就是最小生成树,每条边权值已经知道
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1010, M = N * N, K = 2 * N * N;
int n, m, k;
int ids[N][N];
struct Edge
{
int a, b, w;
}e[K];
int p[M];
int find(int x)
{
return (p[x] == x)? x:p[x] = find(p[x]);
}
void get_edges()
{
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1}, dw[4] = {1, 2, 1, 2};
for (int z = 0; z < 2; z ++ )
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= m; j ++ )
for (int u = 0; u < 4; u ++ )
if (u % 2 == z)
{
int x = i + dx[u], y = j + dy[u], w = dw[u];
if (x && x <= n && y && y <= m)
{
int a = ids[i][j], b = ids[x][y];
if (a < b) e[k ++ ] = {a, b, w};//不能重复插
}
}
}
int main()
{
cin >> n >> m;
for (int i = 1, t = 1; i <= n; i ++ )
for (int j = 1; j <= m; j ++, t ++ )
ids[i][j] = t;//把每个坐标映射成点
for (int i = 1; i <= n * m; i ++ ) p[i] = i;
int x1, y1, x2, y2;
while (cin >> x1 >> y1 >> x2 >> y2)
{
int a = ids[x1][y1], b = ids[x2][y2];
p[find(a)] = find(b);
}
get_edges();
int res = 0;
for (int i = 0; i < k; i ++ )
{
int a = find(e[i].a), b = find(e[i].b), w = e[i].w;
if (a != b)
{
p[a] = b;
res += w;
}
}
cout << res << endl;
return 0;
}
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1010;
int n, m, k;
int p[N*N];
int find(int x)
{
return (p[x] == x)? x:p[x] = find(p[x]);
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= n * m; i ++ ) p[i] = i;
int x1, y1, x2, y2;
while (cin >> x1 >> y1 >> x2 >> y2)
{
int a = (x1 - 1) * m + y1, b = (x2 - 1) * m + y2;
p[find(a)] = find(b);
}
int res = 0;
for (int i = 1; i < n; i++) { //先连竖着的
for (int j = 1; j <= m; j++){
int a = (i - 1) * m + j, b = i * m + j;
a = find(a), b = find(b);
if (a != b)
{
p[a] = b;
res ++;
}
}
}
for (int i = 1; i <= n; i++) {//再连横着的
for (int j = 1; j < m; j++){
int a = (i - 1) * m + j, b = (i - 1) * m + j + 1;
a = find(a), b = find(b);
if (a != b)
{
p[a] = b;
res += 2;
}
}
}
cout << res << endl;
return 0;
}