例题6-22 战场（Paintball, UVa 11853）

1. 从上往下若连通，则无解。
2. 从上界开始遍历，与边界相交的最南点即为所求。

#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define LL long long
#define maxn 1005
#define maxm 200005
#define mod 1000000007
#define INF 1000000007
#define eps 1e-5
#define PI 3.1415926535898
#define N 26
using namespace std;
//-------------------------CHC------------------------------//
int n;
double x[maxn], y[maxn], r[maxn];
const double len = 1000.0;
bool vis[maxn];
double west, east;

void solve(int u) {
	if (x[u] < r[u]) west = min(west, y[u] - sqrt(r[u] * r[u] - x[u] * x[u]));
	if (x[u] + r[u] > len) east = min(east, y[u] - sqrt(r[u] * r[u] - (len - x[u])*(len - x[u])));
}

bool intersected(int i, int j) {
	double dis = sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]));
	return dis < r[i] + r[j];
}

bool dfs(int u) {
	vis[u] = true;
	if (y[u] < r[u]) return true;
	for (int i = 0; i < n; ++i) {
		if (!vis[i] && intersected(u, i) && dfs(i))
			return true;
	}
	solve(u);
	return false;
}

int main() {
	while (cin >> n) {
		CLEAR(vis, 0);
		west = east = len;
		for (int i = 0; i < n; ++i)
			cin >> x[i] >> y[i] >> r[i];
		bool connected = false;
		for (int i = 0; i < n; ++i) {
			if (y[i] + r[i] > len && dfs(i))
				connected = true;
		}
		if (connected) cout << "IMPOSSIBLE" << endl;
		else printf("0.00 %.2lf 1000.00 %.2lf\n", west, east);
	}
	return 0;
}