#include <bits/stdc++.h>
#define fr first
#define sc scanf
#define pf printf
#define se second
#define sq(x) x * x
#define ll long long
#define pb push_back
#define mk make_pair
#define ld long double
#define pr pair<ll,ll>
#define sz(s) int(s.size())
#define piip pair< pair<ll,ll>,ll >
//#define fin(s) freopen( s, "r", stdin )
//#define fout(s) freopen( s, "w", stdout )
#define TIME ios_base::sync_with_stdio(0)
using namespace std;
const ll INF = 1e9;
const ll N = 3e5 + 1;
const ll mod = 1e9 + 7;
const long double eps = 1E-7;
map<ll,ll>l, r;
ll n, x[N], y[N], ans;
int main()
{
TIME;
cin >> n;
for( int i = 1; i <= n; i ++ )
{
cin >> x[i] >> y[i];
l[x[i]] ++, r[y[i]] ++;
}
for( int i = 1; i <= n; i ++ )
ans += (l[x[i]]-1) * (r[y[i]]-1);
cout << ans << endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
2 ms |
576 KB |
Output is correct |
4 |
Correct |
1 ms |
576 KB |
Output is correct |
5 |
Correct |
2 ms |
576 KB |
Output is correct |
6 |
Correct |
1 ms |
576 KB |
Output is correct |
7 |
Correct |
2 ms |
716 KB |
Output is correct |
8 |
Correct |
2 ms |
716 KB |
Output is correct |
9 |
Correct |
2 ms |
716 KB |
Output is correct |
10 |
Correct |
2 ms |
716 KB |
Output is correct |
11 |
Correct |
2 ms |
716 KB |
Output is correct |
12 |
Correct |
8 ms |
1584 KB |
Output is correct |
13 |
Correct |
8 ms |
1728 KB |
Output is correct |
14 |
Correct |
13 ms |
2048 KB |
Output is correct |
15 |
Correct |
144 ms |
6308 KB |
Output is correct |
16 |
Correct |
152 ms |
6644 KB |
Output is correct |
17 |
Correct |
133 ms |
8488 KB |
Output is correct |
18 |
Correct |
129 ms |
10748 KB |
Output is correct |
19 |
Correct |
400 ms |
19688 KB |
Output is correct |
20 |
Correct |
288 ms |
22740 KB |
Output is correct |
21 |
Correct |
402 ms |
30736 KB |
Output is correct |
22 |
Correct |
396 ms |
37416 KB |
Output is correct |