#PQZ1076x7676. Wire Crossing

    ID: 2521 传统题 2000ms 2048MiB 尝试: 0 已通过: 0 难度: NOI/NOI+/CTS 上传者: 标签>QOJ官方数据QOJ官方测试点来源赛事1076计算几何二分

Wire Crossing

Wire Crossing

题目描述

Problem L Wire Crossing Time Limit: 2 seconds Moore’s Law states that the number of transistors on a chip will double every two years. Amazingly, this law has held true for over half a century. Whenever current technology no longer allowed more growth, researchers have come up with new manufacturing technologies to pack circuits even denser. In the near future, this might mean that chips are constructed in three dimensions instead two. But for this problem, two dimensions will be enough. A problem common to all two-dimensional hardware design (for example chips, graphics cards, moth- erboards, and so on) is wire placement. Whenever wires are routed on the hardware, it is problematic if they have to cross each other. When a crossing occurs special gadgets have to be used to allow two electrical wires to pass over each other, and this makes manufacturing more expensive. Our problem is the following: you are given a hardware design with several wires already in place (all of them straight line segments). You are also given the start and end points for a new wire connection to be added. You will have to determine the minimum number of existing wires that have to be crossed in order to connect the start and end points. This connection need not be a straight line. The only requirement is that it cannot cross at a point where two or more wires already meet or intersect. Figure L.1: First sample input Figure L.1 shows the first sample input. Eight existing wires form five squares. The start and end points of the new connection are in the leftmost and rightmost squares, respectively. The black dashed line shows that a direct connection would cross four wires, whereas the optimal solution crosses only two wires (the curved blue line). Input The input consists of a single test case. The first line contains five integers m, x0, y0, x1, y1, which are the number of pre-existing wires (m 100) and the start and end points that need to be connected. This is followed by m lines, each containing four integers xa, ya, xb, yb describing an existing wire of non-zero length from (xa, ya) to (xb, yb). The absolute value of each input coordinate is less than 105. Each pair of wires has at most one point in common, that is, wires do not overlap. The start and end points for the new wire do not lie on a pre-existing wire. ACM-ICPC World Finals 2014 Problem L: Wire Crossing 23 Output Display the minimum number of wires that have to be crossed to connect the start and end points. Sample Input 1 Sample Output 1 8 3 3 19 3 2 0 1 22 1 0 5 22 5 1 0 1 6 5 0 5 6 9 0 9 6 13 0 13 6 17 0 17 6 21 0 21 6 Sample Input 2 Sample Output 2 1 0 5 10 5 0 0 0 10 10 ACM-ICPC World Finals 2014 Problem L: Wire Crossing 24

输入格式

(见题面原文)

输出格式

(见题面原文)

数据范围

官方测试点 25 个;落地 2 个;时限 2.0s,内存 2048MB。

样例

样例 1

8 3 3 19 3
0 1 22 1
0 5 22 5
1 0 1 6
5 0 5 6
9 0 9 6
13 0 13 6
17 0 17 6
21 0 21 6
2

样例 2

1 0 5 10 5
0 0 10 10
0

数据来源:QOJ 公开题包官方 .in/.out;本题落地 2 个测试点,QOJ 元数据标注官方共 25 点,覆盖级别:部分官方测试点。时限 2.0s,内存 2048MB。按 Hydro 默认逐字节比对判定。