Submission #1219529

#TimeUsernameProblemLanguageResultExecution timeMemory
1219529LM1Star triangles (IZhO11_triangle)C++20
0 / 100
0 ms328 KiB
#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; map<pii,int>f; 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; } 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]; } z=1; fr(i,1,n+1){ if(mp.count(p[i].ss)==0){ mp[p[i].ss]=z; z++; } } fr(i,1,n+1){ p[i].ss=mp[p[i].ss]; } fr(i,1,n+1){ x[p[i].ff]++; y[p[i].ss]++; f[p[i]]++; //cout<<p[i].ff<<" "<<p[i].ss<<"\n"; } int ans=0; fr(i,1,n+1){ ans+=(x[p[i].ff]-f[p[i]])*(y[p[i].ss]-f[p[i]]); } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...