Submission #839214

#TimeUsernameProblemLanguageResultExecution timeMemory
839214AlfraganusStar triangles (IZhO11_triangle)C++17
100 / 100
416 ms15540 KiB
#include <bits/stdc++.h> using namespace std; #define fs first #define ss second #define ll long long int main(){ int n; cin >> n; map<ll, ll> X, Y; vector<pair<ll, ll>> a(n); for(int i = 0; i < n; i ++){ cin >> a[i].fs >> a[i].ss; X[a[i].fs] ++; Y[a[i].ss] ++; } ll ans = 0; for(int i = 0; i < n; i ++) ans += 1ll * (X[a[i].fs] - 1) * (Y[a[i].ss] - 1); cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...