# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
726383 | Toxtaq | Star triangles (IZhO11_triangle) | C++17 | 773 ms | 23968 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;
int main()
{
int n;
cin >> n;
map<int, int>cntx, cnty;
set<pair<int, int>>s;
for(int i = 0;i < n;++i){
int x, y;
cin >> x >> y;
s.insert({x, y});
cntx[x]++;
cnty[y]++;
}
long long res = 0;
for(pair<int, int>i : s){
int x = i.first, y = i.second;
// cout << cntx[x] << " " << cnty[y] << '\n';
res += (long long)(cntx[x] - 1) * (cnty[y] - 1);
}
cout << res;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |