# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
170744 | juggernaut | Star triangles (IZhO11_triangle) | C++14 | 778 ms | 15728 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.
//Just try and the idea will come!
#include<bits/stdc++.h>
#define int long long int
using namespace std;
map<int,int>x,y;
int n,i,res;
pair<int,int>p[300001];
main(){
scanf("%lld",&n);
for(i=1;i<=n;i++){
scanf("%lld%lld",&p[i].first,&p[i].second);
x[p[i].first]++;
y[p[i].second]++;
}
for(i=1;i<=n;i++)res+=(x[p[i].first]-1)*(y[p[i].second]-1);
cout<<res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |