Submission #1219520

#	Time	Username	Problem	Language	Result	Execution time	Memory
1219520		LM1	Star triangles (IZhO11_triangle)	C++20	0 / 100	1 ms	328 KiB

triangle

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define fr(i,ii,iii) for(int i=ii;i<iii;i++)
const int N=3e5+5;
int n;
pii p[N];
map<int,int>mp;
int x[N],y[N];
signed main(){
	ios_base::sync_with_stdio(NULL);cin.tie(NULL);
	cin>>n;
	fr(i,1,n+1){
		cin>>p[i].ff>>p[i].ss;
	}
	sort(p+1,p+n+1);
	int z=1;
	fr(i,1,n+1){
		if(mp.count(p[i].ff)==0){
			mp[p[i].ff]=z;
			z++;
		}
	}
	fr(i,1,n+1){
		p[i].ff=mp[p[i].ff];
		swap(p[i].ff,p[i].ss);
	}
	sort(p+1,p+n+1);
	z=1;
	fr(i,1,n+1){
		if(mp.count(p[i].ff)==0){
			mp[p[i].ff]=z;
			z++;
		}
	}
	fr(i,1,n+1){
		p[i].ff=mp[p[i].ff];
		swap(p[i].ff,p[i].ss);
	}
	fr(i,1,n+1){
		x[p[i].ff]++;
		y[p[i].ss]++;
	}
	int ans=0;
	fr(i,1,n+1){
		ans+=(x[p[i].ff]-1)*(y[p[i].ss]-1);
	}
	cout<<ans;
}

• Subtask 1: 0 / 100