# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597490 | hail | Star triangles (IZhO11_triangle) | C++17 | 267 ms | 16156 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;
using ll=long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
vector<ll> x_coor(n);
vector<ll> y_coor(n);
vector<pair<ll, ll>> coor(n);
ll x;
ll y;
for(int i=0; i<n; i++)
{
cin>>x>>y;
x_coor[i]=x;
y_coor[i]=y;
coor[i]=make_pair(x, y);
}
sort(x_coor.begin(), x_coor.end());
sort(y_coor.begin(), y_coor.end());
ll ans{};
ll t_x;
ll t_y;
for(auto i: coor)
{
t_x=upper_bound(x_coor.begin(), x_coor.end(), i.first)-lower_bound(x_coor.begin(), x_coor.end(), i.first);
t_y=upper_bound(y_coor.begin(), y_coor.end(), i.second)-lower_bound(y_coor.begin(), y_coor.end(), i.second);
ans+=(t_x-1)*(t_y-1);
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |