답안 #520513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
520513 2022-01-30T08:09:07 Z N1NT3NDO Izvanzemaljci (COI21_izvanzemaljci) C++14
5 / 100
27 ms 3100 KB
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define sz(x) (int)x.size()
#define fi first
#define sd second
#define all(x) x.begin(), x.end()

using namespace std;
//using namespace __gnu_pbds;

//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("avx2")

const int N = (int)1e5 + 500;
int n, k, x[N], y[N];

int main()
{
    ios::sync_with_stdio(0); cin.tie(NULL);
    cin >> n >> k;
    for(int i = 1; i <= n; i++) cin >> x[i] >> y[i];
    int x0 = *min_element(x + 1, x + n + 1), y0 = *min_element(y + 1, y + n + 1);
    int l = max(*max_element(x + 1, x + n + 1) - x0, *max_element(y + 1, y + n + 1) - y0);
    cout << x0 << ' ' << y0 << ' ' << max(l, 1);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 27 ms 3064 KB Output is correct
8 Correct 21 ms 3100 KB Output is correct
9 Correct 22 ms 3064 KB Output is correct
10 Correct 23 ms 3012 KB Output is correct
11 Correct 22 ms 3056 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -