#include <bits/stdc++.h>
#define endl '\n'
#define ep insert
#define F first
#define S second
using namespace std;
const int N=1e5+5;
int n,k,x[N],y[N];
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>n>>k;
for (int i=1;i<=n;i++) cin>>x[i]>>y[i];
sort(x+1,x+1+n);
sort(y+1,y+1+n);
int dis=max(x[n]-x[1],y[n]-y[1]);
if (dis==0) dis=1;
cout<<x[n]-dis<<' '<<y[n]-dis<<' '<<dis<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
328 KB |
Output is correct |
7 |
Correct |
35 ms |
3120 KB |
Output is correct |
8 |
Correct |
37 ms |
3060 KB |
Output is correct |
9 |
Correct |
39 ms |
3124 KB |
Output is correct |
10 |
Correct |
42 ms |
3120 KB |
Output is correct |
11 |
Correct |
34 ms |
3088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Unexpected end of file - int64 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Unexpected end of file - int64 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
212 KB |
Unexpected end of file - int64 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Unexpected end of file - int64 expected |
2 |
Halted |
0 ms |
0 KB |
- |