제출 #965106

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
965106		becaido	Izvanzemaljci (COI21_izvanzemaljci)	C++17	0 / 100	1 ms	348 KiB

izvanzemaljci

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 1e5 + 5;

int n, k;
int x[SIZE], y[SIZE];

void solve() {
    cin >> n >> k;
    FOR (i, 1, n) cin >> x[i] >> y[i];
    if (k == 1) {
        int u, d, l, r;
        u = *min_element(x + 1, x + n + 1);
        d = *max_element(x + 1, x + n + 1);
        l = *min_element(y + 1, y + n + 1);
        r = *max_element(y + 1, y + n + 1);
        cout << u << ' ' << l << ' ' << max(d - u, r - l) << '\n';
        return;
    }
}

int main() {
    Waimai;
    solve();
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 21
• Subtask 3: 0 / 12
• Subtask 4: 0 / 30
• Subtask 5: 0 / 32