关闭

Codeforces Round #341 (Div. 2)B. Wet Shark and Bishops

163人阅读 评论(0) 收藏 举报
分类:

思路:求对角线相同的对数,显然可以由第一个样例得知,同一个对角线的要么x+y相同,要么x-y相同,那么随便记录一下,每一个的贡献是cnt[i]*(cnt[i]-1)/2


#include<bits\stdc++.h>
using namespace std;
int cnt1[10005];
int cnt2[10005];
int main()
{
    int n;
    int ans = 0;
	cin >>n;
	for(int i = 1;i<=n;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		cnt1[x+y]++;
		cnt2[x-y+1000]++;
	}
	for(int i = 0;i<=2005;i++)
	{
		ans+=cnt1[i]*(cnt1[i]-1)/2;
		ans+=cnt2[i]*(cnt2[i]-1)/2;
	}
	cout << ans << endl;
}


B. Wet Shark and Bishops
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Examples
input
5
1 1
1 5
3 3
5 1
5 5
output
6
input
3
1 1
2 3
3 5
output
0
Note

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.



0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

Codeforces Round #406 (Div. 2):C. Berzerk(记忆化搜索解决博弈问题)

C. Berzerk time limit per test 4 seconds memory limit per test 256 megabytes input standard in...
  • Jaihk662
  • Jaihk662
  • 2017-03-24 15:23
  • 790

【Codeforces Round 375 (Div 2) E】【欧拉回路Fleury算法 或网络流】One-Way Reform 每条边定向使得最多的点满足入度=出度

E. One-Way Reform time limit per test 2 seconds memory limit per test 256 megabytes ...
  • snowy_smile
  • snowy_smile
  • 2016-10-04 10:20
  • 735

2017暑期集训——Wet Shark and Bishops(思维)

J - *Wet Shark and Bishops(思维) Today, Wet Shark is given n bishops on a 1000 by 1000 grid. Bo...
  • Greenary
  • Greenary
  • 2017-07-22 21:33
  • 140

13周练 B - Wet Shark and Bishops 【矩阵对角线+组合】

B - Wet Shark and Bishops Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d...
  • bmicnj
  • bmicnj
  • 2016-05-29 20:45
  • 155

Codeforces Round #347 (Div. 2) B. Rebus(给你一个等式里面只含加减号凑出一个数)

B. Rebus time limit per test 1 second memory limit per test 256 megabytes input st...
  • acm_fighting
  • acm_fighting
  • 2016-04-25 15:54
  • 315

Codeforces Round #362 (Div. 2)B. Barnicle(较坑模拟【菜鸡与大佬的区别】)

题目链接:http://codeforces.com/contest/697/problem/B【中文题意】给你一个浮点数的计数法表示形式,然后表示出他的正常形式,表示出的数不能有前导0也不能有后导0...
  • qq_32866009
  • qq_32866009
  • 2017-02-08 15:44
  • 126

数学推公式——较难——Codeforces Round #187 (Div. 2)

题目链接: http://codeforces.com/contest/315/problem/C C. Sereja and Contest time limi...
  • CS_liuqing
  • CS_liuqing
  • 2013-06-16 15:34
  • 1995

Codeforces Round #244 (Div. 2)(强连通分量,后缀数组)

A. Police Recruits #include #include #include #include using namespace std; int n; int main() { ...
  • u010660276
  • u010660276
  • 2014-05-23 20:08
  • 420

Codeforces Round #248 (Div. 2) B题 【数据结构:树状数组】

题目链接:http://codeforces.com/contest/433/problem/B 题目大意:给n(1 ≤ n ≤ 105)个数据(1 ≤ vi ≤ 109),其中有m(1 ≤ m ≤...
  • u013912596
  • u013912596
  • 2014-05-24 18:18
  • 706

Codeforces Round #312 (Div. 2) (第三题是位运算,好题)

比赛:点击打开链接 558A - Lala Land and Apple Trees 分析:从0坐标分开,负半轴一个数组,正半轴一个数组,来记录果树的左边和数量,可以用结构体数组来存储数据,其...
  • loveyou11111111
  • loveyou11111111
  • 2015-08-31 16:30
  • 156
    个人资料
    • 访问:315234次
    • 积分:13429
    • 等级:
    • 排名:第1130名
    • 原创:1078篇
    • 转载:3篇
    • 译文:0篇
    • 评论:49条
    最新评论