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>
#define ll long long
#define endl "\n"
using namespace std;
const ll M=1000000009;
struct pt{
ll x,y;
};
int main() {
ll n,k;
cin>>n>>k;
pt a[n];
ll lx=M,ly=M,hx=-M,hy=-M;
for(int i=0;i<n;i++){
cin>>a[i].x>>a[i].y;
hx=max(hx,a[i].x);
hy=max(hy,a[i].y);
ly=min(ly,a[i].y);
lx=min(lx,a[i].x);
}
if(k<3){
if(k==1){
cout<<lx<<" "<<ly<<" "<<max(hx-lx,hy-ly)<<endl;
return 0;
}
/*cout<<lx<<" "<<ly<<" "<<min(hx-lx,hy-ly)<<endl;
if(hx-lx==)*/
}
}
# | 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... |