Submission #946519

#TimeUsernameProblemLanguageResultExecution timeMemory
946519sondos225Star triangles (IZhO11_triangle)C++17
100 / 100
255 ms15516 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL); #define pb push_back #define yes "YES" #define no "NO" #define bigg INT_MAX #define debug(x) cout<<(#x)<<" = " <<x<<endl; #define all(x) x.begin(),x.end() #define sz size() #define nn '\n' #define mms(x,y) memset(x,y,sizeof(x)) #define forr(i,j,n) for (int i=j; i<n; i++) #define forn(i,j,n) for (int i=j; i>n; i--) #define fi first #define se second #define la "LA" #define cinn(x,y) for(int i=0; i<y; i++) cin>>x[i]; #define pii pair<int,int> signed main() { // #ifndef LOCAL // freopen("lifeguards.in","r",stdin); // freopen("lifeguards.out","w", stdout); // #endif fast int n; cin>>n; pii a[n]; map<int,int> mx; map<int,int> my; forr(i,0,n) { cin>>a[i].fi >>a[i].se; mx[a[i].fi]++; my[a[i].se]++; } int ans=0; forr(i,0,n) { ans+=((mx[a[i].fi]-1)*(my[a[i].se]-1)); // cin>>a[i].fi >>a[i].se; // ++; // ++; } cout<<ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...