# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975435 | vjudge1 | Star triangles (IZhO11_triangle) | C++17 | 392 ms | 15704 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;
#define int long long
signed main(){
int n;
cin >> n;
int x[n], y[n];
map<int, int> cntx, cnty;
for(int i = 0; i<n; i++){
cin >> x[i] >> y[i];
cntx[x[i]]++;
cnty[y[i]]++;
}
int ans = 0;
for(int i = 0; i<n; i++){
int xx = cntx[x[i]];
int yy = cnty[y[i]];
if(xx == 0 || yy == 0) continue;
ans += (xx - 1)*(yy - 1);
}
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |