# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
481520 | Kalashnikov | Star triangles (IZhO11_triangle) | C++17 | 876 ms | 30952 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 ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const int N = 3e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
int x[N] , y[N];
void solve(int tc) {
int n;
cin >> n;
map<int,int> cntx , cnty;
map<pair<int,int>,int> cnt;
for(int i= 1; i <= n; i ++) {
cin >> x[i] >> y[i];
cntx[x[i]] ++;
cnty[y[i]] ++;
cnt[{x[i] , y[i]}] ++;
}
ll ans = 0;
for(int i = 1; i <= n; i ++) {
int X = cntx[x[i]] - cnt[{x[i] , y[i]}];
int Y = cnty[y[i]] - cnt[{x[i] , y[i]}];
ans += 1ll*X*Y*cnt[{x[i] , y[i]}];
}
cout << ans;
}
/*
*/
main() {
file("triangles");
ios;
int tt = 1 , tc = 0;
// cin >> tt;
while(tt --) {
solve(++tc);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |