# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866139 | dilanyan | Star triangles (IZhO11_triangle) | C++17 | 251 ms | 13396 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//-------------dilanyan------------\\
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
//------------------KarginDefines--------------------\\
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_setq
#define Kargin ios_base::sync_with_stdio(false);cin.tie(NULL);
#define Usaco freopen(".in", "r", stdin); freopen(".out", "w", stdout);
//-------------------KarginConstants------------------\\
const ll mod = 1000000007;
const ll inf = 1e9;
//-------------------KarginCode------------------------\\
const int N = 300005;
int x[N], y[N];
map<int, ll> mx, my;
void KarginSolve() {
int n; cin >> n;
for (int i = 0; i < n;i++) {
cin >> x[i] >> y[i];
mx[x[i]]++, my[y[i]]++;
}
ll ans = 0;
for (int i = 0;i < n;i++) ans += (mx[x[i]] - 1) * (my[y[i]] - 1);
cout << ans << '\n';
}
int main() {
// Usaco
Kargin;
int test = 1;
//cin >> test;
while (test--) {
KarginSolve();
}
return 0;
}
// There is nothing we can do
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |