#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 100+5 , INF = 1e18 , MOD = 1e9+7;
void solve(){
ll n;
cin >> n;
unordered_map<ll,ll> x,y;
vector<pair<ll,ll>> a(n+5);
for(ll i = 1; i <= n; i++){
cin >> a[i].first >> a[i].second;
x[a[i].first]++;
y[a[i].second]++;
}
ll cnt = 0;
for(ll i = 1; i <= n; i++) cnt += (x[a[i].first]-1)*(y[a[i].second]-1);
cout << cnt;
}
int main(){
fast;
ll tc = 1;
// cin >> tc;
while(tc--) solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
2 ms |
340 KB |
Output is correct |
12 |
Correct |
5 ms |
980 KB |
Output is correct |
13 |
Correct |
5 ms |
980 KB |
Output is correct |
14 |
Correct |
6 ms |
1356 KB |
Output is correct |
15 |
Correct |
47 ms |
6732 KB |
Output is correct |
16 |
Correct |
41 ms |
6888 KB |
Output is correct |
17 |
Correct |
43 ms |
6532 KB |
Output is correct |
18 |
Correct |
50 ms |
6656 KB |
Output is correct |
19 |
Correct |
128 ms |
13232 KB |
Output is correct |
20 |
Correct |
105 ms |
10428 KB |
Output is correct |
21 |
Correct |
110 ms |
14116 KB |
Output is correct |
22 |
Correct |
107 ms |
14084 KB |
Output is correct |