Straža
플래티넘 I의견: 0
Near a military base there is a system of trenches, modeled as line segments in a plane. During nighttime, when most soldiers are fast asleep, three guards stand watch over the trenches. Two guards can see each other if there is a trench (or a row of trenches) along the entire straight line segment between them, and there is no third guard on that line segment.
For security reasons, the guards must be placed so that each guard sees the other two. In how many ways can they be placed?
The first line contains the integer \(N\) (\(1 \le N \le 100\)), the number of trenches. Each of the next \(N\) lines contains the description of one trench: four integers \(x_1\), \(y_1\), \(x_2\), \(y_2\) (each between \(0\) and \(100\)), where \((x_1, y_1)\) are the coordinates of one end and \((x_2, y_2)\) the coordinates of the other end.
Trenches in the input may overlap and share endpoints.
Output the number of ways the guards can be placed, on a single line.
| 서브태스크 | 점수 | 설명 |
|---|---|---|
Subtask 1 | 110점 |
6
0 0 1 0
0 0 0 1
1 0 1 1
0 1 1 1
0 0 1 1
1 0 0 184
5 1 7 1
1 1 5 1
4 0 4 4
7 0 3 413
2 2 3 2
3 2 3 3
3 3 2 30평가 및 의견
Straža
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Straža