Submission #743889

#TimeUsernameProblemLanguageResultExecution timeMemory
743889kxdIzvanzemaljci (COI21_izvanzemaljci)C++17
0 / 100
2 ms212 KiB
#include <bits/stdc++.h> #define int long long #define ll long long #define ld long double #define pb push_back #define p_q priority_queue #define m_p make_pair #define pii pair<int,int> #define endl '\n' #define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define FOR(i, a, b) for(int i = a; i <= b; i++) #define forn(i, n) for (int i = 0; i < n; i++) #define forn1(i, n) for (int i = 1; i <= n; i++) #define all(x) x.begin(),x.end() #define ft first #define sd second using namespace std; const int N = 1e5+5; const int inf = 1e9; const int INF = 1e18; const int MOD = 1e9+7; int a[N]; signed main() { INIT int n, k; cin >> n >> k; int x, y; int minx = INF, miny = INF, maxx = 0, maxy = 0; forn(i,n) { cin >> x >> y; minx = min(x,minx); miny = min(y,miny); maxx = max(x,maxx); maxy = max(y,maxy); } cout << minx << ' ' << miny << ' ' << max(maxx-minx,maxy-miny); }
#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...