# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90122 | Rashidov_Anis | Star triangles (IZhO11_triangle) | C++14 | 2 ms | 648 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 fr first
#define se second
#define sc scanf
#define pf printf
#define ld long double
#define ll long long
#define pb push_back
#define sq(n) n * n
#define r_0 return 0
#define pr pair < ll, ll >
#define prr pair < pair < ll, ll >, ll >
#define fin(s) freopen( s, "r", stdin )
#define fout(s) freopen( s, "w", stdout )
#define TIME ios_base::sync_with_stdio(0)
using namespace std;
const ll INF = 1e9;
const ll N = 3e5 + 3;
const ll mod = 998244353;
const ld eps = 1e-7;
ll n, ans;
pr a[N];
ll mx[N], my[N];
main(){
TIME;
cin >> n;
for( int i = 1; i <= n; i ++ ){
ll x, y;
cin >> x >> y;
mx[x]++;
my[y]++;
a[i] = { x, y };
}
for( int i = 1; i <= n; i ++ ){
ll x = a[i].fr;
ll y = a[i].se;
ll g = mx[x];
ll h = my[y];
g--, h--;
ans += g * h;
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |