# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
974622 | vjudge1 | Star triangles (IZhO11_triangle) | C++17 | 2066 ms | 4572 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;
pair <long long, long long> x[300001];
long long n, xi, yi, ans;
int main(){
cin >> n;
for (int i = 0; i < n; i++){
cin >> x[i].first >> x[i].second;
}
sort(x, x+n);
for (int i = 0; i < n; i++){
xi = 0;
yi = 0;
for (int j = 0; j < n; j++){
if(x[i].first == x[j].first && x[i].second == x[j].second){
continue;
} else {
if (x[i].first == x[j].first){
xi++;
}
if (x[i].second == x[j].second){
yi++;
}
}
}
ans += xi * yi;
}
cout << ans << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |