#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long
#define ft first
#define sc second
using namespace std;
const int mod=1e9+7,INF=1e17;
int a[300005],b[300005];
multiset<pair<int,int>> p;
map<int,int> m,m1;
main(){
int n,ans=0;
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
p.insert({a[i],b[i]});
m[a[i]]++;
m1[b[i]]++;
}
for(auto x : p){
ans+=(m[x.ft]-1)*(m1[x.sc]-1);
}
cout << ans;
}
Compilation message
triangle.cpp:15:2: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
15 | main(){
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
304 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
300 KB |
Output is correct |
7 |
Correct |
1 ms |
276 KB |
Output is correct |
8 |
Correct |
1 ms |
300 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
2 ms |
300 KB |
Output is correct |
11 |
Correct |
2 ms |
368 KB |
Output is correct |
12 |
Correct |
19 ms |
1844 KB |
Output is correct |
13 |
Correct |
18 ms |
1864 KB |
Output is correct |
14 |
Correct |
23 ms |
2312 KB |
Output is correct |
15 |
Correct |
300 ms |
14172 KB |
Output is correct |
16 |
Correct |
357 ms |
15128 KB |
Output is correct |
17 |
Correct |
335 ms |
14160 KB |
Output is correct |
18 |
Correct |
272 ms |
14260 KB |
Output is correct |
19 |
Correct |
888 ms |
32140 KB |
Output is correct |
20 |
Correct |
671 ms |
24260 KB |
Output is correct |
21 |
Correct |
955 ms |
34404 KB |
Output is correct |
22 |
Correct |
883 ms |
34300 KB |
Output is correct |