#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, X[300005], Y[300005];
map <int, int> rw, col;
void solve(){
cin >> n;
for(int i=1;i<=n;i++){
cin >> X[i] >> Y[i];
rw[X[i]]++;
col[Y[i]]++;
}
int ans = 0;
for(int i = 1; i <= n; i++)ans += (rw[X[i]] - 1) * (col[Y[i]] - 1);
cout << ans << '\n';
}
main(){
ios::sync_with_stdio(0);cin.tie(0);
int tc = 1;
//cin >> tc;
for(int tc1=1;tc1<=tc;tc1++){
// cout << "Case #" << tc1 << ": ";
solve();
}
}
Compilation message
triangle.cpp:29:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
29 | main(){
| ^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
5 |
Correct |
1 ms |
2648 KB |
Output is correct |
6 |
Correct |
1 ms |
2396 KB |
Output is correct |
7 |
Correct |
1 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
1 ms |
2396 KB |
Output is correct |
10 |
Correct |
1 ms |
2396 KB |
Output is correct |
11 |
Correct |
1 ms |
2396 KB |
Output is correct |
12 |
Correct |
5 ms |
3164 KB |
Output is correct |
13 |
Correct |
5 ms |
3420 KB |
Output is correct |
14 |
Correct |
9 ms |
3676 KB |
Output is correct |
15 |
Correct |
87 ms |
10576 KB |
Output is correct |
16 |
Correct |
99 ms |
11024 KB |
Output is correct |
17 |
Correct |
87 ms |
10752 KB |
Output is correct |
18 |
Correct |
86 ms |
10644 KB |
Output is correct |
19 |
Correct |
248 ms |
15184 KB |
Output is correct |
20 |
Correct |
168 ms |
12888 KB |
Output is correct |
21 |
Correct |
254 ms |
15552 KB |
Output is correct |
22 |
Correct |
275 ms |
15816 KB |
Output is correct |