Logo
(追記) (追記ここまで)

18784번 - Triangles (Silver) 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 (추가 시간 없음) 512 MB57021117340.802%

문제

Farmer John would like to create a triangular pasture for his cows.

There are $N$ fence posts (3ドル\le N\le 10^5$) at distinct points $(X_1, Y_1) \ldots (X_N, Y_N)$ on the 2D map of his farm. He can choose three of them to form the vertices of the triangular pasture as long as one of the sides of the triangle is parallel to the $x$-axis and another side is parallel to the $y$-axis.

What is the sum of the areas of all possible pastures that FJ can form?

입력

The first line contains $N.$

Each of the next $N$ lines contains two integers $X_i$ and $Y_i,ドル each in the range $-10^4 \ldots 10^4$ inclusive, describing the location of a fence post.

출력

As the sum of areas is not necessarily be an integer and may be very large, output the remainder when two times the sum of areas is taken modulo 10ドル^9+7$.

제한

예제 입력 1

4
0 0
0 1
1 0
1 2

예제 출력 1

3

힌트

Fence posts $(0,0),ドル $(1,0),ドル and $(1,2)$ give a triangle of area 1ドル,ドル while $(0,0),ドル $(1,0),ドル and $(0,1)$ give a triangle of area 0ドル.5$. Thus, the answer is 2ドル\cdot (1+0.5)=3.$

출처

Olympiad > USA Computing Olympiad > 2019-2020 Season > USACO 2020 February Contest > Silver 2번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /