# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
592984 | Hanksburger | Star triangles (IZhO11_triangle) | C++17 | 323 ms | 12176 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;
int x[300005], y[300005];
map<int, int> mpx, mpy;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int i=1; i<=n; i++)
{
cin >> x[i] >> y[i];
mpx[x[i]]++;
mpy[y[i]]++;
}
long long ans=0;
for (int i=1; i<=n; i++)
ans+=(mpx[x[i]]-1LL)*(mpy[y[i]]-1);
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |