#include <bits/stdc++.h>
#define pb push_back
#define ss second
#define ff first
#define N 100005
#define inf 1000000009
#define ll long long
#define mid(a,b) (a+b)/2
using namespace std;
int n;
ll sum;
pair <int,int> a[N];
map <int,int> m,p;
int main()
{
cin >> n;
for(int i = 1;i <= n;i++){
cin >> a[i].ff >> a[i].ss;
m[a[i].ff]++;
p[a[i].ss]++;
}
for(int i = 1;i <= n;i++)
sum += ((m[a[i].ff] - 1) * (m[a[i].ss] - 1));
cout << sum << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Incorrect |
2 ms |
504 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |