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;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
#define file ""
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define popcount __builtin_popcountll
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
return l + rd() % (r - l + 1);
}
const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;
template<class X, class Y> bool mini(X &a, Y b) {
return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
a += b;
if (a >= mod) a -= mod;
if (a < 0) a += mod;
}
int n, k;
pair<int, int> a[N];
namespace task1 {
void solve() {
int maxx, maxy, minx, miny;
maxx = maxy = -oo;
minx = miny = oo;
for (int i = 1; i <= n; ++i) {
int x, y;
tie(x, y) = a[i];
maxi(maxx, x);
maxi(maxy, y);
mini(minx, x);
mini(miny, y);
}
int w = maxx - minx;
int h = maxy - miny;
int l = max(w, h);
l = max(l, 1);
debug(w, h);
cout << minx << ' ' << miny << ' ' << l;
}
}
namespace task2 {
int pre_min_x[N], pre_min_y[N], pre_max_x[N], pre_max_y[N];
int suf_min_x[N], suf_min_y[N], suf_max_x[N], suf_max_y[N];
array<int, 3> res[3];
void solve() {
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; ++i) debug(a[i]);
pre_min_x[0] = pre_min_y[0] = suf_min_x[n + 1] = suf_min_y[n + 1] = oo;
pre_max_x[0] = pre_max_y[0] = suf_max_x[n + 1] = suf_max_y[n + 1] = -oo;
for (int i = 1; i <= n; ++i) {
int x, y;
tie(x, y) = a[i];
pre_min_x[i] = min(pre_min_x[i - 1], x);
pre_max_x[i] = max(pre_max_x[i - 1], x);
pre_min_y[i] = min(pre_min_y[i - 1], y);
pre_max_y[i] = max(pre_max_y[i - 1], y);
}
for (int i = n; i >= 1; --i) {
int x, y;
tie(x, y) = a[i];
suf_min_x[i] = min(suf_min_x[i + 1], x);
suf_max_x[i] = max(suf_max_x[i + 1], x);
suf_min_y[i] = min(suf_min_y[i + 1], y);
suf_max_y[i] = max(suf_max_y[i + 1], y);
}
res[0][2] = res[1][2] = oo;
for (int i = 1; i < n; ++i) {
// first photo
int l1 = max({1, pre_max_x[i] - pre_min_x[i], pre_max_y[i] - pre_min_y[i]});
int x1 = pre_min_x[i];
int y1 = pre_min_y[i];
debug(x1, y1, l1);
// second photo
int l2 = max({1, suf_max_x[i + 1] - suf_min_x[i + 1], suf_max_y[i + 1] - suf_min_y[i + 1]});
int x2 = suf_min_x[i + 1];
int y2 = suf_min_y[i + 1];
debug(x2, y2, l2);
// get best
if (max(l1, l2) < max(res[0][2], res[1][2])) {
res[0] = {x1, y1, l1};
res[1] = {x2, y2, l2};
}
}
for (int i = 0; i < 2; ++i) {
for (int x : res[i]) cout << x << ' ';
cout << '\n';
}
}
}
void process() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) cin >> a[i].fi >> a[i].se;
if (k == 1) {task1::solve(); return;}
if (k == 2) {task2::solve(); return;}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#else
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
#endif
int tc = 1;
// cin >> tc;
while (tc--) {
process();
}
return 0;
}
/*
*/
Compilation message (stderr)
izvanzemaljci.cpp: In function 'void task1::solve()':
izvanzemaljci.cpp:8:20: warning: statement has no effect [-Wunused-value]
8 | #define debug(...) 42
| ^~
izvanzemaljci.cpp:69:5: note: in expansion of macro 'debug'
69 | debug(w, h);
| ^~~~~
izvanzemaljci.cpp: In function 'void task2::solve()':
izvanzemaljci.cpp:8:20: warning: statement has no effect [-Wunused-value]
8 | #define debug(...) 42
| ^~
izvanzemaljci.cpp:87:34: note: in expansion of macro 'debug'
87 | for (int i = 1; i <= n; ++i) debug(a[i]);
| ^~~~~
izvanzemaljci.cpp:8:20: warning: statement has no effect [-Wunused-value]
8 | #define debug(...) 42
| ^~
izvanzemaljci.cpp:119:9: note: in expansion of macro 'debug'
119 | debug(x1, y1, l1);
| ^~~~~
izvanzemaljci.cpp:8:20: warning: statement has no effect [-Wunused-value]
8 | #define debug(...) 42
| ^~
izvanzemaljci.cpp:126:9: note: in expansion of macro 'debug'
126 | debug(x2, y2, l2);
| ^~~~~
# | 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... |