Submission #687487

#TimeUsernameProblemLanguageResultExecution timeMemory
687487speedyArdaStar triangles (IZhO11_triangle)C++14
100 / 100
486 ms13224 KiB
#include "bits/stdc++.h" using namespace std; map<int, long long> x_cnt; map<int, long long> y_cnt; int main() { int n; cin >> n; pair<int, int> coords[n+5]; for(int i = 0; i < n; i++) { cin >> coords[i].first >> coords[i].second; x_cnt[coords[i].first]++; y_cnt[coords[i].second]++; } sort(coords, coords + n); long long ans = 0; for(int i = 0; i < n; i++) { ans += (x_cnt[coords[i].first] - 1) * (y_cnt[coords[i].second] - 1); } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...