P4703 Sneaking Online

# Description Alice and Bob live in an $l \times l$ square house. Since Bob has recently become obsessed with "ge mo" (gémó), Alice decides to limit how often Bob can go online. Alice has built $n$ wireless signal jammers. The $i$-th jammer is located at $(x_i, y_i)$, with a blocking radius of $\frac{l}{n}$. Bob’s internet addiction flares up and he can’t resist going online. He comes to you to find a position $(x, y)$ that is not covered by any of Alice’s wireless signal jammers.

Alice 和 Bob 生活在一个 $l \times l$ 的正方形房子里，由于 Bob 最近沉迷隔膜，Alice 决定要限制 Bob 上网的频率。 Alice 建造了 $n$ 个无线信号屏蔽器，第 $i$ 个位于 $(x_i, y_i)$，屏蔽范围为 $\frac{l}{n}$。 Bob 网瘾发作按捺不住上网的冲动，找到了你，帮他找到一个位置 $(x, y)$，使得没有被 Alice 的无线信号屏蔽器覆盖。

第一行两个整数 $n, l(1 \leq n \leq 10, 1 \leq l \leq 10^5)$，分别表示无线信号屏蔽器的个数和房子的大小。 接下来 $n$ 行，每行 $2$ 个数，分别是 $x_i, y_i(0 \leq x_i, y_i \leq l)$，意义如上所述。

If such a position exists, output two numbers $x$, $y$ ($0 \le x, y \le l$), as described above. If there are multiple answers, output any one of them. If your output has distance to every jammer at least $\frac{l}{n} + 10^{-6}$, it will be considered correct. Otherwise, output "GG".

Translated by ChatGPT 5