제출 #165994

#제출 시각아이디문제언어결과실행 시간메모리
165994GurbanStar triangles (IZhO11_triangle)C++11
0 / 100
2 ms376 KiB
#include <bits/stdc++.h> #define pb push_back #define ss second #define ff first #define N 100005 #define inf 1000000009 #define ll long long #define mid(a,b) (a+b)/2 using namespace std; ll n; ll sum; pair <ll,ll> a[3 * N]; map <ll,ll> m,p; map <pair<int,int>,int> k; int main() { cin >> n; for(int i = 1;i <= n;i++){ cin >> a[i].ff >> a[i].ss; if(k[a[i]] > 0) continue; k[a[i]]++; m[a[i].ff]++; p[a[i].ss]++; } for(int i = 1;i <= n;i++) sum += ((m[a[i].ff] - (ll)1) * (m[a[i].ss] - (ll)1)); cout << sum << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...