# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
304150 | _Ibrohim_ | Star triangles (IZhO11_triangle) | C++14 | 579 ms | 15736 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>
#define ll long long
#define pb push_back
#define fr first
#define sc second
#define ld long double
using namespace std;
const ll N = 3e5 + 7;
const ll mod = 1e9 + 7;
ll n , x[N] , y[N];
map < ll , ll > X , Y;
void solve(){
cin >> n;
for(int i = 1; i <= n; ++ i){
cin >> x[i] >> y[i];
X[x[i]] ++;
Y[y[i]] ++;
}
ll ans = 0;
for(int i = 1; i <= n; ++ i){
X[x[i]] --;
Y[y[i]] --;
ans += X[x[i]] * Y[y[i]];
X[x[i]] ++;
Y[y[i]] ++;
}
cout << ans;
}
main(){
/// ******************************
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll tt = 1;
/// ******************************
//cin >> tt;
while(tt --){
solve();
}
return 0;
}
/**
**/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |