oj.uz

답안 #520507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
520507 2022-01-30T08:04:26 Z N1NT3NDO Izvanzemaljci (COI21_izvanzemaljci) C++14
0 / 100
 1 ms 332 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 + 1, *max_element(y + 1, y + n + 1) - y0 + 1);
    cout << x0 << ' ' << y0 << ' ' << l;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 316 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 320 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -