题目链接
题意:
给定相等的
x
,
y
x,y
x,y轴上的点,两两配对并计算二者的距离,问所有配对方式中最小距离和是多少。
思路:
显然可以将所有点坐标取一个绝对值,即可设
x
,
y
x,y
x,y轴上点分别为
(
a
,
0
)
,
(
b
,
0
)
(
a
,
b
>
0
)
(a,0),(b,0) (a,b>0)
(a,0),(b,0)(a,b>0)此时我们在两坐标轴上分别任取两点
A
,
C
、
B
,
D
A,C、B,D
A,C、B,D,如下图所示:
由图显然可见
∣
A
D
∣
+
∣
B
C
∣
<
∣
A
O
∣
+
∣
B
O
∣
+
∣
C
O
∣
+
∣
D
O
∣
|AD|+|BC|<|AO|+|BO|+|CO|+|DO|
∣AD∣+∣BC∣<∣AO∣+∣BO∣+∣CO∣+∣DO∣(构造三角形)。
所以最优策略就是两坐标轴上点分别按坐标绝对值排序,从小到大两两配对。
AC代码:
#include <bits/stdc++.h>
#define pcc pair<char, char>
#define pii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define rep(i, x, y) for (int i = x; i < y; i++)
#define per(i, x, y) for (int i = x; i >= y; i--)
#define rep0(i, n) for (int i = 0; i < (n); i++)
#define per0(i, n) for (int i = (n)-1; i >= 0; i--)
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ull unsigned long long
#define db double
#define ld long double
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
/***************main****************/
ll T = 1;
ll m, n;
int main() {
T = read();
while (T--) {
n = read();
vector<double> X, Y;
rep(i, 0, 2 * n) {
ll x = read();
ll y = read();
if (x == 0)
Y.push_back(abs(double(y)));
else
X.push_back(abs(double(x)));
}
sort(X.begin(), X.end());
sort(Y.begin(), Y.end());
double ans = 0;
rep(i, 0, n) ans += sqrt(Y[i] * Y[i] + X[i] * X[i]);
printf("%.15lf\n", ans);
}
return 0;
}