Submission #1002814

#TimeUsernameProblemLanguageResultExecution timeMemory
1002814CabralbonzaoIzvanzemaljci (COI21_izvanzemaljci)C++17
0 / 100
0 ms348 KiB
#include<bits/stdc++.h> using namespace std; #define N 100010 #define INFLL 2000000000000000020 #define pb push_back typedef long long ll; typedef pair<ll,ll> pll; ll x[N]; ll y[N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n,k,i=0; ll mal=-INFLL,mar=-INFLL,mel=INFLL,mer=INFLL; cin >> n >> k; while(i<n) { cin >> x[i] >> y[i]; mal=max(mal,y[i]); mar=max(mar,x[i]); mel=min(mel,y[i]); mer=min(mer,x[i]); i++; } if(k==1) { cout << mer << " " << mel << " " << max(mar-mer,mal-mel) << endl; return 0; } 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...