# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1249067 | bethance | Star triangles (IZhO11_triangle) | C++20 | 698 ms | 30936 KiB |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x[n],y[n];
multiset<int> X ;
multiset<int> Y;
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
X.insert(x[i]);
Y.insert(y[i]);
}
int ans=0;
for(int i=0;i<n;i++){
int x1=X.count(x[i])-1;
int y1=Y.count(y[i])-1;
ans+=x1*y1;
}
cout<<ans<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |