# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975933 | vjudge1 | Star triangles (IZhO11_triangle) | C++17 | 414 ms | 9200 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 int long long
using namespace std;
signed main (){
int n,ans = 0; cin >> n;
map<int,int> x;
map<int,int> y;
pair<int,int> arr[n+1];
for(int i =0;i<n;i++){
int u,v; cin >> u >> v;
x[u]++;
y[v]++;
arr[i] = {u,v}; //x,y
}
for(int i = 0;i<n;i++){
// cout << arr[i].first << " " << x[arr[i].first] << " | " << arr[i].second << " " << y[arr[i].second] << endl;
ans += (x[arr[i].first]-1) * (y[arr[i].second]-1);
}
cout << ans << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |