#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, k;
std::cin >> n >> k;
std::vector<int> l(n), d(n), r(n), u(n);
for (int i = 0; i < n; ++i) {
std::cin >> l[i] >> d[i] >> r[i] >> u[i];
}
auto intersect = [](int &l, int &r, int l1, int r1) {
l = std::max(l, l1);
r = std::min(r, r1);
};
int l1 = 1, r1 = 1e9, l2 = 1, r2 = 1e9;
for (int i = 0; i < n; ++i) {
intersect(l1, r1, l[i], r[i]);
intersect(l2, r2, d[i], u[i]);
}
std::cout << l1 << ' ' << l2 << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |