제출 #1310607

#제출 시각아이디문제언어결과실행 시간메모리
1310607quollcucumber`Izvanzemaljci (COI21_izvanzemaljci)C++20
0 / 100
1 ms340 KiB
// #pragma GCC optimize("Ofast,unroll-loops") #include <bits/stdc++.h> // #pragma GCC target("avx2") #define int long long using namespace std; signed main(){ int n, k; cin >> n >> k; if(k == 1) { int minx = LONG_LONG_MAX, miny = LONG_LONG_MAX, maxy = 0, maxx = 0; for(int i = 0; i < n; i++) { int x, y; cin >> x >>y; minx = min(x, minx); miny = min(y, miny); maxx = max(x, maxx); maxy = max(y, maxy); } cout<<minx<<' '<<maxx<<' '<<max(maxx - minx, maxy - miny)<<'\n'; }else { assert(1 == 2); } 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...