Submission #1100553

#	Time	Username	Problem	Language	Result	Execution time	Memory
1100553		vjudge1	Star triangles (IZhO11_triangle)	C++17	100 / 100	281 ms	9140 KiB

triangle

//UNSTOPPABLE
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define int long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define pii pair<int,int>
#define tpii pair <pair <int,int> , int>
#define bruh cout << "NO\n"
using namespace std;
using namespace __gnu_pbds;
const int N = 3e5 + 5;
int mod = 1e9 + 7;
const int INF = 1e18;
int n,x[N],y[N];
void Goldik(){
	cin >> n;
	map <int,int> mp , mp1;
	for(int i = 1 ; i <= n ; i++){
		cin >> x[i] >> y[i];
		mp[x[i]]++;
		mp1[y[i]]++;
	}	
	int ans = 0;
	for(int i = 1 ; i <= n ; i++){
		ans += (mp[x[i]] - 1) * (mp1[y[i]] - 1);
	}
	cout << ans;
}
//rewai mnogo zadach vozmozhno odna iz nih gde to popadetsya
//returning winter prime?
//chem prowe tem luchshe
signed main(/*AZ AZDAN UZDIKSIZ*/){
	//freopen("txt.in","r",stdin);
	//freopen("txt.out","w",stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	srand(time(0));
	int TT = 1;
	// cin >> TT;
	for(int i = 1 ; i <= TT ; i++){
		//cout << "Case " << i << ": ";
		Goldik();
	}
}

• Subtask 1: 100 / 100