# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
687487 | speedyArda | Star triangles (IZhO11_triangle) | C++14 | 486 ms | 13224 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.
#include "bits/stdc++.h"
using namespace std;
map<int, long long> x_cnt;
map<int, long long> y_cnt;
int main()
{
int n;
cin >> n;
pair<int, int> coords[n+5];
for(int i = 0; i < n; i++) {
cin >> coords[i].first >> coords[i].second;
x_cnt[coords[i].first]++;
y_cnt[coords[i].second]++;
}
sort(coords, coords + n);
long long ans = 0;
for(int i = 0; i < n; i++)
{
ans += (x_cnt[coords[i].first] - 1) * (y_cnt[coords[i].second] - 1);
}
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |