codechef Three Way Communications 题解

cheng029

　　

The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef all carry two-way transceivers so they can stay in constant contact. Of course, these transceivers have a limited range so if two are too far apart, they cannot
communicate directly.

The Chef invested in top-of-the-line transceivers which have a few advanced features. One is that even if two people cannot talk directly because they are out of range, if there is another transceiver that is close enough to both, then the two transceivers
can still communicate with each other using the third transceiver as an intermediate device.

There has been a minor emergency in the Chef's restaurant

and he needs to communicate with both the head server and the sous-chef right away. Help the Chef determine if it is possible for all three people to communicate with each other, even if two must communicate through the third because they are too far apart.


Input


The first line contains a single positive integer T ≤ 100 indicating the number of test cases to follow. The first line of each test case contains a positive integer R ≤ 1,000 indicating that two transceivers can communicate directly without an intermediate
transceiver if they are at most R meters away from each other. The remaining three lines of the test case describe the current locations of the Chef, the head server, and the sous-chef, respectively. Each such line contains two integers X,Y (at most 10,000
in absolute value) indicating that the respective person is located at position X,Y.


Output


For each test case you are to output a single line containing a single string. If it is possible for all three to communicate then you should output "yes". Otherwise, you should output "no".

To be clear, we say that two transceivers are close enough to communicate directly if the length of the straight line connecting their X,Y coordinates is at most R.


Example

Input:
3
1
0 1
0 0
1 0
2
0 1
0 0
1 0
2
0 0
0 2
2 1

Output:
yes
yes
no

　　会求点和点之间的距离即可。
　　使用距离的平方比较即可。
　　#pragma once
#include <stdio.h>
struct ThreeWayPoint
{
int x, y;
};
int ThreeWayCommunications()
{
int T;
scanf(&quot;%d&quot;, &T);
while (T--)
{
int R;
scanf(&quot;%d&quot;, &R);
ThreeWayPoint p1, p2, p3;
scanf(&quot;%d %d %d %d %d %d&quot;,
&p1.x, &p1.y, &p2.x, &p2.y, &p3.x, &p3.y);
R *= R;
int P12 = 0, P13 = 0, P23 = 0;
P12 = (p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y);
P13 = (p1.x - p3.x) * (p1.x - p3.x) + (p1.y - p3.y) * (p1.y - p3.y);
P23 = (p3.x - p2.x) * (p3.x - p2.x) + (p3.y - p2.y) * (p3.y - p2.y);
if (P12 <= R && P13 <= R) puts(&quot;yes&quot;);
else if (P23 <= R && P12 <= R) puts(&quot;yes&quot;);
else if (P13 <= R && P23 <= R) puts(&quot;yes&quot;);
else puts(&quot;no&quot;);
}
return 0;
}