STL应用---Codeforces-650-A.watchman
来源:互联网 发布:js rem 编辑:程序博客网 时间:2024/05/18 03:18
A. Watchmen
time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output
Watchmen are in a danger and Doctor Manhattan together with his friend Daniel Dreiberg should warn them as soon as possible. There are n watchmen on a plane, the i-th watchman is located at point (xi, yi).
They need to arrange a plan, but there are some difficulties on their way. As you know, Doctor Manhattan considers the distance between watchmen i and j to be |xi - xj| + |yi - yj|. Daniel, as an ordinary person, calculates the distance using the formula .
The success of the operation relies on the number of pairs (i, j) (1 ≤ i < j ≤ n), such that the distance between watchman i and watchmen j calculated by Doctor Manhattan is equal to the distance between them calculated by Daniel. You were asked to compute the number of such pairs.
Input
The first line of the input contains the single integer n (1 ≤ n ≤ 200 000) — the number of watchmen.
Each of the following n lines contains two integers xi and yi (|xi|, |yi| ≤ 109).
Some positions may coincide.
Output
Print the number of pairs of watchmen such that the distance between them calculated by Doctor Manhattan is equal to the distance calculated by Daniel.
Examples input
3
1 1
7 5
1 5
output
2
input
6
0 0
0 1
0 2
-1 1
0 1
1 1
output
11
Note
In the first sample, the distance between watchman 1 and watchman 2 is equal to |1 - 7| + |1 - 5| = 10 for Doctor Manhattan and for Daniel. For pairs (1, 1), (1, 5) and (7, 5), (1, 5) Doctor Manhattan and Daniel will calculate the same distances.
题目大意:求出曼哈顿距离与欧几里得距离相同的总的对数;
解题思路:根据公式:
与公式:|xi - xj| + |yi - yj|,可以将其同时平方,然后化简,得出二者相等的条件是:xi==xj || yi==yj .
然后可以 STL的映射map来求解,方便快捷;
具体代码如下:
#include <cstdio>#include<algorithm>#include <map>using namespace std;int n,x,y;long long m;map<int,int> a,b;map<pair<int,int>,int> c;int main(){ scanf("%d",&n); while (n--) { scanf("%d%d",&x,&y); m+=a[x]+b[y]-c[make_pair(x,y)];//注意减去重复的 ++a[x];++b[y]; ++c[make_pair(x,y)]; } printf("%I64d\n",m); return 0; }
仅代表个人观点,欢迎交流探讨,勿喷~~~
PhotoBy:WLOP
http://weibo.com/wlop
- STL应用---Codeforces-650-A.watchman
- Codeforces Round #323 (Div. 1) A. GCD Table stl应用
- codeforces 2A winner(stl应用,模拟)
- CodeForces 114B 【STL应用】
- Codeforces Round #310 (Div. 1) D. Case of a Top Secret 二分 stl应用
- codeforces 208A (STL做法)
- Codeforces 528A Glass Carving STL模拟
- Codeforces 2A: Winner【STL】【模拟】
- Codeforces 2A Winner (STL map使用)
- Codeforces Round #130 (Div. 2) A. Dubstep(STL做法)
- Codeforces 639A Bear and Displayed Friends 【STL】
- 【STL】【模拟】Codeforces 696A Lorenzo Von Matterhorn
- 【STL】CodeForces
- CodeForces 650A Watchmen
- Watchmen(Codeforces 650A)
- Codeforces 29C:Mail Stamps(STL的应用+DFS)
- CodeForces 589A -- A. Email Aliases (字符串水题 STL)
- HDU2034 人见人爱A-B(C++STL--set_difference()的应用)
- VS2010 C++读写.mat格式文件
- pl/sql 循环
- 如何结合工作年限和薪资来计算年终奖。
- 图像腐蚀和膨胀
- 编程之美2.21 只考加法的面试题
- STL应用---Codeforces-650-A.watchman
- 第六周实践项目4————静态成员的应用
- FOJ FZU 2028 时空门问题【BFS+vector】
- linux中进程在内存中的布局
- NYOJ 77 开灯问题 数组简单应用
- Java 中SAM的Lambda表达式的条件测试
- 337. House Robber III+198. House Robber
- 同步嵌套死锁例子
- TCP三次握手的思考,为什么要有三次握手