Dejavu
실버 I의견: 0
\(N\) points are placed in the coordinate plane.
Write a program that calculates how many ways we can choose three points so that they form a right triangle with legs parallel to the coordinate axes.
A right triangle has one \(90\)-degree internal angle. The legs of a right triangle are its two shorter sides.
The first line of input contains the integer \(N\) (\(3 \le N \le 100\,000\)), the number of points.
Each of the following \(N\) lines contains two integers \(X\) and \(Y\) (\(1 \le X, Y \le 100\,000\)), the coordinates of one point.
No pair of points will share the same pair of coordinates.
Output the number of triangles.
Scoring: In \(40\%\) of all test cases, \(N\) will be less than \(100\). In \(70\%\) of all test cases, \(N\) will be less than \(10\,000\).
| 서브태스크 | 점수 | 설명 |
|---|---|---|
Subtask 1 | 50점 |
3
4 2
2 1
1 305
1 2
2 1
2 2
2 3
3 246
10 10
20 10
10 20
20 20
30 20
30 308평가 및 의견
Dejavu
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Dejavu