# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334593 | sahil_k | Star triangles (IZhO11_triangle) | C++14 | 534 ms | 12396 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 <map>
using namespace std;
int main () {
int n;
cin >> n;
pair<int, int> pos[n];
for (int i=0; i<n; i++) {
cin >> pos[i].first >> pos[i].second;
}
map<int, int> rows;
for (int i=0; i<n; i++) {
rows[pos[i].first]++;
}
map<int, int> cols;
for (int i=0; i<n; i++) {
cols[pos[i].second]++;
}
long long o = 0;
for (int i=0; i<n; i++) {
o += 1ll*(rows[pos[i].first]-1)*(cols[pos[i].second]-1);
}
cout << o << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |