A985 | Triangles--Silver
来源USACO
时间限制1s
内存限制128MB
通过 / 提交0/0
题目描述
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?
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?
输入格式
* Test case 2 satisfies $N=200.$
* Test cases 3-4 satisfy $N\le 5000.$
* Test cases 5-10 satisfy no additional constraints.
* Test cases 3-4 satisfy $N\le 5000.$
* Test cases 5-10 satisfy no additional constraints.
输出格式
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.
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.
输入输出样例
输入 #1
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
3
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted