# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171018 | beksultan04 | Star triangles (IZhO11_triangle) | C++14 | 912 ms | 9592 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define OK puts("OK");
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()
#define rep(i,n) for (i=0;i<(n);++i)
#define rep1(i,n) for (i=1;i<=(n);++i)
#define ret return
#define nemeshay ios::sync_with_stdio(0),cin.tie(0);
const int N=3e5+12,INF=1e9+7;
map <int,int> a,b;
int x[N],y[N];
main(){
int i,ans=0,j,n;
cin>>n;
vector <pii> v;
for (i=0;i<n;++i){
cin>>x[i]>>y[i];
a[x[i]]++;
b[y[i]]++;
}
for (i=0;i<n;++i){
ans+=(a[x[i]]-1)*(b[y[i]]-1);
}
cout <<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |