# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
318733 | Temmie | Star triangles (IZhO11_triangle) | C++17 | 541 ms | 11620 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>
typedef long long ll;
struct P {
ll x, y;
void read(std::map <ll, ll>& mx, std::map <ll, ll>& my) {
std::cin >> x >> y;
bool existX = mx.find(x) == mx.end(), existY = my.find(y) == my.end();
mx[x]++, my[y]++;
mx[x] -= existX, my[y] -= existY;
}
};
int main() {
std::ios::sync_with_stdio(0); std::cin.tie(0);
int n; std::cin >> n;
ll ans = 0;
std::map <ll, ll> mx, my;
std::vector <P> a(n);
for (auto& p : a) p.read(mx, my);
while (n--) ans += mx[a[n].x] * my[a[n].y];
std::cout << ans << "\n";
//std::cout.flush(); std::cin >> n;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |