# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1002872 | pedroslrey | Izvanzemaljci (COI21_izvanzemaljci) | C++14 | 94 ms | 10576 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;
using lli = long long;
int main() {
int n, k;
cin >> n >> k;
vector<pair<int, int>> points(n);
for (auto &[x, y]: points)
cin >> x >> y;
sort(points.begin(), points.end());
multiset<int> xs, ys;
for (auto [x, y]: points) {
xs.insert(x);
ys.insert(y);
}
if (k == 1) {
int d2 = max(*xs.rbegin() - *xs.begin(), *ys.rbegin() - *ys.begin());
d2 = max(d2, 1);
cout << *xs.begin() << " " << *ys.begin() << " " << d2 << "\n";
return 0;
}
int mx_x = 0, mn_x = 1e9, mx_y = 0, mn_y = 1e9;
Compilation message (stderr)
# | 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... |