#include <bits/stdc++.h>
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
using namespace std;
const int N = 1e6;
int a[N], b[N], x[N], y[N], a2[N], b2[N], tim;
long long ans = 0;
int main()
{
int n; cin >> n;
set <int> st;
map <int, int> mp;
FOR( i, 1, n, 1 ) cin >> x[i] >> y[i], st.insert( x[i] ), st.insert( y[i] );
for( auto i : st ) mp[i] = ++ tim;
FOR( i, 1, n, 1 )
{
x[i] = mp[x[i]], y[i] = mp[y[i]];
a[x[i]] ++, b[y[i]] ++;
}
FOR( i, 1, n, 1 )
{
ans += ( a[x[i]] - 1 ) * ( b[y[i]] - 1 );
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
8528 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
8528 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
8696 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
8528 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
8528 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
8528 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
8696 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
8528 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |