Codeforces 621B - Wet Shark and Bishops(思维)

最新推荐文章于 2018-02-25 13:49:50 发布

Snakeflute

最新推荐文章于 2018-02-25 13:49:50 发布

阅读量469

点赞数

分类专栏： CodeForces

本文链接：https://blog.csdn.net/Snakeflute/article/details/54782445

版权

该博客讨论了Codeforces的一道题目，涉及棋盘上的主教（Bishops）如何根据对角线规则攻击彼此。题目要求计算在1000x1000的网格上，n个主教形成的不同攻击对的数量。输入包含主教的位置，输出是攻击对的总数。博客提供了题意解析、解题思路和通过测试的代码实现。

摘要由CSDN通过智能技术生成

B. Wet Shark and Bishops
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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 guarantee