# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
87938 | turbat | Star triangles (IZhO11_triangle) | C++14 | 3 ms | 376 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;
#define F first
#define S second
int n;
long long ans;
pair <int, int> p[300005];
map <int, int> my, mx;
int main (){
freopen ("input.in", "r", stdin);
freopen ("output.out", "w", stdout);
cin >> n;
for (int i = 0;i < n;i++){
cin >> p[i].F>> p[i].S;
mx[p[i].F]++;
my[p[i].S]++;
}
for (int i = 0;i < n;i++)
ans += (mx[p[i].F] - 1) * (my[p[i].S] - 1);
cout << ans<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |