제출 #420603

#제출 시각아이디문제언어결과실행 시간메모리
420603JvThunderIzvanzemaljci (COI21_izvanzemaljci)C++17
5 / 100
36 ms1132 KiB
#include <bits/stdc++.h> #define pb push_back #define mp make_pair #define fir first #define sec second typedef long long ll; using namespace std; int n,k; void solve() { cin >> n >> k; ll mnx = 0; ll mxx = 0; ll mny = 0; ll mxy = 0; for(int i=0;i<n;i++) { ll x,y; cin >> x >> y; if(i==0) { mnx = mxx = x; mny = mxy = y; } else { mnx = min(mnx,x); mxx = max(mxx,x); mny = min(mny,y); mxy = max(mxy,y); } } ll tmp = max(mxx-mnx,mxy-mny); cout << mnx << " " << mny << " " << max(tmp,1LL) << endl; return; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...