# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
386587 | timmyfeng | Hamburg Steak (JOI20_hamburg) | C++17 | 888 ms | 14616 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 200000, X = 1000000000;
vector<array<int, 2>> skewers;
array<int, 4> rects[N];
bool tested[N];
int n;
array<int, 4> bounds() {
int x1 = X, x2 = 1, y1 = X, y2 = 1;
for (int i = 0; i < n; ++i) {
if (!tested[i]) {
auto [x3, x4, y3, y4] = rects[i];
x1 = min(x1, x4);
x2 = max(x2, x3);
y1 = min(y1, y4);
y2 = max(y2, y3);
}
}
return {x1, x2, y1, y2};
}
void print() {
for (auto [x, y] : skewers) {
cout << x << " " << y << "\n";
}
exit(0);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |