#include<string.h>
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
#include<string.h>
#include<queue>
#include<utility>
using namespace std;
struct edge{
int s, t;
double len;
};
struct cmpe{
bool operator()(edge e1, edge e2)
{
return e1.len > e2.len;
}
};
priority_queue<edge, vector<edge>, cmpe> q;
int par[800];
vector<pair<int, int> > pos;
vector<pair<int, int> > res;
int find(int x)
{
int fx = x;
while (par[fx] >= 0)
fx = par[fx];
while (fx != x)
{
int tx = par[x];
par[x] = fx;
x = tx;
}
return fx;
}
void uni(int a, int b)
{
if (par[a] == par[b])
{
par[a]--;
par[b] = a;
}
else if (par[a] < par[b])
par[b] = a;
else
par[a] = b;
}
void kruskal(int n)
{
res.clear();
for (int i = 0; i < n - 1;)
{
edge te = q.top();
q.pop();
int pa = find(te.s);
int pb = find(te.t);
if (pa != pb)
{
i++;
uni(pa, pb);
res.push_back(make_pair(te.s + 1, te.t + 1));
}
}
}
int main()
{
int t;
cin >> t;
for (int k = 0; k < t; k++)
{
if (k > 0)
cout << endl;
pos.clear();
while (!q.empty())
q.pop();
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
int x, y;
cin >> x >> y;
pos.push_back(make_pair(x, y));
for (int j = 0; j < i; j++)
{
double len = sqrt(pow(pos[j].first - pos[i].first, 2.0) + pow(pos[j].second - pos[i].second, 2.0));
q.push(edge{ j, i, len });
}
}
int m;
cin >> m;
memset(par, -1, sizeof(par));
for (int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
int pa = find(a-1);
int pb = find(b-1);
if (pa != pb)
{
uni(pa, pb);
n--;
}
}
kruskal(n);
for (int i = 0; i < res.size(); i++)
cout << res[i].first << " " << res[i].second << endl;
}
return 0;
}
zoj2048_Highways(最小生成树)
最新推荐文章于 2020-03-26 22:03:34 发布