例题6-22(uva11853)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1005;
const double bound = 1000.0;
int cnt = 0;
double l, r;
struct Node{
	int x, y, r;
}nodes[maxn];
int vis[maxn];

bool intersect(int a, int b) {
	return sqrt((nodes[a].x - nodes[b].x) * (nodes[a].x - nodes[b].x) + (nodes[a].y - nodes[b].y) * (nodes[a].y - nodes[b].y)) < nodes[a].r + nodes[b].r;
}

void GetBound(int u) {
	if (nodes[u].x - nodes[u].r < 0) {
		l = min(l, nodes[u].y - sqrt(nodes[u].r * nodes[u].r - nodes[u].x * nodes[u].x));
	}

	if (nodes[u].x + nodes[u].r > bound) {
		r = min(r, nodes[u].y - sqrt(nodes[u].r * nodes[u].r - (bound - nodes[u].x) * (bound - nodes[u].x)));
	}
}

bool dfs(int u) {
	if (vis[u]) return false;
	vis[u] = 1;

	if (nodes[u].y - nodes[u].r < 0) return true;

	for (int i = 0; i < cnt; ++i) {
		if (intersect(u, i) && dfs(i)) return true;
	}
	GetBound(u);

	return false;
}

int main()
{

	while (cin >> cnt) {
		l = r = bound;
		memset(vis, 0, sizeof(vis));
		for (int i = 0; i < cnt; ++i) {
			cin >> nodes[i].x >> nodes[i].y >> nodes[i].r;
		}
		bool isok = true;
		for (int i = 0; i < cnt; ++i) {
			if (nodes[i].y + nodes[i].r > bound && dfs(i)) { isok = false; break; }
		}
		if (isok) {
			cout << "0.00 " << fixed << setprecision(2) << l << " " << bound << " " << r << endl;
		}
		else
			cout << "IMPOSSIBLE" << endl;
	}
	return 0;
}