# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76990 | farukkastamonuda | Star triangles (IZhO11_triangle) | C++14 | 186 ms | 17020 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>
#define li 300005
using namespace std;
int n,x[li],y[li];
long long int cev;
unordered_map<int,int> xx,yy;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d %d",&x[i],&y[i]);
xx[x[i]]++;
yy[y[i]]++;
}
for(int i=1;i<=n;i++){
cev+=1ll*(xx[x[i]]-1)*(yy[y[i]]-1);
}
printf("%lld\n",cev);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |