제출 #998055

#제출 시각아이디문제언어결과실행 시간메모리
998055piOOEIzvanzemaljci (COI21_izvanzemaljci)C++17
0 / 100
1 ms348 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<int, int>> a(n);
    for (auto &[x, y] : a) {
        cin >> x >> y;
    }

    if (k == 1) {
        int minx = 1e9, maxx = -1e9, miny = 1e9, maxy = -1e9;
        for (auto &[x, y] : a) {
            minx = min(minx, x);
            maxx = max(maxx, x);
            miny = min(miny, y);
            maxy = max(maxy, y);
        }
        int d = max({1, maxy - miny, maxx - minx});
        cout << miny << " " << minx << " " << d << '\n';
        return 0;
    }

    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...