#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define pairll pair<ll,ll>
#define lpairll pair<pairll,ll>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define repp(i,a,b) for(ll i = (a); i <= (b); i++)
#define repm(i, a, b) for (ll i = (a); i >= (b); i--)
#define repz(i, a, b) for (ll i = (a); i < (b); i++)
const long long MOD = 1e9+7, N = 3e5 + 5, Q = 4e3+5;
ll tc = 1, n, m=0,k, x[N], y[N];
string s, ye = "YES", no = "NO";
vector<ll> res;
map<pairll,ll> mapz;
map<ll,ll> frx,fry;
void fastt(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
void input(){
cin >> n;
repp(i,1,n){
cin >> x[i] >> y[i];
frx[x[i]]++;
fry[y[i]]++;
mapz[mp(x[i],y[i])]++;
}
}
void solve(){
ll ans = 0;
repp(i,1,n){
ll X = x[i], Y = y[i], sem;
sem = mapz[mp(X,Y)];
ans += (frx[X]-sem)*(fry[Y]-sem);
}
cout << ans << endl;
}
int main(){
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
fastt();
//cin >> tc;
while(tc--){
input();
solve();
}
}
/*
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
320 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
324 KB |
Output is correct |
11 |
Correct |
2 ms |
452 KB |
Output is correct |
12 |
Correct |
10 ms |
1860 KB |
Output is correct |
13 |
Correct |
9 ms |
1904 KB |
Output is correct |
14 |
Correct |
18 ms |
2320 KB |
Output is correct |
15 |
Correct |
265 ms |
14196 KB |
Output is correct |
16 |
Correct |
272 ms |
15148 KB |
Output is correct |
17 |
Correct |
234 ms |
14272 KB |
Output is correct |
18 |
Correct |
221 ms |
14192 KB |
Output is correct |
19 |
Correct |
896 ms |
29216 KB |
Output is correct |
20 |
Correct |
558 ms |
23304 KB |
Output is correct |
21 |
Correct |
945 ms |
31176 KB |
Output is correct |
22 |
Correct |
918 ms |
31168 KB |
Output is correct |