#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
typedef pair<long long,long long>pii;
void solve(){
int n;
cin >> n;
pii arr[n];
map<int,int>hori;
map<int,int>vert;
for(int x=0;x<n;x++){
cin >> arr[x].first >> arr[x].second;
hori[arr[x].first]++;
vert[arr[x].second]++;
}
int counter=0;
for(int x=0;x<n;x++){
int hold=hori[arr[x].first]-1;
int hold2=vert[arr[x].second]-1;
counter+=(hold*hold2);
}
cout << counter;
}
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin >> t;
while(t--){
solve();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
452 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
5 ms |
1372 KB |
Output is correct |
13 |
Correct |
5 ms |
1372 KB |
Output is correct |
14 |
Correct |
8 ms |
1908 KB |
Output is correct |
15 |
Correct |
84 ms |
8052 KB |
Output is correct |
16 |
Correct |
96 ms |
8272 KB |
Output is correct |
17 |
Correct |
101 ms |
7996 KB |
Output is correct |
18 |
Correct |
87 ms |
8064 KB |
Output is correct |
19 |
Correct |
244 ms |
14864 KB |
Output is correct |
20 |
Correct |
178 ms |
11968 KB |
Output is correct |
21 |
Correct |
267 ms |
15696 KB |
Output is correct |
22 |
Correct |
279 ms |
15688 KB |
Output is correct |