QOJ.ac

QOJ

Limite de temps : 8.0 s Limite de mémoire : 512 MB Points totaux : 100 Hackable ✓

#7065. 三角形

Statistiques

有一天,ABC 和 DD 发现了一块三角形麦田,他们决定用一条线段将其切割成面积相等的两部分。由于各种原因,分割线的一个端点固定在 $(p_x, p_y)$。现在请你求出该线段的另一个端点。

如果给定的端点不在麦田的边界上,则该问题应被视为无效。所求的另一个端点也必须位于边界上。

输入格式

输入包含多组测试数据,第一行包含一个整数 $T$ ($1 \le T \le 10^6$),表示测试数据的组数。

对于每组测试数据,一行包含八个整数 $x_1, y_1, x_2, y_2, x_3, y_3, p_x$ 和 $p_y$,其中 $(x_1, y_1), (x_2, y_2)$ 和 $(x_3, y_3)$ 描述了给定三角形麦田的顶点坐标(保证三点不共线),$(p_x, p_y)$ 是给定的线段端点。所有坐标均为 $[0, 10^5]$ 范围内的整数。

输出格式

对于每组测试数据,输出分割线段的另一个端点的坐标,如果该问题无效,则输出 $-1$。

形式化地,如果你的答案是 $a$,裁判的答案是 $b$,那么当且仅当 $\frac{|a-b|}{\max\{1, |b|\}} \le 10^{-6}$ 时,你的答案将被视为正确。

样例

输入 1

2
0 0 1 1 1 0 1 0
0 0 1 1 1 0 2 0

输出 1

0.500000000000 0.500000000000
-1

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.