思路:
从上边界开始找,如果能够连通的到达下边界,则肯定不能从左边到右边,也就是无解!
从上边界开始找就是dfs,每dfs一次就判断与左边界的交点,和右边界的交点,不断的取最小值即可!
之所以不断的取靠南的方向,是因为从这个交点向上肯定过不去,因为是一路找过来的吗!
教训:
1。这个题不能从下边界开始找!
2。注意不能return dfs;
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
int n;
double res1,res2;
int vis[maxn];
struct army{
double x,y,r;
}c[maxn];
bool judge(const army &rhs1,const army &rhs2){
return sqrt((rhs1.y-rhs2.y) * (rhs1.y-rhs2.y) + (rhs1.x-rhs2.x) * (rhs1.x-rhs2.x)) <= rhs1.r + rhs2.r;
}
bool dfs(int k){
vis[k] = 1;
if (c[k].r >= c[k].y)return false;
if (c[k].x <= c[k].r){
double t = sqrt(c[k].r*c[k].r - c[k].x*c[k].x);
res1 = min(res1,c[k].y - t);
}else if (1000.00 - c[k].x <= c[k].r){
double t = sqrt(c[k].r*c[k].r - (1000.00-c[k].x)*(1000.00 - c[k].x));
res2 = min(res2,c[k].y - t);
}
for (int i = 0; i < n; ++i){
if (judge(c[k],c[i]) && !vis[i]){
if (!dfs(i))return false;
}
}
return true;
}
bool solve(){
for (int i = 0; i < n; ++i){
if (c[i].y + c[i].r >= 1000.00)if (!vis[i])
if (!dfs(i))return false;
}
return true;
}
int main()
{
while(scanf("%d",&n) == 1){
res1 = res2 = 1000.00;
memset(vis,0,sizeof(vis));
for (int k = 0; k < n; ++k)
scanf("%lf%lf%lf",&c[k].x,&c[k].y,&c[k].r);
if (!solve()){printf("IMPOSSIBLE\n");continue;}
printf("0.00 %.2lf 1000.00 %.2lf\n",res1,res2);
}
return 0;
}