/* Ajay Jadhav */
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl '\n'
void solve()
{
int n, ans = 0;
cin>>n;
mi xs, ys;
vii a(n);
rep(i,0,n)
{
cin >> a[i].x >> a[i].y;
xs[a[i].x]++;
ys[a[i].y]++;
}
rep (i,0,n)
{
int xc = xs[a[i].x] - 1;
int yc = ys[a[i].y] - 1;
ans += (xc * yc);
}
cout<<ans<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
{
solve();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
460 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 |
0 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
5 ms |
1112 KB |
Output is correct |
13 |
Correct |
4 ms |
1164 KB |
Output is correct |
14 |
Correct |
8 ms |
1496 KB |
Output is correct |
15 |
Correct |
86 ms |
6144 KB |
Output is correct |
16 |
Correct |
94 ms |
6480 KB |
Output is correct |
17 |
Correct |
83 ms |
6088 KB |
Output is correct |
18 |
Correct |
84 ms |
6228 KB |
Output is correct |
19 |
Correct |
229 ms |
11604 KB |
Output is correct |
20 |
Correct |
167 ms |
9296 KB |
Output is correct |
21 |
Correct |
246 ms |
12160 KB |
Output is correct |
22 |
Correct |
251 ms |
12116 KB |
Output is correct |