# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
87666 | thebes | Star triangles (IZhO11_triangle) | C++14 | 547 ms | 22784 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;
const int MN = 3e5+5;
map<int,int> x, y;
pair<int,int> p[MN];
int N, i; long long ans;
int main(){
for(scanf("%d",&N),i=1;i<=N;i++){
scanf("%d%d",&p[i].first,&p[i].second);
x[p[i].first]++;
y[p[i].second]++;
}
for(i=1;i<=N;i++)
ans += (x[p[i].first]-1)*1LL*(y[p[i].second]-1);
printf("%lld\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |