#include<bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define all(v) v.begin(),v.end()
#define boost ios_base::sync_with_stdio(0),cin.tie(0),cout.tie()
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
typedef pair<ll,ll> pll;
const ll INF = 1e18;
const int inf = INT_MAX;
const ll mod = 1e9 + 7;
const int pi = acos(-1);
const int dx[4] = {0, 1, 0, 0};
const int dy[4] = {1, 0, 0, 0};
const int N = 1e5 + 5;
const int MAXN = 1e6 + 1;
int x[3 * N], y[3 * N];
map < int, int > cnt1, cnt2;
int main(){
int n;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> x[i] >> y[i];
cnt1[x[i]]++;
cnt2[y[i]]++;
}
ll ans = 0;
for(int i = 1; i <= n; i++){
ans += 1LL * (cnt1[x[i]] - 1) * (cnt2[y[i]] - 1);
}
cout << ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
504 KB |
Output is correct |
3 |
Correct |
2 ms |
504 KB |
Output is correct |
4 |
Correct |
2 ms |
592 KB |
Output is correct |
5 |
Correct |
2 ms |
592 KB |
Output is correct |
6 |
Correct |
2 ms |
592 KB |
Output is correct |
7 |
Correct |
3 ms |
700 KB |
Output is correct |
8 |
Correct |
3 ms |
700 KB |
Output is correct |
9 |
Correct |
3 ms |
748 KB |
Output is correct |
10 |
Correct |
3 ms |
780 KB |
Output is correct |
11 |
Correct |
3 ms |
800 KB |
Output is correct |
12 |
Correct |
16 ms |
1460 KB |
Output is correct |
13 |
Correct |
16 ms |
1800 KB |
Output is correct |
14 |
Correct |
23 ms |
2344 KB |
Output is correct |
15 |
Correct |
240 ms |
7480 KB |
Output is correct |
16 |
Correct |
250 ms |
10016 KB |
Output is correct |
17 |
Correct |
257 ms |
11936 KB |
Output is correct |
18 |
Correct |
241 ms |
13972 KB |
Output is correct |
19 |
Correct |
717 ms |
21616 KB |
Output is correct |
20 |
Correct |
521 ms |
25248 KB |
Output is correct |
21 |
Correct |
668 ms |
32584 KB |
Output is correct |
22 |
Correct |
675 ms |
38984 KB |
Output is correct |