# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114185 | Icelast | Star triangles (IZhO11_triangle) | C++17 | 291 ms | 14664 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 <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 2*1e5+5, INF = 4e18+9;
struct point{
ll x, y;
};
void solve(){
int n;
cin >> n;
vector<point> a(n+1);
for(int i = 1; i <= n; i++){
cin >> a[i].x >> a[i].y;
}
map<int, int> mpx, mpy;
for(int i = 1; i <= n; i++){
mpx[a[i].x]++;
mpy[a[i].y]++;
}
ll ans = 0;
for(int i = 1; i <= n; i++){
ans += (long long)(mpx[a[i].x]-1) * (mpy[a[i].y]-1);
}
cout << ans;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |