#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; #define fi first #define se second #define vi vector<int> #define vll vector<long long> #define pii pair<int, int> #define pll pair<long long, long long> #define pb push_back #define mp make_pair #define eb emplace_back #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count()); inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);} inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);} #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif struct custom_hash { static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } }; struct pair_hash{ size_t operator()(const pair<int,int>&x)const{ return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32)); } }; const int INF = 2e9 + 7; vector<pair<pii, int>> solve(vector<pii> a, int n, int k){ if(k == 1){ int mxX = -INF; int mxY = -INF; int mnX = INF; int mnY = INF; for(auto ele : a){ mxX = max(mxX, ele.fi); mnX = min(mnX, ele.fi); mxY = max(mxY, ele.se); mnY = min(mnY, ele.se); } vector<pair<pii, int>> ret = {mp(mp(mnX, mnY), max(mxX - mnX, mxY - mnY))}; return ret; } } int main(){ ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); int n, k; cin >> n >> k; vector<pii> a(n); for(int i = 0; i < n; i++){ cin >> a[i].fi >> a[i].se; } vector<pair<pii, int>> res; int best = INF; for(int i = 0; i < 2; i++){ for(int j = 0; j < 2; j++){ vector<pair<pii, int>> curr = solve(a, n, k); int nbest = INF; for(auto ele : curr){ nbest = min(nbest, ele.se); } if(nbest < best){ res = curr; best = nbest; if(j){ for(auto& ele : curr){ ele.fi.se = -ele.fi.se; } } if(i){ for(auto& ele : curr){ swap(ele.fi.fi, ele.fi.se); } } } for(int j2 = 0; j2 < n; j2++){ a[j2].se = -a[j2].se; } } for(int j = 0; j < n; j++){ swap(a[j].fi, a[j].se); } } for(auto ele : res){ cout << ele.fi.fi << ' ' << ele.fi.se << ' ' << ele.se << '\n'; } return 0; }

izvanzemaljci.cpp: In function 'std::vector<std::pair<std::pair<int, int>, int> > solve(std::vector<std::pair<int, int> >, int, int)':
izvanzemaljci.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
   68 | }
      | ^