CodeForces
来源:互联网 发布:淘宝店铺名片分享 编辑:程序博客网 时间:2024/05/19 00:38
Description
Today, Wet Shark is given n bishops on a 1000 by 1000 grid. Both rows and columns of the grid are numbered from 1 to 1000. Rows are numbered from top to bottom, while columns are numbered from left to right.
Wet Shark thinks that two bishops attack each other if they share the same diagonal. Note, that this is the only criteria, so two bishops may attack each other (according to Wet Shark) even if there is another bishop located between them. Now Wet Shark wants to count the number of pairs of bishops that attack each other.
Input
The first line of the input contains n (1 ≤ n ≤ 200 000) — the number of bishops.
Each of next n lines contains two space separated integers xi and yi (1 ≤ xi, yi ≤ 1000) — the number of row and the number of column where i-th bishop is positioned. It’s guaranteed that no two bishops share the same position.
Output
Output one integer — the number of pairs of bishops which attack each other.
Sample Input
5
1 1
1 5
3 3
5 1
5 5
3
1 1
2 3
3 5
Sample Output
6
0
Hint
In the first sample following pairs of bishops attack each other: (1, 3), (1, 5), (2, 3), (2, 4), (3, 4) and (3, 5). Pairs (1, 2), (1, 4), (2, 5) and (4, 5) do not attack each other because they do not share the same diagonal.
题意
询问1000*1000的方格纸上 在斜率绝对值为1的直线上的点 之间的点对 数
题解:
暴力枚举斜率为1和-1的所有直线 因为直线为y = -x+b 或y = x +b
所以分别记录 x+y和y-x或x-y的数目
设一条直线n个点
一条直线上的点对数为 (n-1)*n/2
AC代码
#include <cstdio>#include <cstring>typedef long long LL;int a[3][2000];int main(){ int n; scanf("%d",&n); int x,y; for (int i = 0; i < n; ++i){ scanf("%d%d",&x,&y); if (x<y) a[1][y-x]++; else a[2][x-y]++; a[0][x+y]++; } int ans = 0; for (int i = 2; i < 2000; i+=1){ ans += a[0][i]*(a[0][i]-1)/2; } for (int i = 0; i < 1000; ++i){ ans += a[1][i]*(a[1][i]-1)/2; ans += a[2][i]*(a[2][i]-1)/2; } printf("%d\n",ans); return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- NYOJ 811 变态最大值
- 语音增强技术
- BF算法简述
- ROS操作系统
- 数据结构导论-线性表
- CodeForces
- gradle的安装使用
- 矩阵链乘法
- Mysql的自我复制的sql语句
- Python实现基于BIC的语音对话分割(一)
- DOM解析XMl文件
- Jq--内容过滤选择器
- 【caffe】Caffe的Python接口-官方教程-00-classification-详细说明(含代码)
- Mysql远程连接Error1130解决方法