Submission #88606

#TimeUsernameProblemLanguageResultExecution timeMemory
88606BadralStar triangles (IZhO11_triangle)C++17
100 / 100
852 ms13048 KiB
#include<bits/stdc++.h>

#define maxn 300000
#define ll long long
using namespace std;

pair<ll,ll> a[maxn+5];
map<ll, ll> u;
map<ll, ll> o;

int main() {
	ll n;
	cin >>n;
	for(ll i = 1; i <= n; i++) {
		cin >>a[i].first >>a[i].second;
		u[a[i].first]++;
		o[a[i].second]++;
	}
	ll s = 0;
	for(ll i = 1; i <= n; i++) {
		s += (u[a[i].first]-1) * (o[a[i].second]-1);
	}
	cout<<s;
}
#Verdict Execution timeMemoryGrader output
Fetching results...