#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
typedef pair<int, int> point;
typedef pair<point, point> rect;
const int N = 200'000;
int n, k;
point a[N + 10], b[N + 10];
rect r[N + 10];
void readInput() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i].X >> a[i].Y;
cin >> b[i].X >> b[i].Y;
r[i] = {{a[i].X, b[i].X}, {a[i].Y, b[i].Y}};
}
}
point common(point a, point b) {
return {max(a.first, b.first), min(a.second, b.second)};
}
rect common(rect a, rect b) {
return {common(a.first, b.first), common(a.second, b.second)};
}
void solveSub1() {
rect res = r[1];
for (int i = 2; i <= n; i++)
res = common(res, r[i]);
cout << res.X.X << ' ' << res.Y.X << flush;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
readInput();
if (k == 1)
solveSub1();
return 0;
}
# | 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... |