# include <bits/stdc++.h>
//# pragma GCC optimize("Ofast")
# define pb push_back
# define ll long long
# define fi first
# define se second
# define all(vc) vc.begin(),vc.end()
# define forn(i, n) for (int i = 0; i < int(n); i++)
# define ford(i, n) for (int i = int(n) - 1; i >= 0; i--)
# define fore(i, l, r) for (int i = int(l); i < int(r); i++)
# define in freopen("input.txt", "r", stdin)
# define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
# define time cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"
using namespace std;
const ll INF = 1e18;
const int mod = 1e9 + 7;
const ll N = 1e7 + 7;
map < ll, ll > x, y;
pair < ll, ll > p[N];
int main()
{
speed;
ll n;
cin >> n;
forn( i, n ) {
cin >> p[i].fi >> p[i].se;
x[ p[i].fi ]++;
y[ p[i].se ]++;
}
ll ans = 0;
forn( i, n ) {
ans += max( 0ll, x[ p[i].fi ] - 1 ) * max( 0ll, x[ p[i].se ] - 1 );
}
cout << ans;
//time;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
