# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336951 | kutbilim_one | Star triangles (IZhO11_triangle) | C++14 | 423 ms | 9708 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.
/** @kutbilimone **/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define all(x) x.begin(),x.end()
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
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 res = 0;
for(int i = 0; i < n; i++){
res += (cntx[x[i]]-1) * (cnty[y[i]]-1);
}
cout << res << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |