#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Tran The Bao - ghostwriter
Training for VOI23 gold medal
----------------------------------------------------------------
DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
const int N = 3e5 + 5;
int n;
pi a[N];
map<int, int> d, d1;
map<pi, int> d2;
ll rs = 0;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
cin >> n;
FOR(i, 1, n) cin >> a[i].st >> a[i].nd;
FOR(i, 1, n) {
++d[a[i].st];
++d1[a[i].nd];
++d2[a[i]];
}
FOR(i, 1, n) {
int cnt1 = d[a[i].st] - d2[a[i]], cnt2 = d1[a[i].nd] - d2[a[i]];
rs += 1LL * cnt1 * cnt2;
}
cout << rs;
return 0;
}
/*
----------------------------------------------------------------
From Benq:
stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/
Compilation message
triangle.cpp: In function 'int main()':
triangle.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
| ^
triangle.cpp:60:5: note: in expansion of macro 'FOR'
60 | FOR(i, 1, n) cin >> a[i].st >> a[i].nd;
| ^~~
triangle.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
| ^
triangle.cpp:61:5: note: in expansion of macro 'FOR'
61 | FOR(i, 1, n) {
| ^~~
triangle.cpp:30:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
30 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
| ^
triangle.cpp:66:5: note: in expansion of macro 'FOR'
66 | FOR(i, 1, n) {
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
332 KB |
Output is correct |
| 4 |
Correct |
1 ms |
324 KB |
Output is correct |
| 5 |
Correct |
1 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
328 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
13 ms |
1656 KB |
Output is correct |
| 13 |
Correct |
13 ms |
1596 KB |
Output is correct |
| 14 |
Correct |
13 ms |
2004 KB |
Output is correct |
| 15 |
Correct |
217 ms |
12440 KB |
Output is correct |
| 16 |
Correct |
219 ms |
13308 KB |
Output is correct |
| 17 |
Correct |
202 ms |
12488 KB |
Output is correct |
| 18 |
Correct |
224 ms |
12436 KB |
Output is correct |
| 19 |
Correct |
733 ms |
25664 KB |
Output is correct |
| 20 |
Correct |
524 ms |
20168 KB |
Output is correct |
| 21 |
Correct |
815 ms |
27184 KB |
Output is correct |
| 22 |
Correct |
839 ms |
27192 KB |
Output is correct |
