QOJ.ac

QOJ

Time Limit: 1.5 s Memory Limit: 128 MB Total points: 100

#7464. Self Adjusting Top Tree

统计

平面上有 $n$ 条线段。

共 $m$ 次询问,每次询问给出一个边平行于坐标轴的矩形,问 每条与矩形有交的线段与矩形的交的长度之和 与 所有线段的长度之和 的 比值,要求输出与标准答案的相对误差或绝对误差不超过 $10^{-6}$。

线段以 $x_1\;y_1\;x_2\;y_2$ 的形式给出,表示以 $(x_1,y_1),(x_2,y_2)$ 为端点的线段,保证任意两条线段没有交点或重合部分,且 $x_1\ne x_2,y_1\ne y_2$。

矩形以 $x_1\;y_1\;x_2\;y_2$ 的形式给出,表示矩形 $\{(x,y)|x_1\le x\le x_2,y_1\le y\le y_2\}$,保证 $x_1< x_2, y_1< y_2$。

输入格式

第一行一个整数 $n$。

接下来 $n$ 行,每行四个由空格分隔的整数 $x1,y1,x2,y2$,表示线段。

接下来一行一个整数 $m$。

接下来 $m$ 行,每行四个由空格分隔的整数 $x1,y1,x2,y2$,表示询问的矩形。

输出格式

对每个询问,输出一行,一个介于 $0$ 和 $1$ 之间的十进制小数,表示答案

样例数据

样例输入

2
1 1 4 4
2 1 4 3
4
1 1 6 6
1 1 3 3
2 1 3 3
1 2 2 4

样例输出

1
0.6
0.4
0

子任务

Idea:nzhtl1477&ccz181078,Solution:ccz181078,Code:ccz181078,Data:ccz181078

对于 $100\%$ 的数据,$1\le n,m\le 10^5, 1\le x_1,y_1,x_2,y_2\le 10^6$。

Discussions

About Discussions

The discussion section is only for posting: Editorials, 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. Submitting multiple issues may cause your account to be banned.
  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.