# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
679226 | bebra | Boat (APIO16_boat) | C++17 | 2096 ms | 18964 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;
#define dbg(x) cerr << #x << ": " << x << endl;
struct Seg {
int l;
int r;
Seg(int _l = -1, int _r = -1) : l(_l), r(_r) {}
bool empty() const {
return r - l + 1 <= 0;
}
bool operator<(const Seg& other) const {
return tie(l, r) < tie(other.l, other.r);
}
bool operator==(const Seg& other) const {
return tie(l, r) == tie(other.l, other.r);
}
friend Seg intersect(const Seg& lhs, const Seg& rhs) {
return {max(lhs.l, rhs.l), min(lhs.r, rhs.r)};
}
};
# | 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... |