#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n;
pair<ll,ll>a[300005];
map<ll,ll>x,y;
int32_t main(){
CODE_START
cin>>n;
for(ll i=1;i<=n;i++){
cin>>a[i].f>>a[i].s;
x[a[i].f]++;
y[a[i].s]++;
}
ll ans=0;
for(ll i=1;i<=n;i++)
{
ans+=(x[a[i].f]-1)*(y[a[i].s]-1);
}
cout<<ans<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
7 ms |
1260 KB |
Output is correct |
13 |
Correct |
7 ms |
1388 KB |
Output is correct |
14 |
Correct |
12 ms |
1772 KB |
Output is correct |
15 |
Correct |
171 ms |
8148 KB |
Output is correct |
16 |
Correct |
200 ms |
8420 KB |
Output is correct |
17 |
Correct |
146 ms |
7916 KB |
Output is correct |
18 |
Correct |
151 ms |
7916 KB |
Output is correct |
19 |
Correct |
462 ms |
14828 KB |
Output is correct |
20 |
Correct |
313 ms |
11884 KB |
Output is correct |
21 |
Correct |
511 ms |
15572 KB |
Output is correct |
22 |
Correct |
488 ms |
15724 KB |
Output is correct |