Submission #420634

#TimeUsernameProblemLanguageResultExecution timeMemory
420634BertedIzvanzemaljci (COI21_izvanzemaljci)C++14
0 / 100
2 ms204 KiB
#include <iostream> #include <cassert> using namespace std; const int INF = 1e9 + 7; int N, K; int main() { cin >> N >> K; int mnY = INF, mxY = -INF, mnX = INF, mxX = -INF; for (int i = 0; i < N; i++) { int x, y; cin >> x >> y; mnY = min(mnY, y); mxY = max(mxY, y); mnX = min(mnX, x); mxX = max(mxX, x); } cout << mnX << " " << mnY << " " << max(mxX - mnX, mxY - mnY) << "\n"; 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...