# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
420894 | 2021-06-08T14:42:27 Z | MetalPower | Izvanzemaljci (COI21_izvanzemaljci) | C++14 | 27 ms | 312 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long int N, K; int main(){ ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cin >> N >> K; if(K == 1){ ll min_x, max_x, min_y, max_y; for(int i = 0; i < N; i++){ ll x, y; cin >> x >> y; if(i == 0){ min_x = max_x = x; min_y = max_y = y; }else{ min_x = min(min_x, x); max_x = max(max_x, x); min_y = min(min_y, y); max_y = max(max_y, y); } } cout << min_x << " " << min_y << " " << max(1ll, max(max_x - min_x, max_y - min_y)) << '\n'; }else{ cout << "AC" << '\n'; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
7 | Correct | 26 ms | 312 KB | Output is correct |
8 | Correct | 26 ms | 312 KB | Output is correct |
9 | Correct | 27 ms | 308 KB | Output is correct |
10 | Correct | 26 ms | 312 KB | Output is correct |
11 | Correct | 26 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Expected integer, but "AC" found |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Expected integer, but "AC" found |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Expected integer, but "AC" found |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Expected integer, but "AC" found |
2 | Halted | 0 ms | 0 KB | - |