제출 #998059

#제출 시각아이디문제언어결과실행 시간메모리
998059piOOEIzvanzemaljci (COI21_izvanzemaljci)C++17
0 / 100
1 ms604 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; vector<pair<ll, ll>> a(n); for (auto &[x, y] : a) { cin >> x >> y; } if (k == 1) { ll minx = 2e9, maxx = -2e9, miny = 2e9, maxy = -2e9; for (auto &[x, y] : a) { minx = min(minx, x); maxx = max(maxx, x); miny = min(miny, y); maxy = max(maxy, y); } ll d = max({1LL, maxy - miny, maxx - minx}); cout << miny << " " << minx << " " << d << '\n'; return 0; } else { assert(false); } 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...