Submission #258751

#TimeUsernameProblemLanguageResultExecution timeMemory
258751SaboonHamburg Steak (JOI20_hamburg)C++14
2 / 100
1090 ms41108 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 2e5 + 10; const int inf = 1e9 + 1; multiset<int> Ls, Ds, Rs, Us; int L[maxn], R[maxn], D[maxn], U[maxn]; int main(){ ios_base::sync_with_stdio(false); int n, k; cin >> n >> k; for (int i = 1; i <= n; i++){ cin >> L[i] >> D[i] >> R[i] >> U[i]; Ls.insert(L[i]), Ds.insert(D[i]), Rs.insert(R[i]), Us.insert(U[i]); } if (k == 1){ cout << *Rs.begin() << " " << *Us.begin() << '\n'; } }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...